/usr/bin/java -Xmx8000000000 -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-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-?-3902331-m [2022-09-20 23:14:38,175 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-20 23:14:38,176 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-20 23:14:38,193 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-20 23:14:38,193 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-20 23:14:38,194 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-20 23:14:38,195 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-20 23:14:38,196 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-20 23:14:38,197 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-20 23:14:38,198 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-20 23:14:38,199 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-20 23:14:38,199 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-20 23:14:38,200 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-20 23:14:38,200 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-20 23:14:38,201 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-20 23:14:38,202 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-20 23:14:38,202 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-20 23:14:38,215 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-20 23:14:38,216 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-20 23:14:38,217 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-20 23:14:38,218 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-20 23:14:38,223 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-20 23:14:38,225 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-20 23:14:38,226 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-20 23:14:38,232 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-20 23:14:38,232 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-20 23:14:38,232 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-20 23:14:38,232 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-20 23:14:38,233 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-20 23:14:38,233 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-20 23:14:38,233 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-20 23:14:38,234 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-20 23:14:38,234 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-20 23:14:38,234 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-20 23:14:38,235 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-20 23:14:38,235 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-20 23:14:38,236 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-20 23:14:38,236 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-20 23:14:38,236 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-20 23:14:38,236 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-20 23:14:38,237 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-20 23:14:38,240 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-PN-NoLbe.epf [2022-09-20 23:14:38,262 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-20 23:14:38,263 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-20 23:14:38,263 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-20 23:14:38,264 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-20 23:14:38,264 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-20 23:14:38,264 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-20 23:14:38,265 INFO L138 SettingsManager]: * Use SBE=true [2022-09-20 23:14:38,265 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-20 23:14:38,265 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-20 23:14:38,265 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-20 23:14:38,265 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-20 23:14:38,265 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-20 23:14:38,266 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-20 23:14:38,266 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-20 23:14:38,266 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-20 23:14:38,266 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-20 23:14:38,266 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-20 23:14:38,266 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-20 23:14:38,266 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-20 23:14:38,266 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-20 23:14:38,266 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-20 23:14:38,266 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-20 23:14:38,266 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-20 23:14:38,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 23:14:38,267 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-20 23:14:38,267 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-20 23:14:38,267 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-20 23:14:38,267 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-20 23:14:38,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-20 23:14:38,267 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-20 23:14:38,268 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-09-20 23:14:38,268 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-09-20 23:14:38,453 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-20 23:14:38,471 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-20 23:14:38,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-20 23:14:38,473 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-20 23:14:38,473 INFO L275 PluginConnector]: CDTParser initialized [2022-09-20 23:14:38,474 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c [2022-09-20 23:14:38,519 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df6ea55ac/633a4df8cf0b49419293c0ea6c3b2428/FLAGff10ea323 [2022-09-20 23:14:38,912 INFO L306 CDTParser]: Found 1 translation units. [2022-09-20 23:14:38,912 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c [2022-09-20 23:14:38,920 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df6ea55ac/633a4df8cf0b49419293c0ea6c3b2428/FLAGff10ea323 [2022-09-20 23:14:38,930 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df6ea55ac/633a4df8cf0b49419293c0ea6c3b2428 [2022-09-20 23:14:38,933 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-20 23:14:38,935 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-20 23:14:38,937 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-20 23:14:38,937 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-20 23:14:38,939 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-20 23:14:38,939 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 11:14:38" (1/1) ... [2022-09-20 23:14:38,940 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32867396 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:14:38, skipping insertion in model container [2022-09-20 23:14:38,941 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 11:14:38" (1/1) ... [2022-09-20 23:14:38,946 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-20 23:14:38,968 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-20 23:14:39,130 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-array-sum2.wvr.c[2599,2612] [2022-09-20 23:14:39,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 23:14:39,149 INFO L203 MainTranslator]: Completed pre-run [2022-09-20 23:14:39,177 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-array-sum2.wvr.c[2599,2612] [2022-09-20 23:14:39,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 23:14:39,197 INFO L208 MainTranslator]: Completed translation [2022-09-20 23:14:39,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:14:39 WrapperNode [2022-09-20 23:14:39,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-20 23:14:39,198 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-20 23:14:39,198 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-20 23:14:39,198 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-20 23:14:39,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:14:39" (1/1) ... [2022-09-20 23:14:39,218 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:14:39" (1/1) ... [2022-09-20 23:14:39,252 INFO L138 Inliner]: procedures = 25, calls = 52, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 271 [2022-09-20 23:14:39,253 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-20 23:14:39,254 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-20 23:14:39,254 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-20 23:14:39,254 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-20 23:14:39,259 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:14:39" (1/1) ... [2022-09-20 23:14:39,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:14:39" (1/1) ... [2022-09-20 23:14:39,270 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:14:39" (1/1) ... [2022-09-20 23:14:39,270 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:14:39" (1/1) ... [2022-09-20 23:14:39,278 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:14:39" (1/1) ... [2022-09-20 23:14:39,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:14:39" (1/1) ... [2022-09-20 23:14:39,283 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:14:39" (1/1) ... [2022-09-20 23:14:39,284 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-20 23:14:39,285 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-20 23:14:39,285 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-20 23:14:39,285 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-20 23:14:39,291 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:14:39" (1/1) ... [2022-09-20 23:14:39,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 23:14:39,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 23:14:39,323 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-09-20 23:14:39,341 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-09-20 23:14:39,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-20 23:14:39,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-20 23:14:39,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-20 23:14:39,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-09-20 23:14:39,354 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-09-20 23:14:39,354 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-09-20 23:14:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-09-20 23:14:39,355 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-09-20 23:14:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-09-20 23:14:39,355 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-09-20 23:14:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-20 23:14:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-09-20 23:14:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-09-20 23:14:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-09-20 23:14:39,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-20 23:14:39,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-20 23:14:39,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-20 23:14:39,357 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-20 23:14:39,463 INFO L234 CfgBuilder]: Building ICFG [2022-09-20 23:14:39,464 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-20 23:14:39,839 INFO L275 CfgBuilder]: Performing block encoding [2022-09-20 23:14:40,076 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-20 23:14:40,076 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-09-20 23:14:40,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 11:14:40 BoogieIcfgContainer [2022-09-20 23:14:40,078 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-20 23:14:40,083 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-20 23:14:40,083 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-20 23:14:40,086 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-20 23:14:40,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 11:14:38" (1/3) ... [2022-09-20 23:14:40,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d075d9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 11:14:40, skipping insertion in model container [2022-09-20 23:14:40,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:14:39" (2/3) ... [2022-09-20 23:14:40,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d075d9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 11:14:40, skipping insertion in model container [2022-09-20 23:14:40,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 11:14:40" (3/3) ... [2022-09-20 23:14:40,088 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum2.wvr.c [2022-09-20 23:14:40,099 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-20 23:14:40,100 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-09-20 23:14:40,100 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-20 23:14:40,147 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-09-20 23:14:40,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 187 places, 193 transitions, 410 flow [2022-09-20 23:14:40,231 INFO L130 PetriNetUnfolder]: 16/190 cut-off events. [2022-09-20 23:14:40,231 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-09-20 23:14:40,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 190 events. 16/190 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 113 event pairs, 0 based on Foata normal form. 0/173 useless extension candidates. Maximal degree in co-relation 152. Up to 2 conditions per place. [2022-09-20 23:14:40,235 INFO L82 GeneralOperation]: Start removeDead. Operand has 187 places, 193 transitions, 410 flow [2022-09-20 23:14:40,239 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 173 places, 179 transitions, 376 flow [2022-09-20 23:14:40,245 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-09-20 23:14:40,250 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5fbb0e3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-20 23:14:40,250 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-09-20 23:14:40,278 INFO L130 PetriNetUnfolder]: 16/178 cut-off events. [2022-09-20 23:14:40,278 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-09-20 23:14:40,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:14:40,279 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 23:14:40,280 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:14:40,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:14:40,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1717085897, now seen corresponding path program 1 times [2022-09-20 23:14:40,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:14:40,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152365403] [2022-09-20 23:14:40,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:14:40,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:14:40,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:14:40,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:14:40,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:14:40,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152365403] [2022-09-20 23:14:40,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152365403] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 23:14:40,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 23:14:40,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-20 23:14:40,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323509158] [2022-09-20 23:14:40,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 23:14:40,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-09-20 23:14:40,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:14:40,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-09-20 23:14:40,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-09-20 23:14:40,506 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 193 [2022-09-20 23:14:40,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 179 transitions, 376 flow. Second operand has 2 states, 2 states have (on average 176.0) internal successors, (352), 2 states have internal predecessors, (352), 0 states have call successors, (0), 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-09-20 23:14:40,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:14:40,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 193 [2022-09-20 23:14:40,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:14:40,597 INFO L130 PetriNetUnfolder]: 42/301 cut-off events. [2022-09-20 23:14:40,597 INFO L131 PetriNetUnfolder]: For 49/50 co-relation queries the response was YES. [2022-09-20 23:14:40,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 392 conditions, 301 events. 42/301 cut-off events. For 49/50 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 725 event pairs, 15 based on Foata normal form. 45/313 useless extension candidates. Maximal degree in co-relation 216. Up to 59 conditions per place. [2022-09-20 23:14:40,600 INFO L137 encePairwiseOnDemand]: 182/193 looper letters, 9 selfloop transitions, 0 changer transitions 6/168 dead transitions. [2022-09-20 23:14:40,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 168 transitions, 372 flow [2022-09-20 23:14:40,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-20 23:14:40,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-09-20 23:14:40,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 364 transitions. [2022-09-20 23:14:40,609 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9430051813471503 [2022-09-20 23:14:40,610 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 364 transitions. [2022-09-20 23:14:40,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 364 transitions. [2022-09-20 23:14:40,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:14:40,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 364 transitions. [2022-09-20 23:14:40,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 182.0) internal successors, (364), 2 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:14:40,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 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-09-20 23:14:40,618 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 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-09-20 23:14:40,619 INFO L175 Difference]: Start difference. First operand has 173 places, 179 transitions, 376 flow. Second operand 2 states and 364 transitions. [2022-09-20 23:14:40,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 168 transitions, 372 flow [2022-09-20 23:14:40,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 168 transitions, 360 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-09-20 23:14:40,625 INFO L231 Difference]: Finished difference. Result has 168 places, 162 transitions, 330 flow [2022-09-20 23:14:40,626 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=330, PETRI_PLACES=168, PETRI_TRANSITIONS=162} [2022-09-20 23:14:40,628 INFO L287 CegarLoopForPetriNet]: 173 programPoint places, -5 predicate places. [2022-09-20 23:14:40,628 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 162 transitions, 330 flow [2022-09-20 23:14:40,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 176.0) internal successors, (352), 2 states have internal predecessors, (352), 0 states have call successors, (0), 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-09-20 23:14:40,629 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:14:40,629 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 23:14:40,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-20 23:14:40,629 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:14:40,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:14:40,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1556991879, now seen corresponding path program 1 times [2022-09-20 23:14:40,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:14:40,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211430956] [2022-09-20 23:14:40,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:14:40,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:14:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:14:40,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:14:40,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:14:40,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211430956] [2022-09-20 23:14:40,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211430956] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 23:14:40,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 23:14:40,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 23:14:40,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907969011] [2022-09-20 23:14:40,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 23:14:40,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 23:14:40,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:14:40,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 23:14:40,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 23:14:40,890 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 193 [2022-09-20 23:14:40,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 162 transitions, 330 flow. Second operand has 6 states, 6 states have (on average 145.33333333333334) internal successors, (872), 6 states have internal predecessors, (872), 0 states have call successors, (0), 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-09-20 23:14:40,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:14:40,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 193 [2022-09-20 23:14:40,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:14:41,071 INFO L130 PetriNetUnfolder]: 55/379 cut-off events. [2022-09-20 23:14:41,071 INFO L131 PetriNetUnfolder]: For 21/22 co-relation queries the response was YES. [2022-09-20 23:14:41,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 379 events. 55/379 cut-off events. For 21/22 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1179 event pairs, 6 based on Foata normal form. 2/346 useless extension candidates. Maximal degree in co-relation 502. Up to 52 conditions per place. [2022-09-20 23:14:41,077 INFO L137 encePairwiseOnDemand]: 185/193 looper letters, 47 selfloop transitions, 6 changer transitions 4/184 dead transitions. [2022-09-20 23:14:41,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 184 transitions, 497 flow [2022-09-20 23:14:41,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-09-20 23:14:41,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-09-20 23:14:41,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 898 transitions. [2022-09-20 23:14:41,084 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7754749568221071 [2022-09-20 23:14:41,084 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 898 transitions. [2022-09-20 23:14:41,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 898 transitions. [2022-09-20 23:14:41,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:14:41,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 898 transitions. [2022-09-20 23:14:41,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 149.66666666666666) internal successors, (898), 6 states have internal predecessors, (898), 0 states have call successors, (0), 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-09-20 23:14:41,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 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-09-20 23:14:41,093 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 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-09-20 23:14:41,093 INFO L175 Difference]: Start difference. First operand has 168 places, 162 transitions, 330 flow. Second operand 6 states and 898 transitions. [2022-09-20 23:14:41,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 184 transitions, 497 flow [2022-09-20 23:14:41,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 184 transitions, 497 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-09-20 23:14:41,099 INFO L231 Difference]: Finished difference. Result has 170 places, 166 transitions, 366 flow [2022-09-20 23:14:41,099 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=366, PETRI_PLACES=170, PETRI_TRANSITIONS=166} [2022-09-20 23:14:41,101 INFO L287 CegarLoopForPetriNet]: 173 programPoint places, -3 predicate places. [2022-09-20 23:14:41,102 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 166 transitions, 366 flow [2022-09-20 23:14:41,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 145.33333333333334) internal successors, (872), 6 states have internal predecessors, (872), 0 states have call successors, (0), 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-09-20 23:14:41,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:14:41,103 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 23:14:41,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-20 23:14:41,103 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:14:41,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:14:41,105 INFO L85 PathProgramCache]: Analyzing trace with hash 695018832, now seen corresponding path program 1 times [2022-09-20 23:14:41,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:14:41,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633459975] [2022-09-20 23:14:41,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:14:41,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:14:41,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:14:41,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:14:41,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:14:41,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633459975] [2022-09-20 23:14:41,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633459975] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 23:14:41,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 23:14:41,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 23:14:41,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168707557] [2022-09-20 23:14:41,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 23:14:41,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 23:14:41,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:14:41,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 23:14:41,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-09-20 23:14:41,246 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 193 [2022-09-20 23:14:41,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 166 transitions, 366 flow. Second operand has 7 states, 7 states have (on average 142.57142857142858) internal successors, (998), 7 states have internal predecessors, (998), 0 states have call successors, (0), 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-09-20 23:14:41,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:14:41,248 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 193 [2022-09-20 23:14:41,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:14:41,607 INFO L130 PetriNetUnfolder]: 479/1705 cut-off events. [2022-09-20 23:14:41,607 INFO L131 PetriNetUnfolder]: For 307/349 co-relation queries the response was YES. [2022-09-20 23:14:41,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2920 conditions, 1705 events. 479/1705 cut-off events. For 307/349 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 10970 event pairs, 181 based on Foata normal form. 0/1463 useless extension candidates. Maximal degree in co-relation 2913. Up to 440 conditions per place. [2022-09-20 23:14:41,618 INFO L137 encePairwiseOnDemand]: 179/193 looper letters, 102 selfloop transitions, 18 changer transitions 0/239 dead transitions. [2022-09-20 23:14:41,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 239 transitions, 808 flow [2022-09-20 23:14:41,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-09-20 23:14:41,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-09-20 23:14:41,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1628 transitions. [2022-09-20 23:14:41,621 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7668393782383419 [2022-09-20 23:14:41,621 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1628 transitions. [2022-09-20 23:14:41,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1628 transitions. [2022-09-20 23:14:41,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:14:41,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1628 transitions. [2022-09-20 23:14:41,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 148.0) internal successors, (1628), 11 states have internal predecessors, (1628), 0 states have call successors, (0), 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-09-20 23:14:41,627 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 193.0) internal successors, (2316), 12 states have internal predecessors, (2316), 0 states have call successors, (0), 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-09-20 23:14:41,628 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 193.0) internal successors, (2316), 12 states have internal predecessors, (2316), 0 states have call successors, (0), 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-09-20 23:14:41,628 INFO L175 Difference]: Start difference. First operand has 170 places, 166 transitions, 366 flow. Second operand 11 states and 1628 transitions. [2022-09-20 23:14:41,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 239 transitions, 808 flow [2022-09-20 23:14:41,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 239 transitions, 804 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-09-20 23:14:41,635 INFO L231 Difference]: Finished difference. Result has 180 places, 176 transitions, 448 flow [2022-09-20 23:14:41,635 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=448, PETRI_PLACES=180, PETRI_TRANSITIONS=176} [2022-09-20 23:14:41,637 INFO L287 CegarLoopForPetriNet]: 173 programPoint places, 7 predicate places. [2022-09-20 23:14:41,637 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 176 transitions, 448 flow [2022-09-20 23:14:41,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 142.57142857142858) internal successors, (998), 7 states have internal predecessors, (998), 0 states have call successors, (0), 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-09-20 23:14:41,638 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:14:41,638 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 23:14:41,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-20 23:14:41,638 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:14:41,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:14:41,639 INFO L85 PathProgramCache]: Analyzing trace with hash -404889510, now seen corresponding path program 1 times [2022-09-20 23:14:41,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:14:41,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878355633] [2022-09-20 23:14:41,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:14:41,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:14:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:14:41,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:14:41,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:14:41,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878355633] [2022-09-20 23:14:41,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878355633] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 23:14:41,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 23:14:41,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-09-20 23:14:41,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197450058] [2022-09-20 23:14:41,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 23:14:41,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-09-20 23:14:41,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:14:41,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-09-20 23:14:41,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-09-20 23:14:41,921 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 193 [2022-09-20 23:14:41,922 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 176 transitions, 448 flow. Second operand has 10 states, 10 states have (on average 113.5) internal successors, (1135), 10 states have internal predecessors, (1135), 0 states have call successors, (0), 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-09-20 23:14:41,922 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:14:41,922 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 193 [2022-09-20 23:14:41,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:14:42,212 INFO L130 PetriNetUnfolder]: 773/1731 cut-off events. [2022-09-20 23:14:42,213 INFO L131 PetriNetUnfolder]: For 543/543 co-relation queries the response was YES. [2022-09-20 23:14:42,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3531 conditions, 1731 events. 773/1731 cut-off events. For 543/543 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 10604 event pairs, 569 based on Foata normal form. 2/1531 useless extension candidates. Maximal degree in co-relation 3521. Up to 1156 conditions per place. [2022-09-20 23:14:42,222 INFO L137 encePairwiseOnDemand]: 178/193 looper letters, 69 selfloop transitions, 10 changer transitions 24/198 dead transitions. [2022-09-20 23:14:42,222 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 198 transitions, 697 flow [2022-09-20 23:14:42,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-09-20 23:14:42,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-09-20 23:14:42,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 963 transitions. [2022-09-20 23:14:42,225 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6237046632124352 [2022-09-20 23:14:42,225 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 963 transitions. [2022-09-20 23:14:42,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 963 transitions. [2022-09-20 23:14:42,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:14:42,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 963 transitions. [2022-09-20 23:14:42,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 120.375) internal successors, (963), 8 states have internal predecessors, (963), 0 states have call successors, (0), 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-09-20 23:14:42,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 193.0) internal successors, (1737), 9 states have internal predecessors, (1737), 0 states have call successors, (0), 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-09-20 23:14:42,230 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 193.0) internal successors, (1737), 9 states have internal predecessors, (1737), 0 states have call successors, (0), 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-09-20 23:14:42,230 INFO L175 Difference]: Start difference. First operand has 180 places, 176 transitions, 448 flow. Second operand 8 states and 963 transitions. [2022-09-20 23:14:42,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 198 transitions, 697 flow [2022-09-20 23:14:42,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 198 transitions, 686 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-09-20 23:14:42,234 INFO L231 Difference]: Finished difference. Result has 184 places, 168 transitions, 423 flow [2022-09-20 23:14:42,235 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=423, PETRI_PLACES=184, PETRI_TRANSITIONS=168} [2022-09-20 23:14:42,236 INFO L287 CegarLoopForPetriNet]: 173 programPoint places, 11 predicate places. [2022-09-20 23:14:42,236 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 168 transitions, 423 flow [2022-09-20 23:14:42,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 113.5) internal successors, (1135), 10 states have internal predecessors, (1135), 0 states have call successors, (0), 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-09-20 23:14:42,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:14:42,237 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 23:14:42,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-09-20 23:14:42,237 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:14:42,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:14:42,238 INFO L85 PathProgramCache]: Analyzing trace with hash 115459160, now seen corresponding path program 1 times [2022-09-20 23:14:42,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:14:42,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242048293] [2022-09-20 23:14:42,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:14:42,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:14:42,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:14:42,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-20 23:14:42,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:14:42,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242048293] [2022-09-20 23:14:42,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242048293] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 23:14:42,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844204042] [2022-09-20 23:14:42,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:14:42,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:14:42,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 23:14:42,363 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-09-20 23:14:42,366 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-09-20 23:14:42,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:14:42,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 8 conjunts are in the unsatisfiable core [2022-09-20 23:14:42,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 23:14:42,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-20 23:14:42,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 23:14:42,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-20 23:14:42,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844204042] provided 1 perfect and 1 imperfect interpolant sequences [2022-09-20 23:14:42,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-09-20 23:14:42,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-09-20 23:14:42,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662177034] [2022-09-20 23:14:42,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 23:14:42,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-09-20 23:14:42,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:14:42,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-09-20 23:14:42,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-09-20 23:14:42,887 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 193 [2022-09-20 23:14:42,888 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 168 transitions, 423 flow. Second operand has 9 states, 9 states have (on average 135.66666666666666) internal successors, (1221), 9 states have internal predecessors, (1221), 0 states have call successors, (0), 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-09-20 23:14:42,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:14:42,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 193 [2022-09-20 23:14:42,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:14:43,332 INFO L130 PetriNetUnfolder]: 1464/2849 cut-off events. [2022-09-20 23:14:43,333 INFO L131 PetriNetUnfolder]: For 504/504 co-relation queries the response was YES. [2022-09-20 23:14:43,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5657 conditions, 2849 events. 1464/2849 cut-off events. For 504/504 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 19239 event pairs, 409 based on Foata normal form. 0/2365 useless extension candidates. Maximal degree in co-relation 5646. Up to 699 conditions per place. [2022-09-20 23:14:43,345 INFO L137 encePairwiseOnDemand]: 182/193 looper letters, 108 selfloop transitions, 17 changer transitions 0/237 dead transitions. [2022-09-20 23:14:43,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 237 transitions, 876 flow [2022-09-20 23:14:43,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-09-20 23:14:43,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-09-20 23:14:43,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1548 transitions. [2022-09-20 23:14:43,349 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7291568535091851 [2022-09-20 23:14:43,349 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1548 transitions. [2022-09-20 23:14:43,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1548 transitions. [2022-09-20 23:14:43,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:14:43,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1548 transitions. [2022-09-20 23:14:43,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 140.72727272727272) internal successors, (1548), 11 states have internal predecessors, (1548), 0 states have call successors, (0), 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-09-20 23:14:43,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 193.0) internal successors, (2316), 12 states have internal predecessors, (2316), 0 states have call successors, (0), 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-09-20 23:14:43,355 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 193.0) internal successors, (2316), 12 states have internal predecessors, (2316), 0 states have call successors, (0), 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-09-20 23:14:43,355 INFO L175 Difference]: Start difference. First operand has 184 places, 168 transitions, 423 flow. Second operand 11 states and 1548 transitions. [2022-09-20 23:14:43,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 237 transitions, 876 flow [2022-09-20 23:14:43,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 237 transitions, 835 flow, removed 4 selfloop flow, removed 11 redundant places. [2022-09-20 23:14:43,361 INFO L231 Difference]: Finished difference. Result has 183 places, 180 transitions, 476 flow [2022-09-20 23:14:43,362 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=476, PETRI_PLACES=183, PETRI_TRANSITIONS=180} [2022-09-20 23:14:43,363 INFO L287 CegarLoopForPetriNet]: 173 programPoint places, 10 predicate places. [2022-09-20 23:14:43,363 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 180 transitions, 476 flow [2022-09-20 23:14:43,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 135.66666666666666) internal successors, (1221), 9 states have internal predecessors, (1221), 0 states have call successors, (0), 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-09-20 23:14:43,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:14:43,364 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 23:14:43,398 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-09-20 23:14:43,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:14:43,576 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:14:43,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:14:43,576 INFO L85 PathProgramCache]: Analyzing trace with hash 3699528, now seen corresponding path program 2 times [2022-09-20 23:14:43,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:14:43,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472595326] [2022-09-20 23:14:43,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:14:43,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:14:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:14:43,674 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-20 23:14:43,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:14:43,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472595326] [2022-09-20 23:14:43,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472595326] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 23:14:43,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205736891] [2022-09-20 23:14:43,675 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-20 23:14:43,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:14:43,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 23:14:43,676 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-09-20 23:14:43,677 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-09-20 23:14:43,767 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-09-20 23:14:43,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-20 23:14:43,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 7 conjunts are in the unsatisfiable core [2022-09-20 23:14:43,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 23:14:43,960 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-09-20 23:14:43,960 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-20 23:14:43,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205736891] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 23:14:43,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-20 23:14:43,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2022-09-20 23:14:43,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676256513] [2022-09-20 23:14:43,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 23:14:43,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 23:14:43,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:14:43,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 23:14:43,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-09-20 23:14:43,966 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 193 [2022-09-20 23:14:43,966 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 180 transitions, 476 flow. Second operand has 6 states, 6 states have (on average 134.0) internal successors, (804), 6 states have internal predecessors, (804), 0 states have call successors, (0), 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-09-20 23:14:43,966 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:14:43,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 193 [2022-09-20 23:14:43,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:14:44,355 INFO L130 PetriNetUnfolder]: 1020/2145 cut-off events. [2022-09-20 23:14:44,355 INFO L131 PetriNetUnfolder]: For 1134/1179 co-relation queries the response was YES. [2022-09-20 23:14:44,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5062 conditions, 2145 events. 1020/2145 cut-off events. For 1134/1179 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 14052 event pairs, 266 based on Foata normal form. 89/2053 useless extension candidates. Maximal degree in co-relation 5050. Up to 910 conditions per place. [2022-09-20 23:14:44,366 INFO L137 encePairwiseOnDemand]: 184/193 looper letters, 62 selfloop transitions, 13 changer transitions 0/195 dead transitions. [2022-09-20 23:14:44,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 195 transitions, 688 flow [2022-09-20 23:14:44,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-09-20 23:14:44,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-09-20 23:14:44,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1074 transitions. [2022-09-20 23:14:44,369 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6955958549222798 [2022-09-20 23:14:44,369 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1074 transitions. [2022-09-20 23:14:44,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1074 transitions. [2022-09-20 23:14:44,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:14:44,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1074 transitions. [2022-09-20 23:14:44,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 134.25) internal successors, (1074), 8 states have internal predecessors, (1074), 0 states have call successors, (0), 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-09-20 23:14:44,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 193.0) internal successors, (1737), 9 states have internal predecessors, (1737), 0 states have call successors, (0), 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-09-20 23:14:44,373 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 193.0) internal successors, (1737), 9 states have internal predecessors, (1737), 0 states have call successors, (0), 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-09-20 23:14:44,373 INFO L175 Difference]: Start difference. First operand has 183 places, 180 transitions, 476 flow. Second operand 8 states and 1074 transitions. [2022-09-20 23:14:44,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 195 transitions, 688 flow [2022-09-20 23:14:44,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 195 transitions, 681 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-09-20 23:14:44,378 INFO L231 Difference]: Finished difference. Result has 189 places, 183 transitions, 537 flow [2022-09-20 23:14:44,378 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=537, PETRI_PLACES=189, PETRI_TRANSITIONS=183} [2022-09-20 23:14:44,379 INFO L287 CegarLoopForPetriNet]: 173 programPoint places, 16 predicate places. [2022-09-20 23:14:44,379 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 183 transitions, 537 flow [2022-09-20 23:14:44,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 134.0) internal successors, (804), 6 states have internal predecessors, (804), 0 states have call successors, (0), 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-09-20 23:14:44,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:14:44,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 23:14:44,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-09-20 23:14:44,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-09-20 23:14:44,596 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:14:44,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:14:44,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1723983168, now seen corresponding path program 1 times [2022-09-20 23:14:44,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:14:44,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188825896] [2022-09-20 23:14:44,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:14:44,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:14:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:14:44,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-20 23:14:44,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:14:44,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188825896] [2022-09-20 23:14:44,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188825896] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 23:14:44,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640784878] [2022-09-20 23:14:44,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:14:44,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:14:44,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 23:14:44,653 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-09-20 23:14:44,654 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-09-20 23:14:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:14:44,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 6 conjunts are in the unsatisfiable core [2022-09-20 23:14:44,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 23:14:44,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-20 23:14:44,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 23:14:44,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-20 23:14:44,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640784878] provided 1 perfect and 1 imperfect interpolant sequences [2022-09-20 23:14:44,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-09-20 23:14:44,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-09-20 23:14:44,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307453438] [2022-09-20 23:14:44,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 23:14:44,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 23:14:44,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:14:44,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 23:14:44,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-09-20 23:14:44,966 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 193 [2022-09-20 23:14:44,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 183 transitions, 537 flow. Second operand has 7 states, 7 states have (on average 143.42857142857142) internal successors, (1004), 7 states have internal predecessors, (1004), 0 states have call successors, (0), 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-09-20 23:14:44,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:14:44,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 193 [2022-09-20 23:14:44,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:14:45,184 INFO L130 PetriNetUnfolder]: 434/1202 cut-off events. [2022-09-20 23:14:45,184 INFO L131 PetriNetUnfolder]: For 1572/1724 co-relation queries the response was YES. [2022-09-20 23:14:45,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2906 conditions, 1202 events. 434/1202 cut-off events. For 1572/1724 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6965 event pairs, 108 based on Foata normal form. 87/1218 useless extension candidates. Maximal degree in co-relation 2892. Up to 372 conditions per place. [2022-09-20 23:14:45,192 INFO L137 encePairwiseOnDemand]: 185/193 looper letters, 64 selfloop transitions, 7 changer transitions 0/198 dead transitions. [2022-09-20 23:14:45,192 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 198 transitions, 765 flow [2022-09-20 23:14:45,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-20 23:14:45,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-09-20 23:14:45,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1018 transitions. [2022-09-20 23:14:45,194 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7535159141376758 [2022-09-20 23:14:45,194 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1018 transitions. [2022-09-20 23:14:45,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1018 transitions. [2022-09-20 23:14:45,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:14:45,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1018 transitions. [2022-09-20 23:14:45,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 145.42857142857142) internal successors, (1018), 7 states have internal predecessors, (1018), 0 states have call successors, (0), 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-09-20 23:14:45,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 0 states have call successors, (0), 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-09-20 23:14:45,198 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 0 states have call successors, (0), 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-09-20 23:14:45,198 INFO L175 Difference]: Start difference. First operand has 189 places, 183 transitions, 537 flow. Second operand 7 states and 1018 transitions. [2022-09-20 23:14:45,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 198 transitions, 765 flow [2022-09-20 23:14:45,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 198 transitions, 743 flow, removed 2 selfloop flow, removed 5 redundant places. [2022-09-20 23:14:45,203 INFO L231 Difference]: Finished difference. Result has 192 places, 184 transitions, 547 flow [2022-09-20 23:14:45,203 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=547, PETRI_PLACES=192, PETRI_TRANSITIONS=184} [2022-09-20 23:14:45,204 INFO L287 CegarLoopForPetriNet]: 173 programPoint places, 19 predicate places. [2022-09-20 23:14:45,204 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 184 transitions, 547 flow [2022-09-20 23:14:45,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 143.42857142857142) internal successors, (1004), 7 states have internal predecessors, (1004), 0 states have call successors, (0), 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-09-20 23:14:45,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:14:45,204 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 23:14:45,224 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-09-20 23:14:45,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:14:45,420 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:14:45,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:14:45,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1215161709, now seen corresponding path program 1 times [2022-09-20 23:14:45,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:14:45,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119002447] [2022-09-20 23:14:45,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:14:45,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:14:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:14:46,920 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:14:46,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:14:46,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119002447] [2022-09-20 23:14:46,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119002447] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 23:14:46,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840176643] [2022-09-20 23:14:46,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:14:46,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:14:46,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 23:14:46,922 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-09-20 23:14:46,923 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-09-20 23:14:47,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:14:47,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 104 conjunts are in the unsatisfiable core [2022-09-20 23:14:47,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 23:14:47,084 INFO L390 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-09-20 23:14:47,148 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-20 23:14:47,148 INFO L390 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-09-20 23:14:47,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-20 23:14:47,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-09-20 23:14:47,968 INFO L390 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 15 treesize of output 11 [2022-09-20 23:14:48,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-20 23:14:48,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-20 23:14:48,930 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-20 23:14:48,930 INFO L390 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 20 treesize of output 18 [2022-09-20 23:14:49,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-09-20 23:14:49,800 INFO L390 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-09-20 23:14:49,947 INFO L390 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-09-20 23:14:50,090 INFO L390 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-09-20 23:14:50,363 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:14:50,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 40 [2022-09-20 23:14:50,605 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:14:50,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 23:14:50,962 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_234 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_234))) (let ((.cse0 (select .cse3 c_~A~0.base)) (.cse2 (select .cse3 c_~B~0.base))) (= (let ((.cse1 (* ~M~0 4))) (+ (select .cse0 (+ c_~A~0.offset .cse1)) c_~res2~0 (select .cse2 (+ .cse1 c_~B~0.offset)))) (+ c_~res1~0 (select .cse0 c_~A~0.offset) (select .cse2 c_~B~0.offset))))) (not (< ~M~0 c_~N~0)))) is different from false [2022-09-20 23:14:51,083 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_234 (Array Int Int)) (v_ArrVal_233 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_233) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_234))) (let ((.cse2 (select .cse3 c_~B~0.base)) (.cse0 (select .cse3 c_~A~0.base))) (= (let ((.cse1 (* ~M~0 4))) (+ (select .cse0 (+ c_~A~0.offset .cse1)) c_~res2~0 (select .cse2 (+ .cse1 c_~B~0.offset)))) (+ c_~res1~0 (select .cse2 c_~B~0.offset) (select .cse0 c_~A~0.offset))))) (not (< ~M~0 c_~N~0)))) is different from false [2022-09-20 23:14:51,133 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_232 (Array Int Int)) (v_ArrVal_234 (Array Int Int)) (v_ArrVal_233 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_232) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_233) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_234))) (let ((.cse1 (select .cse3 c_~A~0.base)) (.cse0 (select .cse3 c_~B~0.base))) (= (+ c_~res1~0 (select .cse0 c_~B~0.offset) (select .cse1 c_~A~0.offset)) (let ((.cse2 (* ~M~0 4))) (+ (select .cse1 (+ c_~A~0.offset .cse2)) c_~res2~0 (select .cse0 (+ .cse2 c_~B~0.offset))))))))) is different from false [2022-09-20 23:14:51,229 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_232 (Array Int Int)) (v_ArrVal_234 (Array Int Int)) (v_ArrVal_233 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_232) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_233) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_234))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_#t~ret19#1.base|)) (.cse0 (select .cse3 c_~A~0.base))) (= (let ((.cse1 (* ~M~0 4))) (+ (select .cse0 (+ c_~A~0.offset .cse1)) c_~res2~0 (select .cse2 (+ .cse1 |c_ULTIMATE.start_main_#t~ret19#1.offset|)))) (+ c_~res1~0 (select .cse2 |c_ULTIMATE.start_main_#t~ret19#1.offset|) (select .cse0 c_~A~0.offset))))))) is different from false [2022-09-20 23:14:51,249 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_232 (Array Int Int)) (v_ArrVal_234 (Array Int Int)) (v_ArrVal_233 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_232) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_233) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_234))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse0 (select .cse3 c_~A~0.base))) (= (let ((.cse1 (* ~M~0 4))) (+ (select .cse0 (+ c_~A~0.offset .cse1)) c_~res2~0 (select .cse2 (+ .cse1 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (+ (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~res1~0 (select .cse0 c_~A~0.offset))))))) is different from false [2022-09-20 23:14:51,265 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_232 (Array Int Int)) (v_ArrVal_234 (Array Int Int)) (v_ArrVal_233 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_232) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_233) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_234))) (let ((.cse0 (select .cse3 c_~A~0.base)) (.cse1 (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (= (+ c_~res1~0 (select .cse0 c_~A~0.offset) (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (let ((.cse2 (* ~M~0 4))) (+ (select .cse0 (+ c_~A~0.offset .cse2)) c_~res2~0 (select .cse1 (+ .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))))) is different from false [2022-09-20 23:14:51,322 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_231 Int) (~M~0 Int) (v_ArrVal_232 (Array Int Int)) (v_ArrVal_234 (Array Int Int)) (v_ArrVal_233 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse3 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_231)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_232) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_233) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_234))) (let ((.cse0 (select .cse3 c_~A~0.base)) (.cse2 (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (= (let ((.cse1 (* ~M~0 4))) (+ (select .cse0 (+ c_~A~0.offset .cse1)) (select .cse2 (+ .cse1 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~res2~0)) (+ (select .cse0 c_~A~0.offset) c_~res1~0 (select .cse2 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) is different from false [2022-09-20 23:14:51,354 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_231 Int) (~M~0 Int) (v_ArrVal_232 (Array Int Int)) (v_ArrVal_234 (Array Int Int)) (v_ArrVal_233 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (let ((.cse3 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| v_ArrVal_231)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_232) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_233) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_234))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse0 (select .cse3 c_~A~0.base))) (= (+ (select .cse0 c_~A~0.offset) c_~res1~0 (select .cse1 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (let ((.cse2 (* ~M~0 4))) (+ (select .cse1 (+ .cse2 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~res2~0 (select .cse0 (+ c_~A~0.offset .cse2))))))) (not (< ~M~0 c_~N~0)))) is different from false [2022-09-20 23:14:51,376 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_231 Int) (~M~0 Int) (v_ArrVal_232 (Array Int Int)) (v_ArrVal_234 (Array Int Int)) (v_ArrVal_233 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse3 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| v_ArrVal_231)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_232) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_233) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_234))) (let ((.cse1 (select .cse3 c_~A~0.base)) (.cse0 (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base|))) (= (+ (select .cse0 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select .cse1 c_~A~0.offset) c_~res1~0) (let ((.cse2 (* ~M~0 4))) (+ c_~res2~0 (select .cse1 (+ c_~A~0.offset .cse2)) (select .cse0 (+ .cse2 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))))) is different from false [2022-09-20 23:14:52,575 INFO L356 Elim1Store]: treesize reduction 23, result has 60.3 percent of original size [2022-09-20 23:14:52,576 INFO L390 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 2 case distinctions, treesize of input 197 treesize of output 104 [2022-09-20 23:14:52,636 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:14:52,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 4624 treesize of output 4378 [2022-09-20 23:14:52,694 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:14:52,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4214 treesize of output 3774 [2022-09-20 23:14:52,778 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:14:52,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3702 treesize of output 2750 [2022-09-20 23:14:52,847 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:14:52,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2678 treesize of output 2494 Received shutdown request... [2022-09-20 23:28:28,548 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-09-20 23:28:28,550 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-09-20 23:28:28,556 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-20 23:28:28,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-09-20 23:28:28,575 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-20 23:28:28,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:28:28,757 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 158 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 9 for 7ms.. [2022-09-20 23:28:28,758 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-09-20 23:28:28,758 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-09-20 23:28:28,759 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-09-20 23:28:28,759 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2022-09-20 23:28:28,761 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-09-20 23:28:28,761 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-09-20 23:28:28,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 11:28:28 BasicIcfg [2022-09-20 23:28:28,764 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-09-20 23:28:28,764 INFO L158 Benchmark]: Toolchain (without parser) took 829829.31ms. Allocated memory was 196.1MB in the beginning and 683.7MB in the end (delta: 487.6MB). Free memory was 163.5MB in the beginning and 401.1MB in the end (delta: -237.6MB). Peak memory consumption was 448.3MB. Max. memory is 8.0GB. [2022-09-20 23:28:28,764 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 196.1MB. Free memory is still 149.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-09-20 23:28:28,765 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.81ms. Allocated memory was 196.1MB in the beginning and 277.9MB in the end (delta: 81.8MB). Free memory was 163.5MB in the beginning and 244.9MB in the end (delta: -81.3MB). Peak memory consumption was 10.0MB. Max. memory is 8.0GB. [2022-09-20 23:28:28,765 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.61ms. Allocated memory is still 277.9MB. Free memory was 244.9MB in the beginning and 242.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-09-20 23:28:28,765 INFO L158 Benchmark]: Boogie Preprocessor took 30.98ms. Allocated memory is still 277.9MB. Free memory was 242.4MB in the beginning and 240.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-09-20 23:28:28,765 INFO L158 Benchmark]: RCFGBuilder took 793.11ms. Allocated memory is still 277.9MB. Free memory was 240.3MB in the beginning and 192.1MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 8.0GB. [2022-09-20 23:28:28,765 INFO L158 Benchmark]: TraceAbstraction took 828680.83ms. Allocated memory was 277.9MB in the beginning and 683.7MB in the end (delta: 405.8MB). Free memory was 191.5MB in the beginning and 401.1MB in the end (delta: -209.7MB). Peak memory consumption was 395.3MB. Max. memory is 8.0GB. [2022-09-20 23:28:28,766 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 196.1MB. Free memory is still 149.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 260.81ms. Allocated memory was 196.1MB in the beginning and 277.9MB in the end (delta: 81.8MB). Free memory was 163.5MB in the beginning and 244.9MB in the end (delta: -81.3MB). Peak memory consumption was 10.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.61ms. Allocated memory is still 277.9MB. Free memory was 244.9MB in the beginning and 242.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.98ms. Allocated memory is still 277.9MB. Free memory was 242.4MB in the beginning and 240.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 793.11ms. Allocated memory is still 277.9MB. Free memory was 240.3MB in the beginning and 192.1MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 8.0GB. * TraceAbstraction took 828680.83ms. Allocated memory was 277.9MB in the beginning and 683.7MB in the end (delta: 405.8MB). Free memory was 191.5MB in the beginning and 401.1MB in the end (delta: -209.7MB). Peak memory consumption was 395.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 158 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 9 for 7ms.. - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 158 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 9 for 7ms.. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 158 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 9 for 7ms.. - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 158 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 9 for 7ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 208 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 828.6s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 830 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 830 mSDsluCounter, 450 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 404 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 726 IncrementalHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 161 mSDtfsCounter, 726 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 838 GetRequests, 750 SyntacticMatches, 4 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=547occurred in iteration=7, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1454 NumberOfCodeBlocks, 1435 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1746 ConstructedInterpolants, 0 QuantifiedInterpolants, 4671 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1066 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 12 InterpolantComputations, 7 PerfectInterpolantSequences, 21/26 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown