/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_75-tricky_address2_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 07:59:37,281 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 07:59:37,283 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 07:59:37,307 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 07:59:37,307 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 07:59:37,308 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 07:59:37,312 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 07:59:37,315 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 07:59:37,316 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 07:59:37,319 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 07:59:37,320 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 07:59:37,321 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 07:59:37,322 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 07:59:37,325 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 07:59:37,325 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 07:59:37,327 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 07:59:37,327 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 07:59:37,328 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 07:59:37,329 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 07:59:37,333 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 07:59:37,333 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 07:59:37,334 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 07:59:37,335 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 07:59:37,336 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 07:59:37,341 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 07:59:37,342 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 07:59:37,342 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 07:59:37,343 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 07:59:37,343 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 07:59:37,343 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 07:59:37,343 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 07:59:37,344 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 07:59:37,345 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 07:59:37,345 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 07:59:37,346 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 07:59:37,346 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 07:59:37,346 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 07:59:37,346 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 07:59:37,346 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 07:59:37,347 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 07:59:37,347 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 07:59:37,348 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-VariableLbe.epf [2023-01-28 07:59:37,368 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 07:59:37,368 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 07:59:37,369 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 07:59:37,369 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 07:59:37,369 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 07:59:37,369 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 07:59:37,370 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 07:59:37,370 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 07:59:37,370 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 07:59:37,370 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 07:59:37,370 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 07:59:37,370 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 07:59:37,371 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 07:59:37,371 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 07:59:37,371 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 07:59:37,371 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 07:59:37,371 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 07:59:37,371 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 07:59:37,371 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 07:59:37,371 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 07:59:37,371 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 07:59:37,371 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 07:59:37,371 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 07:59:37,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 07:59:37,372 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 07:59:37,372 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 07:59:37,372 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 07:59:37,372 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 07:59:37,372 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 07:59:37,372 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 07:59:37,372 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 07:59:37,372 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-01-28 07:59:37,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 07:59:37,525 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 07:59:37,526 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 07:59:37,527 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 07:59:37,527 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 07:59:37,528 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_75-tricky_address2_racefree.i [2023-01-28 07:59:38,503 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 07:59:38,698 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 07:59:38,698 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_75-tricky_address2_racefree.i [2023-01-28 07:59:38,709 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/338f0375e/43eb0bb58cf14bceb4f8a909dff01508/FLAGf2ea1ec26 [2023-01-28 07:59:38,717 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/338f0375e/43eb0bb58cf14bceb4f8a909dff01508 [2023-01-28 07:59:38,719 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 07:59:38,720 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 07:59:38,721 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 07:59:38,721 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 07:59:38,722 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 07:59:38,723 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 07:59:38" (1/1) ... [2023-01-28 07:59:38,723 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@154e64bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:59:38, skipping insertion in model container [2023-01-28 07:59:38,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 07:59:38" (1/1) ... [2023-01-28 07:59:38,728 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 07:59:38,757 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 07:59:39,061 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_75-tricky_address2_racefree.i[41323,41336] [2023-01-28 07:59:39,078 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 07:59:39,088 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 07:59:39,110 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_75-tricky_address2_racefree.i[41323,41336] [2023-01-28 07:59:39,117 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 07:59:39,191 INFO L208 MainTranslator]: Completed translation [2023-01-28 07:59:39,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:59:39 WrapperNode [2023-01-28 07:59:39,191 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 07:59:39,192 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 07:59:39,192 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 07:59:39,192 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 07:59:39,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:59:39" (1/1) ... [2023-01-28 07:59:39,207 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:59:39" (1/1) ... [2023-01-28 07:59:39,237 INFO L138 Inliner]: procedures = 270, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 190 [2023-01-28 07:59:39,237 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 07:59:39,238 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 07:59:39,238 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 07:59:39,238 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 07:59:39,245 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:59:39" (1/1) ... [2023-01-28 07:59:39,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:59:39" (1/1) ... [2023-01-28 07:59:39,247 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:59:39" (1/1) ... [2023-01-28 07:59:39,247 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:59:39" (1/1) ... [2023-01-28 07:59:39,252 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:59:39" (1/1) ... [2023-01-28 07:59:39,255 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:59:39" (1/1) ... [2023-01-28 07:59:39,256 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:59:39" (1/1) ... [2023-01-28 07:59:39,257 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:59:39" (1/1) ... [2023-01-28 07:59:39,259 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 07:59:39,260 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 07:59:39,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 07:59:39,260 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 07:59:39,263 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:59:39" (1/1) ... [2023-01-28 07:59:39,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 07:59:39,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:59:39,297 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) [2023-01-28 07:59:39,301 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 [2023-01-28 07:59:39,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 07:59:39,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 07:59:39,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-28 07:59:39,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 07:59:39,324 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-01-28 07:59:39,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 07:59:39,324 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-01-28 07:59:39,324 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-01-28 07:59:39,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 07:59:39,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 07:59:39,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 07:59:39,325 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 07:59:39,423 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 07:59:39,425 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 07:59:39,698 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 07:59:39,707 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 07:59:39,707 INFO L302 CfgBuilder]: Removed 23 assume(true) statements. [2023-01-28 07:59:39,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 07:59:39 BoogieIcfgContainer [2023-01-28 07:59:39,709 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 07:59:39,716 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 07:59:39,716 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 07:59:39,719 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 07:59:39,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 07:59:38" (1/3) ... [2023-01-28 07:59:39,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21cd78e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 07:59:39, skipping insertion in model container [2023-01-28 07:59:39,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:59:39" (2/3) ... [2023-01-28 07:59:39,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21cd78e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 07:59:39, skipping insertion in model container [2023-01-28 07:59:39,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 07:59:39" (3/3) ... [2023-01-28 07:59:39,721 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_75-tricky_address2_racefree.i [2023-01-28 07:59:39,732 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 07:59:39,733 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 07:59:39,733 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 07:59:39,805 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-01-28 07:59:39,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 190 transitions, 388 flow [2023-01-28 07:59:39,879 INFO L130 PetriNetUnfolder]: 45/260 cut-off events. [2023-01-28 07:59:39,879 INFO L131 PetriNetUnfolder]: For 1/2 co-relation queries the response was YES. [2023-01-28 07:59:39,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 260 events. 45/260 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 817 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 143. Up to 8 conditions per place. [2023-01-28 07:59:39,884 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 190 transitions, 388 flow [2023-01-28 07:59:39,888 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 185 transitions, 375 flow [2023-01-28 07:59:39,890 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 07:59:39,897 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 185 transitions, 375 flow [2023-01-28 07:59:39,898 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 185 transitions, 375 flow [2023-01-28 07:59:39,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 185 transitions, 375 flow [2023-01-28 07:59:39,956 INFO L130 PetriNetUnfolder]: 44/255 cut-off events. [2023-01-28 07:59:39,956 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:59:39,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 255 events. 44/255 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 776 event pairs, 0 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 143. Up to 8 conditions per place. [2023-01-28 07:59:39,963 INFO L119 LiptonReduction]: Number of co-enabled transitions 10336 [2023-01-28 07:59:41,924 INFO L134 LiptonReduction]: Checked pairs total: 15158 [2023-01-28 07:59:41,924 INFO L136 LiptonReduction]: Total number of compositions: 151 [2023-01-28 07:59:41,934 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 07:59:41,938 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;@78496575, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 07:59:41,938 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-01-28 07:59:41,942 INFO L130 PetriNetUnfolder]: 5/27 cut-off events. [2023-01-28 07:59:41,942 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:59:41,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:59:41,943 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-01-28 07:59:41,943 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 07:59:41,946 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:59:41,946 INFO L85 PathProgramCache]: Analyzing trace with hash 826457834, now seen corresponding path program 1 times [2023-01-28 07:59:41,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:59:41,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891856562] [2023-01-28 07:59:41,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:41,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:59:42,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:42,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:59:42,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:59:42,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891856562] [2023-01-28 07:59:42,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891856562] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:59:42,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:59:42,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 07:59:42,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717109750] [2023-01-28 07:59:42,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:59:42,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 07:59:42,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:59:42,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 07:59:42,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 07:59:42,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 341 [2023-01-28 07:59:42,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 65 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 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) [2023-01-28 07:59:42,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:59:42,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 341 [2023-01-28 07:59:42,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:59:42,301 INFO L130 PetriNetUnfolder]: 301/651 cut-off events. [2023-01-28 07:59:42,301 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:59:42,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1245 conditions, 651 events. 301/651 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3189 event pairs, 266 based on Foata normal form. 107/643 useless extension candidates. Maximal degree in co-relation 1189. Up to 588 conditions per place. [2023-01-28 07:59:42,307 INFO L137 encePairwiseOnDemand]: 318/341 looper letters, 36 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2023-01-28 07:59:42,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 173 flow [2023-01-28 07:59:42,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 07:59:42,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 07:59:42,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 515 transitions. [2023-01-28 07:59:42,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5034213098729228 [2023-01-28 07:59:42,323 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 515 transitions. [2023-01-28 07:59:42,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 515 transitions. [2023-01-28 07:59:42,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:59:42,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 515 transitions. [2023-01-28 07:59:42,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 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) [2023-01-28 07:59:42,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 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) [2023-01-28 07:59:42,336 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 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) [2023-01-28 07:59:42,337 INFO L175 Difference]: Start difference. First operand has 45 places, 65 transitions, 135 flow. Second operand 3 states and 515 transitions. [2023-01-28 07:59:42,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 173 flow [2023-01-28 07:59:42,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 46 transitions, 173 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 07:59:42,341 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 107 flow [2023-01-28 07:59:42,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=48, PETRI_TRANSITIONS=46} [2023-01-28 07:59:42,345 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2023-01-28 07:59:42,345 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 46 transitions, 107 flow [2023-01-28 07:59:42,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 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) [2023-01-28 07:59:42,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:59:42,346 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:59:42,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 07:59:42,346 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 07:59:42,348 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:59:42,348 INFO L85 PathProgramCache]: Analyzing trace with hash -669135341, now seen corresponding path program 1 times [2023-01-28 07:59:42,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:59:42,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650437039] [2023-01-28 07:59:42,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:42,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:59:42,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:42,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:59:42,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:59:42,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650437039] [2023-01-28 07:59:42,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650437039] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 07:59:42,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771267355] [2023-01-28 07:59:42,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:42,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:59:42,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:59:42,439 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) [2023-01-28 07:59:42,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-01-28 07:59:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:42,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjunts are in the unsatisfiable core [2023-01-28 07:59:42,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 07:59:42,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 07:59:42,531 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 07:59:42,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771267355] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:59:42,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 07:59:42,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-01-28 07:59:42,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980799739] [2023-01-28 07:59:42,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:59:42,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 07:59:42,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:59:42,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 07:59:42,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 07:59:42,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 341 [2023-01-28 07:59:42,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 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) [2023-01-28 07:59:42,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:59:42,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 341 [2023-01-28 07:59:42,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:59:42,615 INFO L130 PetriNetUnfolder]: 283/635 cut-off events. [2023-01-28 07:59:42,615 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:59:42,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1233 conditions, 635 events. 283/635 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3546 event pairs, 0 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 1221. Up to 555 conditions per place. [2023-01-28 07:59:42,618 INFO L137 encePairwiseOnDemand]: 338/341 looper letters, 51 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-01-28 07:59:42,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 61 transitions, 243 flow [2023-01-28 07:59:42,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 07:59:42,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 07:59:42,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions. [2023-01-28 07:59:42,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4975562072336266 [2023-01-28 07:59:42,620 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 509 transitions. [2023-01-28 07:59:42,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 509 transitions. [2023-01-28 07:59:42,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:59:42,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 509 transitions. [2023-01-28 07:59:42,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 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) [2023-01-28 07:59:42,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 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) [2023-01-28 07:59:42,624 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 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) [2023-01-28 07:59:42,624 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 107 flow. Second operand 3 states and 509 transitions. [2023-01-28 07:59:42,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 61 transitions, 243 flow [2023-01-28 07:59:42,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 239 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-28 07:59:42,626 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 111 flow [2023-01-28 07:59:42,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2023-01-28 07:59:42,627 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 5 predicate places. [2023-01-28 07:59:42,627 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 111 flow [2023-01-28 07:59:42,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 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) [2023-01-28 07:59:42,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:59:42,627 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:59:42,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-01-28 07:59:42,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:59:42,844 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 07:59:42,845 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:59:42,845 INFO L85 PathProgramCache]: Analyzing trace with hash 735439460, now seen corresponding path program 1 times [2023-01-28 07:59:42,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:59:42,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623870328] [2023-01-28 07:59:42,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:42,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:59:42,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:42,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:59:42,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:59:42,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623870328] [2023-01-28 07:59:42,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623870328] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 07:59:42,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016486924] [2023-01-28 07:59:42,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:42,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:59:42,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:59:42,911 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) [2023-01-28 07:59:42,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-01-28 07:59:42,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:42,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 3 conjunts are in the unsatisfiable core [2023-01-28 07:59:42,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 07:59:43,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:59:43,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 07:59:43,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:59:43,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016486924] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 07:59:43,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 07:59:43,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-01-28 07:59:43,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724667756] [2023-01-28 07:59:43,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 07:59:43,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 07:59:43,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:59:43,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 07:59:43,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-01-28 07:59:43,035 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 341 [2023-01-28 07:59:43,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 111 flow. Second operand has 7 states, 7 states have (on average 153.85714285714286) internal successors, (1077), 7 states have internal predecessors, (1077), 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) [2023-01-28 07:59:43,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:59:43,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 341 [2023-01-28 07:59:43,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:59:43,142 INFO L130 PetriNetUnfolder]: 301/637 cut-off events. [2023-01-28 07:59:43,142 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2023-01-28 07:59:43,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1272 conditions, 637 events. 301/637 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3076 event pairs, 266 based on Foata normal form. 3/547 useless extension candidates. Maximal degree in co-relation 1245. Up to 571 conditions per place. [2023-01-28 07:59:43,144 INFO L137 encePairwiseOnDemand]: 338/341 looper letters, 36 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2023-01-28 07:59:43,144 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 49 transitions, 205 flow [2023-01-28 07:59:43,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 07:59:43,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 07:59:43,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 956 transitions. [2023-01-28 07:59:43,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46725317693059626 [2023-01-28 07:59:43,146 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 956 transitions. [2023-01-28 07:59:43,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 956 transitions. [2023-01-28 07:59:43,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:59:43,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 956 transitions. [2023-01-28 07:59:43,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 159.33333333333334) internal successors, (956), 6 states have internal predecessors, (956), 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) [2023-01-28 07:59:43,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 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) [2023-01-28 07:59:43,151 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 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) [2023-01-28 07:59:43,151 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 111 flow. Second operand 6 states and 956 transitions. [2023-01-28 07:59:43,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 49 transitions, 205 flow [2023-01-28 07:59:43,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 49 transitions, 201 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 07:59:43,153 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 143 flow [2023-01-28 07:59:43,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=143, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2023-01-28 07:59:43,153 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 11 predicate places. [2023-01-28 07:59:43,154 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 143 flow [2023-01-28 07:59:43,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 153.85714285714286) internal successors, (1077), 7 states have internal predecessors, (1077), 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) [2023-01-28 07:59:43,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:59:43,154 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:59:43,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-01-28 07:59:43,362 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,SelfDestructingSolverStorable2 [2023-01-28 07:59:43,362 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 07:59:43,362 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:59:43,362 INFO L85 PathProgramCache]: Analyzing trace with hash 967406523, now seen corresponding path program 2 times [2023-01-28 07:59:43,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:59:43,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360411195] [2023-01-28 07:59:43,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:43,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:59:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:43,428 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:59:43,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:59:43,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360411195] [2023-01-28 07:59:43,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360411195] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 07:59:43,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931207322] [2023-01-28 07:59:43,429 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 07:59:43,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:59:43,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:59:43,430 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) [2023-01-28 07:59:43,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-01-28 07:59:43,488 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-01-28 07:59:43,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 07:59:43,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 22 conjunts are in the unsatisfiable core [2023-01-28 07:59:43,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 07:59:43,568 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 6 [2023-01-28 07:59:43,626 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 07:59:43,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 07:59:43,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 07:59:43,730 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-01-28 07:59:43,731 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 07:59:43,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931207322] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:59:43,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 07:59:43,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-01-28 07:59:43,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087267714] [2023-01-28 07:59:43,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:59:43,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 07:59:43,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:59:43,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 07:59:43,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-01-28 07:59:43,734 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 341 [2023-01-28 07:59:43,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 143 flow. Second operand has 6 states, 6 states have (on average 124.33333333333333) internal successors, (746), 6 states have internal predecessors, (746), 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) [2023-01-28 07:59:43,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:59:43,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 341 [2023-01-28 07:59:43,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:59:43,889 INFO L130 PetriNetUnfolder]: 319/710 cut-off events. [2023-01-28 07:59:43,889 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2023-01-28 07:59:43,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1426 conditions, 710 events. 319/710 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3641 event pairs, 49 based on Foata normal form. 0/629 useless extension candidates. Maximal degree in co-relation 1391. Up to 434 conditions per place. [2023-01-28 07:59:43,892 INFO L137 encePairwiseOnDemand]: 333/341 looper letters, 45 selfloop transitions, 6 changer transitions 36/93 dead transitions. [2023-01-28 07:59:43,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 93 transitions, 409 flow [2023-01-28 07:59:43,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 07:59:43,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 07:59:43,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 824 transitions. [2023-01-28 07:59:43,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4027370478983382 [2023-01-28 07:59:43,894 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 824 transitions. [2023-01-28 07:59:43,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 824 transitions. [2023-01-28 07:59:43,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:59:43,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 824 transitions. [2023-01-28 07:59:43,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 137.33333333333334) internal successors, (824), 6 states have internal predecessors, (824), 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) [2023-01-28 07:59:43,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 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) [2023-01-28 07:59:43,898 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 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) [2023-01-28 07:59:43,898 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 143 flow. Second operand 6 states and 824 transitions. [2023-01-28 07:59:43,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 93 transitions, 409 flow [2023-01-28 07:59:43,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 93 transitions, 395 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-01-28 07:59:43,902 INFO L231 Difference]: Finished difference. Result has 64 places, 46 transitions, 157 flow [2023-01-28 07:59:43,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=157, PETRI_PLACES=64, PETRI_TRANSITIONS=46} [2023-01-28 07:59:43,903 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 19 predicate places. [2023-01-28 07:59:43,904 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 46 transitions, 157 flow [2023-01-28 07:59:43,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.33333333333333) internal successors, (746), 6 states have internal predecessors, (746), 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) [2023-01-28 07:59:43,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:59:43,904 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:59:43,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-01-28 07:59:44,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:59:44,109 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 07:59:44,110 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:59:44,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1432371976, now seen corresponding path program 1 times [2023-01-28 07:59:44,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:59:44,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349031240] [2023-01-28 07:59:44,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:44,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:59:44,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:44,186 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-01-28 07:59:44,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:59:44,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349031240] [2023-01-28 07:59:44,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349031240] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 07:59:44,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022640907] [2023-01-28 07:59:44,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:44,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:59:44,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:59:44,187 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) [2023-01-28 07:59:44,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-01-28 07:59:44,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:44,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 6 conjunts are in the unsatisfiable core [2023-01-28 07:59:44,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 07:59:44,285 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 07:59:44,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 07:59:44,321 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 07:59:44,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022640907] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 07:59:44,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 07:59:44,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2023-01-28 07:59:44,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849217959] [2023-01-28 07:59:44,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 07:59:44,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-01-28 07:59:44,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:59:44,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-01-28 07:59:44,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-01-28 07:59:44,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 341 [2023-01-28 07:59:44,325 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 46 transitions, 157 flow. Second operand has 14 states, 14 states have (on average 148.07142857142858) internal successors, (2073), 14 states have internal predecessors, (2073), 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) [2023-01-28 07:59:44,325 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:59:44,326 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 341 [2023-01-28 07:59:44,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:59:44,363 INFO L130 PetriNetUnfolder]: 23/80 cut-off events. [2023-01-28 07:59:44,363 INFO L131 PetriNetUnfolder]: For 130/130 co-relation queries the response was YES. [2023-01-28 07:59:44,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 80 events. 23/80 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 124 event pairs, 8 based on Foata normal form. 18/95 useless extension candidates. Maximal degree in co-relation 204. Up to 46 conditions per place. [2023-01-28 07:59:44,363 INFO L137 encePairwiseOnDemand]: 336/341 looper letters, 0 selfloop transitions, 0 changer transitions 43/43 dead transitions. [2023-01-28 07:59:44,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 43 transitions, 236 flow [2023-01-28 07:59:44,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-28 07:59:44,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-01-28 07:59:44,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2090 transitions. [2023-01-28 07:59:44,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4377880184331797 [2023-01-28 07:59:44,367 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2090 transitions. [2023-01-28 07:59:44,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2090 transitions. [2023-01-28 07:59:44,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:59:44,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2090 transitions. [2023-01-28 07:59:44,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 149.28571428571428) internal successors, (2090), 14 states have internal predecessors, (2090), 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) [2023-01-28 07:59:44,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 341.0) internal successors, (5115), 15 states have internal predecessors, (5115), 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) [2023-01-28 07:59:44,376 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 341.0) internal successors, (5115), 15 states have internal predecessors, (5115), 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) [2023-01-28 07:59:44,376 INFO L175 Difference]: Start difference. First operand has 64 places, 46 transitions, 157 flow. Second operand 14 states and 2090 transitions. [2023-01-28 07:59:44,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 43 transitions, 236 flow [2023-01-28 07:59:44,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 43 transitions, 213 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-01-28 07:59:44,379 INFO L231 Difference]: Finished difference. Result has 46 places, 0 transitions, 0 flow [2023-01-28 07:59:44,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=0, PETRI_PLACES=46, PETRI_TRANSITIONS=0} [2023-01-28 07:59:44,380 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 1 predicate places. [2023-01-28 07:59:44,380 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 0 transitions, 0 flow [2023-01-28 07:59:44,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 148.07142857142858) internal successors, (2073), 14 states have internal predecessors, (2073), 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) [2023-01-28 07:59:44,383 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-01-28 07:59:44,383 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-01-28 07:59:44,383 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-01-28 07:59:44,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-01-28 07:59:44,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:59:44,588 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2023-01-28 07:59:44,590 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-01-28 07:59:44,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 190 transitions, 388 flow [2023-01-28 07:59:44,611 INFO L130 PetriNetUnfolder]: 45/260 cut-off events. [2023-01-28 07:59:44,611 INFO L131 PetriNetUnfolder]: For 1/2 co-relation queries the response was YES. [2023-01-28 07:59:44,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 260 events. 45/260 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 817 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 143. Up to 8 conditions per place. [2023-01-28 07:59:44,613 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 190 transitions, 388 flow [2023-01-28 07:59:44,614 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 185 transitions, 375 flow [2023-01-28 07:59:44,615 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 07:59:44,616 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 185 transitions, 375 flow [2023-01-28 07:59:44,616 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 185 transitions, 375 flow [2023-01-28 07:59:44,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 185 transitions, 375 flow [2023-01-28 07:59:44,628 INFO L130 PetriNetUnfolder]: 44/255 cut-off events. [2023-01-28 07:59:44,628 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:59:44,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 255 events. 44/255 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 776 event pairs, 0 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 143. Up to 8 conditions per place. [2023-01-28 07:59:44,631 INFO L119 LiptonReduction]: Number of co-enabled transitions 10336 [2023-01-28 07:59:46,254 INFO L134 LiptonReduction]: Checked pairs total: 16649 [2023-01-28 07:59:46,254 INFO L136 LiptonReduction]: Total number of compositions: 150 [2023-01-28 07:59:46,256 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-01-28 07:59:46,256 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;@78496575, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 07:59:46,256 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-28 07:59:46,259 INFO L130 PetriNetUnfolder]: 12/42 cut-off events. [2023-01-28 07:59:46,259 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:59:46,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:59:46,259 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-01-28 07:59:46,259 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 07:59:46,259 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:59:46,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1785070566, now seen corresponding path program 1 times [2023-01-28 07:59:46,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:59:46,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844179377] [2023-01-28 07:59:46,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:46,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:59:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:46,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 07:59:46,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:59:46,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844179377] [2023-01-28 07:59:46,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844179377] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:59:46,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:59:46,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 07:59:46,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612874215] [2023-01-28 07:59:46,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:59:46,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 07:59:46,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:59:46,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 07:59:46,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 07:59:46,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 340 [2023-01-28 07:59:46,278 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 66 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 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) [2023-01-28 07:59:46,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:59:46,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 340 [2023-01-28 07:59:46,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:59:46,351 INFO L130 PetriNetUnfolder]: 300/656 cut-off events. [2023-01-28 07:59:46,351 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:59:46,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1250 conditions, 656 events. 300/656 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3223 event pairs, 266 based on Foata normal form. 108/654 useless extension candidates. Maximal degree in co-relation 1194. Up to 588 conditions per place. [2023-01-28 07:59:46,352 INFO L137 encePairwiseOnDemand]: 316/340 looper letters, 20 selfloop transitions, 2 changer transitions 19/46 dead transitions. [2023-01-28 07:59:46,352 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 173 flow [2023-01-28 07:59:46,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 07:59:46,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 07:59:46,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 516 transitions. [2023-01-28 07:59:46,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5058823529411764 [2023-01-28 07:59:46,354 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 516 transitions. [2023-01-28 07:59:46,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 516 transitions. [2023-01-28 07:59:46,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:59:46,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 516 transitions. [2023-01-28 07:59:46,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 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) [2023-01-28 07:59:46,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 340.0) internal successors, (1360), 4 states have internal predecessors, (1360), 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) [2023-01-28 07:59:46,356 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 340.0) internal successors, (1360), 4 states have internal predecessors, (1360), 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) [2023-01-28 07:59:46,356 INFO L175 Difference]: Start difference. First operand has 45 places, 66 transitions, 137 flow. Second operand 3 states and 516 transitions. [2023-01-28 07:59:46,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 173 flow [2023-01-28 07:59:46,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 46 transitions, 173 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 07:59:46,357 INFO L231 Difference]: Finished difference. Result has 48 places, 27 transitions, 69 flow [2023-01-28 07:59:46,357 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=48, PETRI_TRANSITIONS=27} [2023-01-28 07:59:46,358 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2023-01-28 07:59:46,358 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 27 transitions, 69 flow [2023-01-28 07:59:46,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 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) [2023-01-28 07:59:46,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:59:46,358 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-01-28 07:59:46,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 07:59:46,359 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 07:59:46,359 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:59:46,359 INFO L85 PathProgramCache]: Analyzing trace with hash -523375806, now seen corresponding path program 1 times [2023-01-28 07:59:46,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:59:46,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144993829] [2023-01-28 07:59:46,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:46,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:59:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:46,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 07:59:46,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:59:46,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144993829] [2023-01-28 07:59:46,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144993829] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 07:59:46,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448972144] [2023-01-28 07:59:46,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:46,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:59:46,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:59:46,381 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 07:59:46,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-01-28 07:59:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:46,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2023-01-28 07:59:46,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 07:59:46,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 07:59:46,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 07:59:46,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 07:59:46,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448972144] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 07:59:46,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 07:59:46,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-01-28 07:59:46,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491731117] [2023-01-28 07:59:46,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 07:59:46,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 07:59:46,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:59:46,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 07:59:46,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-01-28 07:59:46,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 340 [2023-01-28 07:59:46,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 27 transitions, 69 flow. Second operand has 7 states, 7 states have (on average 153.57142857142858) internal successors, (1075), 7 states have internal predecessors, (1075), 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) [2023-01-28 07:59:46,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:59:46,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 340 [2023-01-28 07:59:46,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:59:46,506 INFO L130 PetriNetUnfolder]: 47/128 cut-off events. [2023-01-28 07:59:46,506 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:59:46,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255 conditions, 128 events. 47/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 358 event pairs, 42 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 243. Up to 108 conditions per place. [2023-01-28 07:59:46,506 INFO L137 encePairwiseOnDemand]: 337/340 looper letters, 20 selfloop transitions, 5 changer transitions 0/30 dead transitions. [2023-01-28 07:59:46,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 131 flow [2023-01-28 07:59:46,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 07:59:46,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 07:59:46,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 940 transitions. [2023-01-28 07:59:46,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46078431372549017 [2023-01-28 07:59:46,508 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 940 transitions. [2023-01-28 07:59:46,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 940 transitions. [2023-01-28 07:59:46,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:59:46,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 940 transitions. [2023-01-28 07:59:46,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 156.66666666666666) internal successors, (940), 6 states have internal predecessors, (940), 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) [2023-01-28 07:59:46,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 340.0) internal successors, (2380), 7 states have internal predecessors, (2380), 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) [2023-01-28 07:59:46,512 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 340.0) internal successors, (2380), 7 states have internal predecessors, (2380), 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) [2023-01-28 07:59:46,512 INFO L175 Difference]: Start difference. First operand has 48 places, 27 transitions, 69 flow. Second operand 6 states and 940 transitions. [2023-01-28 07:59:46,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 131 flow [2023-01-28 07:59:46,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 127 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-28 07:59:46,513 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 101 flow [2023-01-28 07:59:46,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=101, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2023-01-28 07:59:46,513 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -8 predicate places. [2023-01-28 07:59:46,514 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 101 flow [2023-01-28 07:59:46,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 153.57142857142858) internal successors, (1075), 7 states have internal predecessors, (1075), 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) [2023-01-28 07:59:46,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:59:46,514 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2023-01-28 07:59:46,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-01-28 07:59:46,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:59:46,719 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 07:59:46,719 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:59:46,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1162836454, now seen corresponding path program 2 times [2023-01-28 07:59:46,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:59:46,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095033317] [2023-01-28 07:59:46,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:46,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:59:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:46,760 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 07:59:46,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:59:46,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095033317] [2023-01-28 07:59:46,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095033317] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 07:59:46,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928156422] [2023-01-28 07:59:46,760 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 07:59:46,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:59:46,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:59:46,761 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 07:59:46,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-01-28 07:59:46,816 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 07:59:46,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 07:59:46,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2023-01-28 07:59:46,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 07:59:46,826 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 07:59:46,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 07:59:46,858 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 07:59:46,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928156422] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 07:59:46,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 07:59:46,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-01-28 07:59:46,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027478645] [2023-01-28 07:59:46,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 07:59:46,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-01-28 07:59:46,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:59:46,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-01-28 07:59:46,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-01-28 07:59:46,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 340 [2023-01-28 07:59:46,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 101 flow. Second operand has 13 states, 13 states have (on average 153.30769230769232) internal successors, (1993), 13 states have internal predecessors, (1993), 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) [2023-01-28 07:59:46,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:59:46,862 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 340 [2023-01-28 07:59:46,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:59:46,913 INFO L130 PetriNetUnfolder]: 47/134 cut-off events. [2023-01-28 07:59:46,913 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-01-28 07:59:46,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292 conditions, 134 events. 47/134 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 358 event pairs, 42 based on Foata normal form. 6/116 useless extension candidates. Maximal degree in co-relation 234. Up to 108 conditions per place. [2023-01-28 07:59:46,913 INFO L137 encePairwiseOnDemand]: 337/340 looper letters, 20 selfloop transitions, 11 changer transitions 0/36 dead transitions. [2023-01-28 07:59:46,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 36 transitions, 199 flow [2023-01-28 07:59:46,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-28 07:59:46,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-01-28 07:59:46,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1861 transitions. [2023-01-28 07:59:46,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45612745098039215 [2023-01-28 07:59:46,920 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1861 transitions. [2023-01-28 07:59:46,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1861 transitions. [2023-01-28 07:59:46,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:59:46,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1861 transitions. [2023-01-28 07:59:46,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 155.08333333333334) internal successors, (1861), 12 states have internal predecessors, (1861), 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) [2023-01-28 07:59:46,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 340.0) internal successors, (4420), 13 states have internal predecessors, (4420), 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) [2023-01-28 07:59:46,928 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 340.0) internal successors, (4420), 13 states have internal predecessors, (4420), 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) [2023-01-28 07:59:46,928 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 101 flow. Second operand 12 states and 1861 transitions. [2023-01-28 07:59:46,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 36 transitions, 199 flow [2023-01-28 07:59:46,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 36 transitions, 185 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-01-28 07:59:46,930 INFO L231 Difference]: Finished difference. Result has 53 places, 36 transitions, 171 flow [2023-01-28 07:59:46,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=171, PETRI_PLACES=53, PETRI_TRANSITIONS=36} [2023-01-28 07:59:46,930 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 8 predicate places. [2023-01-28 07:59:46,930 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 36 transitions, 171 flow [2023-01-28 07:59:46,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 153.30769230769232) internal successors, (1993), 13 states have internal predecessors, (1993), 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) [2023-01-28 07:59:46,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:59:46,931 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2023-01-28 07:59:46,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-01-28 07:59:47,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:59:47,145 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 07:59:47,146 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:59:47,146 INFO L85 PathProgramCache]: Analyzing trace with hash -834996966, now seen corresponding path program 3 times [2023-01-28 07:59:47,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:59:47,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530891328] [2023-01-28 07:59:47,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:47,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:59:47,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 07:59:47,164 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 07:59:47,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 07:59:47,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 07:59:47,186 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 07:59:47,186 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-01-28 07:59:47,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 07:59:47,186 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-01-28 07:59:47,187 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-01-28 07:59:47,187 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-01-28 07:59:47,187 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-01-28 07:59:47,212 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-01-28 07:59:47,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 260 transitions, 538 flow [2023-01-28 07:59:47,246 INFO L130 PetriNetUnfolder]: 75/424 cut-off events. [2023-01-28 07:59:47,246 INFO L131 PetriNetUnfolder]: For 6/8 co-relation queries the response was YES. [2023-01-28 07:59:47,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 424 events. 75/424 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1687 event pairs, 0 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 262. Up to 12 conditions per place. [2023-01-28 07:59:47,251 INFO L82 GeneralOperation]: Start removeDead. Operand has 220 places, 260 transitions, 538 flow [2023-01-28 07:59:47,254 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 220 places, 260 transitions, 538 flow [2023-01-28 07:59:47,254 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 07:59:47,254 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 220 places, 260 transitions, 538 flow [2023-01-28 07:59:47,254 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 220 places, 260 transitions, 538 flow [2023-01-28 07:59:47,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 260 transitions, 538 flow [2023-01-28 07:59:47,287 INFO L130 PetriNetUnfolder]: 75/424 cut-off events. [2023-01-28 07:59:47,287 INFO L131 PetriNetUnfolder]: For 6/8 co-relation queries the response was YES. [2023-01-28 07:59:47,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 424 events. 75/424 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1687 event pairs, 0 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 262. Up to 12 conditions per place. [2023-01-28 07:59:47,305 INFO L119 LiptonReduction]: Number of co-enabled transitions 31416 [2023-01-28 07:59:49,473 INFO L134 LiptonReduction]: Checked pairs total: 49651 [2023-01-28 07:59:49,473 INFO L136 LiptonReduction]: Total number of compositions: 216 [2023-01-28 07:59:49,475 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 07:59:49,475 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;@78496575, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 07:59:49,475 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-01-28 07:59:49,477 INFO L130 PetriNetUnfolder]: 8/30 cut-off events. [2023-01-28 07:59:49,477 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:59:49,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:59:49,477 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-01-28 07:59:49,477 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 07:59:49,477 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:59:49,477 INFO L85 PathProgramCache]: Analyzing trace with hash -200231614, now seen corresponding path program 1 times [2023-01-28 07:59:49,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:59:49,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797950610] [2023-01-28 07:59:49,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:49,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:59:49,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:49,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:59:49,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:59:49,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797950610] [2023-01-28 07:59:49,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797950610] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:59:49,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:59:49,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 07:59:49,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998479729] [2023-01-28 07:59:49,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:59:49,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 07:59:49,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:59:49,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 07:59:49,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 07:59:49,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 476 [2023-01-28 07:59:49,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 101 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 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) [2023-01-28 07:59:49,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:59:49,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 476 [2023-01-28 07:59:49,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:59:50,406 INFO L130 PetriNetUnfolder]: 9872/15757 cut-off events. [2023-01-28 07:59:50,406 INFO L131 PetriNetUnfolder]: For 109/109 co-relation queries the response was YES. [2023-01-28 07:59:50,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30205 conditions, 15757 events. 9872/15757 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 104375 event pairs, 9112 based on Foata normal form. 2730/16056 useless extension candidates. Maximal degree in co-relation 12164. Up to 14349 conditions per place. [2023-01-28 07:59:50,458 INFO L137 encePairwiseOnDemand]: 441/476 looper letters, 55 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-01-28 07:59:50,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 70 transitions, 272 flow [2023-01-28 07:59:50,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 07:59:50,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 07:59:50,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 711 transitions. [2023-01-28 07:59:50,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49789915966386555 [2023-01-28 07:59:50,460 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 711 transitions. [2023-01-28 07:59:50,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 711 transitions. [2023-01-28 07:59:50,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:59:50,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 711 transitions. [2023-01-28 07:59:50,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 237.0) internal successors, (711), 3 states have internal predecessors, (711), 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) [2023-01-28 07:59:50,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 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) [2023-01-28 07:59:50,463 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 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) [2023-01-28 07:59:50,463 INFO L175 Difference]: Start difference. First operand has 68 places, 101 transitions, 220 flow. Second operand 3 states and 711 transitions. [2023-01-28 07:59:50,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 70 transitions, 272 flow [2023-01-28 07:59:50,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 70 transitions, 272 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 07:59:50,465 INFO L231 Difference]: Finished difference. Result has 71 places, 70 transitions, 168 flow [2023-01-28 07:59:50,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=71, PETRI_TRANSITIONS=70} [2023-01-28 07:59:50,466 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2023-01-28 07:59:50,466 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 70 transitions, 168 flow [2023-01-28 07:59:50,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 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) [2023-01-28 07:59:50,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:59:50,466 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:59:50,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 07:59:50,466 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 07:59:50,466 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:59:50,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1798379354, now seen corresponding path program 1 times [2023-01-28 07:59:50,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:59:50,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734989072] [2023-01-28 07:59:50,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:50,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:59:50,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:50,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:59:50,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:59:50,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734989072] [2023-01-28 07:59:50,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734989072] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 07:59:50,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534456981] [2023-01-28 07:59:50,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:50,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:59:50,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:59:50,568 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 07:59:50,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-01-28 07:59:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:50,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjunts are in the unsatisfiable core [2023-01-28 07:59:50,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 07:59:50,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 07:59:50,660 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 07:59:50,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534456981] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:59:50,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 07:59:50,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-01-28 07:59:50,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976243672] [2023-01-28 07:59:50,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:59:50,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 07:59:50,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:59:50,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 07:59:50,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 07:59:50,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 476 [2023-01-28 07:59:50,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 70 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 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) [2023-01-28 07:59:50,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:59:50,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 476 [2023-01-28 07:59:50,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:59:51,470 INFO L130 PetriNetUnfolder]: 9675/15570 cut-off events. [2023-01-28 07:59:51,470 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2023-01-28 07:59:51,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30030 conditions, 15570 events. 9675/15570 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 105458 event pairs, 4312 based on Foata normal form. 0/13126 useless extension candidates. Maximal degree in co-relation 30017. Up to 14317 conditions per place. [2023-01-28 07:59:51,597 INFO L137 encePairwiseOnDemand]: 473/476 looper letters, 72 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2023-01-28 07:59:51,597 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 87 transitions, 350 flow [2023-01-28 07:59:51,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 07:59:51,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 07:59:51,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 695 transitions. [2023-01-28 07:59:51,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48669467787114845 [2023-01-28 07:59:51,599 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 695 transitions. [2023-01-28 07:59:51,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 695 transitions. [2023-01-28 07:59:51,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:59:51,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 695 transitions. [2023-01-28 07:59:51,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 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) [2023-01-28 07:59:51,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 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) [2023-01-28 07:59:51,602 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 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) [2023-01-28 07:59:51,602 INFO L175 Difference]: Start difference. First operand has 71 places, 70 transitions, 168 flow. Second operand 3 states and 695 transitions. [2023-01-28 07:59:51,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 87 transitions, 350 flow [2023-01-28 07:59:51,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 87 transitions, 346 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-28 07:59:51,606 INFO L231 Difference]: Finished difference. Result has 73 places, 71 transitions, 176 flow [2023-01-28 07:59:51,606 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=73, PETRI_TRANSITIONS=71} [2023-01-28 07:59:51,607 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 5 predicate places. [2023-01-28 07:59:51,607 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 71 transitions, 176 flow [2023-01-28 07:59:51,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 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) [2023-01-28 07:59:51,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:59:51,607 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:59:51,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-01-28 07:59:51,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:59:51,812 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 07:59:51,813 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:59:51,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1146753669, now seen corresponding path program 1 times [2023-01-28 07:59:51,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:59:51,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416330017] [2023-01-28 07:59:51,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:51,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:59:51,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:51,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:59:51,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:59:51,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416330017] [2023-01-28 07:59:51,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416330017] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 07:59:51,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359876255] [2023-01-28 07:59:51,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:51,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:59:51,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:59:51,842 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 07:59:51,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-01-28 07:59:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:51,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 3 conjunts are in the unsatisfiable core [2023-01-28 07:59:51,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 07:59:51,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:59:51,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 07:59:51,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:59:51,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359876255] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 07:59:51,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 07:59:51,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-01-28 07:59:51,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958745075] [2023-01-28 07:59:51,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 07:59:51,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 07:59:51,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:59:51,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 07:59:51,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-01-28 07:59:51,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 476 [2023-01-28 07:59:51,951 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 71 transitions, 176 flow. Second operand has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 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) [2023-01-28 07:59:51,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:59:51,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 476 [2023-01-28 07:59:51,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:59:52,852 INFO L130 PetriNetUnfolder]: 9912/15619 cut-off events. [2023-01-28 07:59:52,852 INFO L131 PetriNetUnfolder]: For 612/612 co-relation queries the response was YES. [2023-01-28 07:59:52,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30593 conditions, 15619 events. 9912/15619 cut-off events. For 612/612 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 101714 event pairs, 9112 based on Foata normal form. 3/13422 useless extension candidates. Maximal degree in co-relation 30565. Up to 14334 conditions per place. [2023-01-28 07:59:52,892 INFO L137 encePairwiseOnDemand]: 473/476 looper letters, 56 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2023-01-28 07:59:52,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 74 transitions, 310 flow [2023-01-28 07:59:52,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 07:59:52,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 07:59:52,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1305 transitions. [2023-01-28 07:59:52,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4569327731092437 [2023-01-28 07:59:52,896 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1305 transitions. [2023-01-28 07:59:52,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1305 transitions. [2023-01-28 07:59:52,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:59:52,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1305 transitions. [2023-01-28 07:59:52,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 217.5) internal successors, (1305), 6 states have internal predecessors, (1305), 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) [2023-01-28 07:59:52,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 476.0) internal successors, (3332), 7 states have internal predecessors, (3332), 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) [2023-01-28 07:59:52,909 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 476.0) internal successors, (3332), 7 states have internal predecessors, (3332), 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) [2023-01-28 07:59:52,909 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 176 flow. Second operand 6 states and 1305 transitions. [2023-01-28 07:59:52,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 74 transitions, 310 flow [2023-01-28 07:59:52,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 74 transitions, 308 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 07:59:52,911 INFO L231 Difference]: Finished difference. Result has 80 places, 74 transitions, 210 flow [2023-01-28 07:59:52,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=210, PETRI_PLACES=80, PETRI_TRANSITIONS=74} [2023-01-28 07:59:52,911 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 12 predicate places. [2023-01-28 07:59:52,912 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 74 transitions, 210 flow [2023-01-28 07:59:52,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 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) [2023-01-28 07:59:52,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:59:52,912 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:59:52,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-01-28 07:59:53,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-01-28 07:59:53,113 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 07:59:53,113 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:59:53,114 INFO L85 PathProgramCache]: Analyzing trace with hash -737928083, now seen corresponding path program 2 times [2023-01-28 07:59:53,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:59:53,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565705416] [2023-01-28 07:59:53,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:53,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:59:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:53,168 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:59:53,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:59:53,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565705416] [2023-01-28 07:59:53,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565705416] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 07:59:53,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996935869] [2023-01-28 07:59:53,169 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 07:59:53,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:59:53,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:59:53,170 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 07:59:53,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-01-28 07:59:53,242 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-01-28 07:59:53,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 07:59:53,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 22 conjunts are in the unsatisfiable core [2023-01-28 07:59:53,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 07:59:53,251 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 6 [2023-01-28 07:59:53,281 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 07:59:53,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 07:59:53,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 07:59:53,340 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-01-28 07:59:53,341 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 07:59:53,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996935869] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:59:53,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 07:59:53,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-01-28 07:59:53,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393442954] [2023-01-28 07:59:53,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:59:53,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 07:59:53,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:59:53,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 07:59:53,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-01-28 07:59:53,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 476 [2023-01-28 07:59:53,344 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 74 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 173.5) internal successors, (1041), 6 states have internal predecessors, (1041), 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) [2023-01-28 07:59:53,344 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:59:53,344 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 476 [2023-01-28 07:59:53,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:59:54,446 INFO L130 PetriNetUnfolder]: 10465/17002 cut-off events. [2023-01-28 07:59:54,446 INFO L131 PetriNetUnfolder]: For 588/588 co-relation queries the response was YES. [2023-01-28 07:59:54,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33425 conditions, 17002 events. 10465/17002 cut-off events. For 588/588 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 118896 event pairs, 2255 based on Foata normal form. 0/15020 useless extension candidates. Maximal degree in co-relation 33389. Up to 12366 conditions per place. [2023-01-28 07:59:54,492 INFO L137 encePairwiseOnDemand]: 466/476 looper letters, 125 selfloop transitions, 14 changer transitions 14/165 dead transitions. [2023-01-28 07:59:54,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 165 transitions, 729 flow [2023-01-28 07:59:54,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 07:59:54,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 07:59:54,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1186 transitions. [2023-01-28 07:59:54,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41526610644257705 [2023-01-28 07:59:54,495 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1186 transitions. [2023-01-28 07:59:54,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1186 transitions. [2023-01-28 07:59:54,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:59:54,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1186 transitions. [2023-01-28 07:59:54,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 197.66666666666666) internal successors, (1186), 6 states have internal predecessors, (1186), 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) [2023-01-28 07:59:54,500 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 476.0) internal successors, (3332), 7 states have internal predecessors, (3332), 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) [2023-01-28 07:59:54,500 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 476.0) internal successors, (3332), 7 states have internal predecessors, (3332), 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) [2023-01-28 07:59:54,501 INFO L175 Difference]: Start difference. First operand has 80 places, 74 transitions, 210 flow. Second operand 6 states and 1186 transitions. [2023-01-28 07:59:54,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 165 transitions, 729 flow [2023-01-28 07:59:54,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 165 transitions, 715 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-01-28 07:59:54,503 INFO L231 Difference]: Finished difference. Result has 88 places, 86 transitions, 293 flow [2023-01-28 07:59:54,504 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=293, PETRI_PLACES=88, PETRI_TRANSITIONS=86} [2023-01-28 07:59:54,504 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 20 predicate places. [2023-01-28 07:59:54,504 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 86 transitions, 293 flow [2023-01-28 07:59:54,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 173.5) internal successors, (1041), 6 states have internal predecessors, (1041), 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) [2023-01-28 07:59:54,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:59:54,505 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:59:54,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-01-28 07:59:54,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-01-28 07:59:54,710 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 07:59:54,710 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:59:54,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1387094974, now seen corresponding path program 1 times [2023-01-28 07:59:54,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:59:54,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479665666] [2023-01-28 07:59:54,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:54,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:59:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:54,747 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-01-28 07:59:54,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:59:54,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479665666] [2023-01-28 07:59:54,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479665666] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 07:59:54,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505810095] [2023-01-28 07:59:54,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:54,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:59:54,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:59:54,748 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 07:59:54,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-01-28 07:59:54,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:54,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 6 conjunts are in the unsatisfiable core [2023-01-28 07:59:54,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 07:59:54,842 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 07:59:54,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 07:59:54,885 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 07:59:54,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505810095] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 07:59:54,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 07:59:54,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2023-01-28 07:59:54,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572738273] [2023-01-28 07:59:54,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 07:59:54,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-01-28 07:59:54,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:59:54,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-01-28 07:59:54,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-01-28 07:59:54,888 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 476 [2023-01-28 07:59:54,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 86 transitions, 293 flow. Second operand has 14 states, 14 states have (on average 203.35714285714286) internal successors, (2847), 14 states have internal predecessors, (2847), 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) [2023-01-28 07:59:54,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:59:54,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 476 [2023-01-28 07:59:54,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:59:56,109 INFO L130 PetriNetUnfolder]: 9753/15908 cut-off events. [2023-01-28 07:59:56,109 INFO L131 PetriNetUnfolder]: For 4955/4955 co-relation queries the response was YES. [2023-01-28 07:59:56,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35637 conditions, 15908 events. 9753/15908 cut-off events. For 4955/4955 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 112984 event pairs, 162 based on Foata normal form. 22/15015 useless extension candidates. Maximal degree in co-relation 35578. Up to 14254 conditions per place. [2023-01-28 07:59:56,198 INFO L137 encePairwiseOnDemand]: 471/476 looper letters, 114 selfloop transitions, 14 changer transitions 0/141 dead transitions. [2023-01-28 07:59:56,198 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 141 transitions, 721 flow [2023-01-28 07:59:56,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-28 07:59:56,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-01-28 07:59:56,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2933 transitions. [2023-01-28 07:59:56,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44012605042016806 [2023-01-28 07:59:56,204 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2933 transitions. [2023-01-28 07:59:56,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2933 transitions. [2023-01-28 07:59:56,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:59:56,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2933 transitions. [2023-01-28 07:59:56,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 209.5) internal successors, (2933), 14 states have internal predecessors, (2933), 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) [2023-01-28 07:59:56,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 476.0) internal successors, (7140), 15 states have internal predecessors, (7140), 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) [2023-01-28 07:59:56,215 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 476.0) internal successors, (7140), 15 states have internal predecessors, (7140), 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) [2023-01-28 07:59:56,215 INFO L175 Difference]: Start difference. First operand has 88 places, 86 transitions, 293 flow. Second operand 14 states and 2933 transitions. [2023-01-28 07:59:56,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 141 transitions, 721 flow [2023-01-28 07:59:56,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 141 transitions, 721 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 07:59:56,226 INFO L231 Difference]: Finished difference. Result has 102 places, 92 transitions, 363 flow [2023-01-28 07:59:56,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=363, PETRI_PLACES=102, PETRI_TRANSITIONS=92} [2023-01-28 07:59:56,227 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 34 predicate places. [2023-01-28 07:59:56,227 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 92 transitions, 363 flow [2023-01-28 07:59:56,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 203.35714285714286) internal successors, (2847), 14 states have internal predecessors, (2847), 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) [2023-01-28 07:59:56,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:59:56,227 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:59:56,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-01-28 07:59:56,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-01-28 07:59:56,433 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 07:59:56,433 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:59:56,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1144227296, now seen corresponding path program 1 times [2023-01-28 07:59:56,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:59:56,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075774944] [2023-01-28 07:59:56,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:56,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:59:56,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:56,597 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 07:59:56,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:59:56,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075774944] [2023-01-28 07:59:56,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075774944] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:59:56,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:59:56,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 07:59:56,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028818119] [2023-01-28 07:59:56,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:59:56,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 07:59:56,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:59:56,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 07:59:56,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 07:59:56,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 476 [2023-01-28 07:59:56,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 92 transitions, 363 flow. Second operand has 5 states, 5 states have (on average 167.4) internal successors, (837), 5 states have internal predecessors, (837), 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) [2023-01-28 07:59:56,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:59:56,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 476 [2023-01-28 07:59:56,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:59:57,299 INFO L130 PetriNetUnfolder]: 5721/10402 cut-off events. [2023-01-28 07:59:57,299 INFO L131 PetriNetUnfolder]: For 3723/3723 co-relation queries the response was YES. [2023-01-28 07:59:57,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24232 conditions, 10402 events. 5721/10402 cut-off events. For 3723/3723 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 76255 event pairs, 2200 based on Foata normal form. 1522/11006 useless extension candidates. Maximal degree in co-relation 24159. Up to 5552 conditions per place. [2023-01-28 07:59:57,327 INFO L137 encePairwiseOnDemand]: 455/476 looper letters, 118 selfloop transitions, 21 changer transitions 2/150 dead transitions. [2023-01-28 07:59:57,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 150 transitions, 846 flow [2023-01-28 07:59:57,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 07:59:57,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 07:59:57,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 772 transitions. [2023-01-28 07:59:57,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4054621848739496 [2023-01-28 07:59:57,329 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 772 transitions. [2023-01-28 07:59:57,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 772 transitions. [2023-01-28 07:59:57,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:59:57,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 772 transitions. [2023-01-28 07:59:57,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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) [2023-01-28 07:59:57,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 476.0) internal successors, (2380), 5 states have internal predecessors, (2380), 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) [2023-01-28 07:59:57,332 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 476.0) internal successors, (2380), 5 states have internal predecessors, (2380), 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) [2023-01-28 07:59:57,332 INFO L175 Difference]: Start difference. First operand has 102 places, 92 transitions, 363 flow. Second operand 4 states and 772 transitions. [2023-01-28 07:59:57,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 150 transitions, 846 flow [2023-01-28 07:59:57,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 150 transitions, 773 flow, removed 26 selfloop flow, removed 10 redundant places. [2023-01-28 07:59:57,342 INFO L231 Difference]: Finished difference. Result has 96 places, 103 transitions, 399 flow [2023-01-28 07:59:57,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=399, PETRI_PLACES=96, PETRI_TRANSITIONS=103} [2023-01-28 07:59:57,342 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 28 predicate places. [2023-01-28 07:59:57,342 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 103 transitions, 399 flow [2023-01-28 07:59:57,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 167.4) internal successors, (837), 5 states have internal predecessors, (837), 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) [2023-01-28 07:59:57,342 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:59:57,343 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:59:57,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-01-28 07:59:57,343 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 07:59:57,343 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:59:57,343 INFO L85 PathProgramCache]: Analyzing trace with hash 239282032, now seen corresponding path program 1 times [2023-01-28 07:59:57,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:59:57,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748290570] [2023-01-28 07:59:57,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:57,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:59:57,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:57,816 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 07:59:57,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:59:57,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748290570] [2023-01-28 07:59:57,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748290570] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 07:59:57,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563226433] [2023-01-28 07:59:57,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:57,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:59:57,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:59:57,818 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 07:59:57,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-01-28 07:59:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:57,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 42 conjunts are in the unsatisfiable core [2023-01-28 07:59:57,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 07:59:57,943 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 6 [2023-01-28 07:59:58,007 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 07:59:58,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 07:59:58,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 07:59:58,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 07:59:58,059 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 12 [2023-01-28 07:59:58,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 07:59:58,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-01-28 07:59:58,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-01-28 07:59:58,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 07:59:58,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-01-28 07:59:58,179 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 07:59:58,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-01-28 07:59:58,221 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 07:59:58,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 07:59:58,304 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_463 Int) (|v_t_funThread2of2ForFork0_~i~0#1_55| Int) (v_ArrVal_464 (Array Int Int))) (let ((.cse0 (* |v_t_funThread2of2ForFork0_~i~0#1_55| 28))) (or (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_55|) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|) v_ArrVal_463) (+ |c_~#a~0.offset| .cse0)) 0) (< |v_t_funThread2of2ForFork0_~i~0#1_55| 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_464) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0 4)) 0))))) is different from false [2023-01-28 07:59:58,360 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 07:59:58,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-01-28 07:59:58,368 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 07:59:58,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2023-01-28 07:59:58,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-01-28 08:00:06,280 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:00:06,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563226433] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:00:06,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:00:06,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2023-01-28 08:00:06,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866770188] [2023-01-28 08:00:06,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:00:06,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-01-28 08:00:06,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:00:06,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-01-28 08:00:06,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=264, Unknown=4, NotChecked=36, Total=420 [2023-01-28 08:00:06,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 476 [2023-01-28 08:00:06,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 103 transitions, 399 flow. Second operand has 21 states, 21 states have (on average 149.42857142857142) internal successors, (3138), 21 states have internal predecessors, (3138), 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) [2023-01-28 08:00:06,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:00:06,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 476 [2023-01-28 08:00:06,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:00:08,599 INFO L130 PetriNetUnfolder]: 8321/15236 cut-off events. [2023-01-28 08:00:08,599 INFO L131 PetriNetUnfolder]: For 7787/7836 co-relation queries the response was YES. [2023-01-28 08:00:08,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41666 conditions, 15236 events. 8321/15236 cut-off events. For 7787/7836 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 120170 event pairs, 839 based on Foata normal form. 13/13974 useless extension candidates. Maximal degree in co-relation 40547. Up to 7317 conditions per place. [2023-01-28 08:00:08,661 INFO L137 encePairwiseOnDemand]: 459/476 looper letters, 306 selfloop transitions, 88 changer transitions 134/537 dead transitions. [2023-01-28 08:00:08,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 537 transitions, 3070 flow [2023-01-28 08:00:08,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-28 08:00:08,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-01-28 08:00:08,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3103 transitions. [2023-01-28 08:00:08,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36216153127917833 [2023-01-28 08:00:08,667 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3103 transitions. [2023-01-28 08:00:08,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3103 transitions. [2023-01-28 08:00:08,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:00:08,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3103 transitions. [2023-01-28 08:00:08,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 172.38888888888889) internal successors, (3103), 18 states have internal predecessors, (3103), 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) [2023-01-28 08:00:08,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 476.0) internal successors, (9044), 19 states have internal predecessors, (9044), 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) [2023-01-28 08:00:08,680 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 476.0) internal successors, (9044), 19 states have internal predecessors, (9044), 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) [2023-01-28 08:00:08,680 INFO L175 Difference]: Start difference. First operand has 96 places, 103 transitions, 399 flow. Second operand 18 states and 3103 transitions. [2023-01-28 08:00:08,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 537 transitions, 3070 flow [2023-01-28 08:00:08,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 537 transitions, 3069 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 08:00:08,697 INFO L231 Difference]: Finished difference. Result has 126 places, 180 transitions, 1116 flow [2023-01-28 08:00:08,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1116, PETRI_PLACES=126, PETRI_TRANSITIONS=180} [2023-01-28 08:00:08,698 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 58 predicate places. [2023-01-28 08:00:08,698 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 180 transitions, 1116 flow [2023-01-28 08:00:08,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 149.42857142857142) internal successors, (3138), 21 states have internal predecessors, (3138), 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) [2023-01-28 08:00:08,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:00:08,699 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:00:08,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-01-28 08:00:08,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-01-28 08:00:08,904 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:00:08,904 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:00:08,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1186553578, now seen corresponding path program 2 times [2023-01-28 08:00:08,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:00:08,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700101252] [2023-01-28 08:00:08,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:00:08,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:00:08,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:00:09,445 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:00:09,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:00:09,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700101252] [2023-01-28 08:00:09,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700101252] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:00:09,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896883669] [2023-01-28 08:00:09,446 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 08:00:09,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:00:09,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:00:09,447 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:00:09,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-01-28 08:00:09,547 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 08:00:09,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:00:09,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 41 conjunts are in the unsatisfiable core [2023-01-28 08:00:09,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:00:09,558 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 6 [2023-01-28 08:00:09,635 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:00:09,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:00:09,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:00:09,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:00:09,716 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 12 [2023-01-28 08:00:09,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:00:09,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-01-28 08:00:09,815 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:00:09,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-01-28 08:00:09,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-01-28 08:00:09,906 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:00:09,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:00:10,017 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:00:10,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-01-28 08:00:10,028 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:00:10,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2023-01-28 08:00:10,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-01-28 08:00:31,117 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_545 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_67| Int)) (or (forall ((v_ArrVal_550 Int) (|v_t_funThread2of2ForFork0_~i~0#1_57| Int) (|~#a~0.offset| Int)) (or (= |v_t_funThread2of2ForFork0_~i~0#1_57| |v_t_funThread1of2ForFork0_~i~0#1_67|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_545) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_67| 28) |~#a~0.offset|) v_ArrVal_550) (+ |~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_57| 28))) 0))) (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_67|) (< |v_t_funThread1of2ForFork0_~i~0#1_67| 0))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-01-28 08:00:34,727 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-01-28 08:00:34,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896883669] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:00:34,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:00:34,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2023-01-28 08:00:34,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551707120] [2023-01-28 08:00:34,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:00:34,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-01-28 08:00:34,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:00:34,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-01-28 08:00:34,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=362, Unknown=5, NotChecked=40, Total=506 [2023-01-28 08:00:34,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 476 [2023-01-28 08:00:34,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 180 transitions, 1116 flow. Second operand has 23 states, 23 states have (on average 149.30434782608697) internal successors, (3434), 23 states have internal predecessors, (3434), 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) [2023-01-28 08:00:34,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:00:34,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 476 [2023-01-28 08:00:34,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:00:35,248 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|)) (.cse1 (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|))) (and (forall ((v_ArrVal_550 Int)) (= (select (store .cse0 .cse1 v_ArrVal_550) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) 0)) (forall ((v_ArrVal_548 (Array Int Int)) (v_ArrVal_550 Int) (|v_t_funThread2of2ForFork0_~i~0#1_57| Int)) (let ((.cse2 (* |v_t_funThread2of2ForFork0_~i~0#1_57| 28))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_548) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse2)) 0)) (= (select (store .cse0 .cse1 v_ArrVal_550) (+ |c_~#a~0.offset| .cse2)) 0)))))) is different from false [2023-01-28 08:00:43,984 INFO L130 PetriNetUnfolder]: 13102/24414 cut-off events. [2023-01-28 08:00:43,985 INFO L131 PetriNetUnfolder]: For 56296/56342 co-relation queries the response was YES. [2023-01-28 08:00:44,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83664 conditions, 24414 events. 13102/24414 cut-off events. For 56296/56342 co-relation queries the response was YES. Maximal size of possible extension queue 971. Compared 213816 event pairs, 2195 based on Foata normal form. 113/22236 useless extension candidates. Maximal degree in co-relation 82076. Up to 8697 conditions per place. [2023-01-28 08:00:44,208 INFO L137 encePairwiseOnDemand]: 441/476 looper letters, 453 selfloop transitions, 186 changer transitions 143/791 dead transitions. [2023-01-28 08:00:44,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 791 transitions, 5724 flow [2023-01-28 08:00:44,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-01-28 08:00:44,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-01-28 08:00:44,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 3992 transitions. [2023-01-28 08:00:44,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36463280964559736 [2023-01-28 08:00:44,212 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 3992 transitions. [2023-01-28 08:00:44,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 3992 transitions. [2023-01-28 08:00:44,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:00:44,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 3992 transitions. [2023-01-28 08:00:44,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 173.56521739130434) internal successors, (3992), 23 states have internal predecessors, (3992), 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) [2023-01-28 08:00:44,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 476.0) internal successors, (11424), 24 states have internal predecessors, (11424), 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) [2023-01-28 08:00:44,225 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 476.0) internal successors, (11424), 24 states have internal predecessors, (11424), 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) [2023-01-28 08:00:44,226 INFO L175 Difference]: Start difference. First operand has 126 places, 180 transitions, 1116 flow. Second operand 23 states and 3992 transitions. [2023-01-28 08:00:44,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 791 transitions, 5724 flow [2023-01-28 08:00:44,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 791 transitions, 5720 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-01-28 08:00:44,876 INFO L231 Difference]: Finished difference. Result has 162 places, 310 transitions, 2843 flow [2023-01-28 08:00:44,877 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1114, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2843, PETRI_PLACES=162, PETRI_TRANSITIONS=310} [2023-01-28 08:00:44,877 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 94 predicate places. [2023-01-28 08:00:44,877 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 310 transitions, 2843 flow [2023-01-28 08:00:44,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 149.30434782608697) internal successors, (3434), 23 states have internal predecessors, (3434), 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) [2023-01-28 08:00:44,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:00:44,878 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:00:44,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-01-28 08:00:45,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-01-28 08:00:45,084 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:00:45,084 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:00:45,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1783488006, now seen corresponding path program 1 times [2023-01-28 08:00:45,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:00:45,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010006105] [2023-01-28 08:00:45,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:00:45,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:00:45,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:00:45,476 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:00:45,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:00:45,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010006105] [2023-01-28 08:00:45,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010006105] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:00:45,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422509256] [2023-01-28 08:00:45,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:00:45,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:00:45,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:00:45,477 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:00:45,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-01-28 08:00:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:00:45,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 39 conjunts are in the unsatisfiable core [2023-01-28 08:00:45,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:00:45,579 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 6 [2023-01-28 08:00:45,637 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:00:45,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:00:45,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:00:45,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:00:45,695 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 12 [2023-01-28 08:00:45,730 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:00:45,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-01-28 08:00:45,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-01-28 08:00:45,830 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:00:45,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:00:45,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2023-01-28 08:00:45,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2023-01-28 08:00:58,239 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:00:58,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422509256] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:00:58,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:00:58,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2023-01-28 08:00:58,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966917152] [2023-01-28 08:00:58,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:00:58,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-01-28 08:00:58,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:00:58,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-01-28 08:00:58,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=252, Unknown=7, NotChecked=0, Total=342 [2023-01-28 08:00:58,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 476 [2023-01-28 08:00:58,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 310 transitions, 2843 flow. Second operand has 19 states, 19 states have (on average 147.6315789473684) internal successors, (2805), 19 states have internal predecessors, (2805), 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) [2023-01-28 08:00:58,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:00:58,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 476 [2023-01-28 08:00:58,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:01:05,447 INFO L130 PetriNetUnfolder]: 15648/29299 cut-off events. [2023-01-28 08:01:05,447 INFO L131 PetriNetUnfolder]: For 171102/171150 co-relation queries the response was YES. [2023-01-28 08:01:05,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135511 conditions, 29299 events. 15648/29299 cut-off events. For 171102/171150 co-relation queries the response was YES. Maximal size of possible extension queue 1149. Compared 264596 event pairs, 4400 based on Foata normal form. 53/26702 useless extension candidates. Maximal degree in co-relation 132592. Up to 16017 conditions per place. [2023-01-28 08:01:05,749 INFO L137 encePairwiseOnDemand]: 455/476 looper letters, 466 selfloop transitions, 114 changer transitions 120/709 dead transitions. [2023-01-28 08:01:05,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 709 transitions, 7219 flow [2023-01-28 08:01:05,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-28 08:01:05,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-01-28 08:01:05,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3023 transitions. [2023-01-28 08:01:05,752 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3528244631185808 [2023-01-28 08:01:05,752 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3023 transitions. [2023-01-28 08:01:05,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3023 transitions. [2023-01-28 08:01:05,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:01:05,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3023 transitions. [2023-01-28 08:01:05,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 167.94444444444446) internal successors, (3023), 18 states have internal predecessors, (3023), 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) [2023-01-28 08:01:05,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 476.0) internal successors, (9044), 19 states have internal predecessors, (9044), 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) [2023-01-28 08:01:05,761 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 476.0) internal successors, (9044), 19 states have internal predecessors, (9044), 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) [2023-01-28 08:01:05,761 INFO L175 Difference]: Start difference. First operand has 162 places, 310 transitions, 2843 flow. Second operand 18 states and 3023 transitions. [2023-01-28 08:01:05,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 709 transitions, 7219 flow [2023-01-28 08:01:06,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 709 transitions, 7119 flow, removed 50 selfloop flow, removed 0 redundant places. [2023-01-28 08:01:06,877 INFO L231 Difference]: Finished difference. Result has 191 places, 364 transitions, 3736 flow [2023-01-28 08:01:06,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=2743, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3736, PETRI_PLACES=191, PETRI_TRANSITIONS=364} [2023-01-28 08:01:06,878 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 123 predicate places. [2023-01-28 08:01:06,878 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 364 transitions, 3736 flow [2023-01-28 08:01:06,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 147.6315789473684) internal successors, (2805), 19 states have internal predecessors, (2805), 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) [2023-01-28 08:01:06,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:01:06,879 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:01:06,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-01-28 08:01:07,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-01-28 08:01:07,084 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:01:07,084 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:01:07,084 INFO L85 PathProgramCache]: Analyzing trace with hash -567793192, now seen corresponding path program 3 times [2023-01-28 08:01:07,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:01:07,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38821288] [2023-01-28 08:01:07,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:01:07,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:01:07,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:01:07,739 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:01:07,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:01:07,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38821288] [2023-01-28 08:01:07,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38821288] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:01:07,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242000121] [2023-01-28 08:01:07,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 08:01:07,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:01:07,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:01:07,750 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:01:07,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-01-28 08:01:07,849 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-28 08:01:07,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:01:07,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 39 conjunts are in the unsatisfiable core [2023-01-28 08:01:07,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:01:07,861 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 6 [2023-01-28 08:01:07,923 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:01:07,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:01:07,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:01:07,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:01:07,999 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 12 [2023-01-28 08:01:08,042 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:01:08,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-01-28 08:01:08,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-01-28 08:01:08,151 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:01:08,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:01:08,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2023-01-28 08:01:08,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2023-01-28 08:01:22,325 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~i~0#1_61| Int) (v_ArrVal_719 Int) (v_ArrVal_716 (Array Int Int)) (|~#a~0.offset| Int) (|v_t_funThread1of2ForFork0_~i~0#1_71| Int)) (or (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_61|) (< |v_t_funThread2of2ForFork0_~i~0#1_61| 0) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_716) |c_~#a~0.base|) (+ |~#a~0.offset| (* |v_t_funThread1of2ForFork0_~i~0#1_71| 28)) v_ArrVal_719) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_61| 28) |~#a~0.offset|)) 0) (= |v_t_funThread2of2ForFork0_~i~0#1_61| |v_t_funThread1of2ForFork0_~i~0#1_71|))) is different from false [2023-01-28 08:01:22,536 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-01-28 08:01:22,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242000121] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:01:22,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:01:22,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 19 [2023-01-28 08:01:22,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535762158] [2023-01-28 08:01:22,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:01:22,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-01-28 08:01:22,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:01:22,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-01-28 08:01:22,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=290, Unknown=8, NotChecked=36, Total=420 [2023-01-28 08:01:22,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 476 [2023-01-28 08:01:22,540 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 364 transitions, 3736 flow. Second operand has 21 states, 21 states have (on average 149.57142857142858) internal successors, (3141), 21 states have internal predecessors, (3141), 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) [2023-01-28 08:01:22,540 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:01:22,540 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 476 [2023-01-28 08:01:22,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:01:28,080 INFO L130 PetriNetUnfolder]: 17695/33288 cut-off events. [2023-01-28 08:01:28,080 INFO L131 PetriNetUnfolder]: For 263206/263282 co-relation queries the response was YES. [2023-01-28 08:01:28,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167393 conditions, 33288 events. 17695/33288 cut-off events. For 263206/263282 co-relation queries the response was YES. Maximal size of possible extension queue 1330. Compared 308810 event pairs, 3694 based on Foata normal form. 60/30373 useless extension candidates. Maximal degree in co-relation 164401. Up to 15834 conditions per place. [2023-01-28 08:01:28,470 INFO L137 encePairwiseOnDemand]: 456/476 looper letters, 489 selfloop transitions, 137 changer transitions 165/800 dead transitions. [2023-01-28 08:01:28,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 800 transitions, 9136 flow [2023-01-28 08:01:28,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-28 08:01:28,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-01-28 08:01:28,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2918 transitions. [2023-01-28 08:01:28,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3606030647553139 [2023-01-28 08:01:28,473 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2918 transitions. [2023-01-28 08:01:28,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2918 transitions. [2023-01-28 08:01:28,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:01:28,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2918 transitions. [2023-01-28 08:01:28,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 171.64705882352942) internal successors, (2918), 17 states have internal predecessors, (2918), 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) [2023-01-28 08:01:28,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 476.0) internal successors, (8568), 18 states have internal predecessors, (8568), 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) [2023-01-28 08:01:28,486 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 476.0) internal successors, (8568), 18 states have internal predecessors, (8568), 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) [2023-01-28 08:01:28,487 INFO L175 Difference]: Start difference. First operand has 191 places, 364 transitions, 3736 flow. Second operand 17 states and 2918 transitions. [2023-01-28 08:01:28,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 800 transitions, 9136 flow [2023-01-28 08:01:31,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 800 transitions, 8918 flow, removed 92 selfloop flow, removed 4 redundant places. [2023-01-28 08:01:31,898 INFO L231 Difference]: Finished difference. Result has 211 places, 401 transitions, 4605 flow [2023-01-28 08:01:31,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=3594, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=4605, PETRI_PLACES=211, PETRI_TRANSITIONS=401} [2023-01-28 08:01:31,899 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 143 predicate places. [2023-01-28 08:01:31,899 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 401 transitions, 4605 flow [2023-01-28 08:01:31,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 149.57142857142858) internal successors, (3141), 21 states have internal predecessors, (3141), 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) [2023-01-28 08:01:31,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:01:31,900 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:01:31,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-01-28 08:01:32,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:01:32,109 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:01:32,109 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:01:32,109 INFO L85 PathProgramCache]: Analyzing trace with hash -7444614, now seen corresponding path program 2 times [2023-01-28 08:01:32,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:01:32,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382383787] [2023-01-28 08:01:32,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:01:32,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:01:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:01:32,405 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:01:32,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:01:32,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382383787] [2023-01-28 08:01:32,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382383787] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:01:32,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184049017] [2023-01-28 08:01:32,405 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 08:01:32,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:01:32,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:01:32,407 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:01:32,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-01-28 08:01:32,514 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 08:01:32,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:01:32,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 39 conjunts are in the unsatisfiable core [2023-01-28 08:01:32,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:01:32,523 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 6 [2023-01-28 08:01:32,569 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:01:32,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:01:32,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:01:32,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:01:32,630 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 12 [2023-01-28 08:01:32,679 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:01:32,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-01-28 08:01:32,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-01-28 08:01:32,799 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:01:32,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:01:32,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2023-01-28 08:01:32,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2023-01-28 08:01:42,938 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_801 (Array Int Int)) (|~#a~0.offset| Int) (|v_t_funThread1of2ForFork0_~i~0#1_73| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_801) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_73| 28) |~#a~0.offset|)) 0)) is different from false [2023-01-28 08:01:43,023 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-01-28 08:01:43,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184049017] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:01:43,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:01:43,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2023-01-28 08:01:43,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012818382] [2023-01-28 08:01:43,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:01:43,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-01-28 08:01:43,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:01:43,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-01-28 08:01:43,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=169, Unknown=3, NotChecked=28, Total=272 [2023-01-28 08:01:43,026 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 476 [2023-01-28 08:01:43,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 401 transitions, 4605 flow. Second operand has 17 states, 17 states have (on average 150.64705882352942) internal successors, (2561), 17 states have internal predecessors, (2561), 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) [2023-01-28 08:01:43,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:01:43,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 476 [2023-01-28 08:01:43,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:01:49,485 INFO L130 PetriNetUnfolder]: 18847/35834 cut-off events. [2023-01-28 08:01:49,486 INFO L131 PetriNetUnfolder]: For 313413/313505 co-relation queries the response was YES. [2023-01-28 08:01:49,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183575 conditions, 35834 events. 18847/35834 cut-off events. For 313413/313505 co-relation queries the response was YES. Maximal size of possible extension queue 1444. Compared 340583 event pairs, 4920 based on Foata normal form. 63/32762 useless extension candidates. Maximal degree in co-relation 180916. Up to 19539 conditions per place. [2023-01-28 08:01:49,879 INFO L137 encePairwiseOnDemand]: 456/476 looper letters, 469 selfloop transitions, 119 changer transitions 153/750 dead transitions. [2023-01-28 08:01:49,879 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 750 transitions, 8904 flow [2023-01-28 08:01:49,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-01-28 08:01:49,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-01-28 08:01:49,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2777 transitions. [2023-01-28 08:01:49,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3646271008403361 [2023-01-28 08:01:49,882 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2777 transitions. [2023-01-28 08:01:49,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2777 transitions. [2023-01-28 08:01:49,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:01:49,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2777 transitions. [2023-01-28 08:01:49,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 173.5625) internal successors, (2777), 16 states have internal predecessors, (2777), 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) [2023-01-28 08:01:49,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 476.0) internal successors, (8092), 17 states have internal predecessors, (8092), 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) [2023-01-28 08:01:49,889 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 476.0) internal successors, (8092), 17 states have internal predecessors, (8092), 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) [2023-01-28 08:01:49,889 INFO L175 Difference]: Start difference. First operand has 211 places, 401 transitions, 4605 flow. Second operand 16 states and 2777 transitions. [2023-01-28 08:01:49,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 750 transitions, 8904 flow [2023-01-28 08:01:52,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 750 transitions, 8717 flow, removed 62 selfloop flow, removed 7 redundant places. [2023-01-28 08:01:52,437 INFO L231 Difference]: Finished difference. Result has 222 places, 407 transitions, 4989 flow [2023-01-28 08:01:52,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=4478, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=4989, PETRI_PLACES=222, PETRI_TRANSITIONS=407} [2023-01-28 08:01:52,439 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 154 predicate places. [2023-01-28 08:01:52,439 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 407 transitions, 4989 flow [2023-01-28 08:01:52,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 150.64705882352942) internal successors, (2561), 17 states have internal predecessors, (2561), 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) [2023-01-28 08:01:52,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:01:52,439 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:01:52,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-01-28 08:01:52,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:01:52,645 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:01:52,645 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:01:52,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1898646590, now seen corresponding path program 3 times [2023-01-28 08:01:52,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:01:52,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478528938] [2023-01-28 08:01:52,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:01:52,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:01:52,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:01:55,785 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 08:01:55,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:01:55,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478528938] [2023-01-28 08:01:55,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478528938] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:01:55,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267255672] [2023-01-28 08:01:55,785 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 08:01:55,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:01:55,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:01:55,788 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:01:55,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-01-28 08:01:55,940 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-28 08:01:55,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:01:55,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 42 conjunts are in the unsatisfiable core [2023-01-28 08:01:55,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:01:55,953 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 6 [2023-01-28 08:01:56,071 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:01:56,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:01:56,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:01:56,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:01:56,183 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 12 [2023-01-28 08:01:56,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:01:56,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-01-28 08:01:56,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-01-28 08:01:56,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:01:56,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-01-28 08:01:56,377 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:01:56,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-01-28 08:01:56,450 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:01:56,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:01:56,648 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:01:56,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-01-28 08:01:56,665 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:01:56,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2023-01-28 08:01:56,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-01-28 08:02:23,016 WARN L839 $PredicateComparison]: unable to prove that (and (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((v_ArrVal_886 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_65| Int)) (or (< |v_t_funThread2of2ForFork0_~i~0#1_65| 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_65|) (forall ((v_ArrVal_891 Int) (|~#a~0.offset| Int) (|v_t_funThread1of2ForFork0_~i~0#1_75| Int)) (or (= |v_t_funThread2of2ForFork0_~i~0#1_65| |v_t_funThread1of2ForFork0_~i~0#1_75|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_886) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_65| 28) |~#a~0.offset|) v_ArrVal_891) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_75| 28) |~#a~0.offset|)) 0)))))) is different from false [2023-01-28 08:02:26,797 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-01-28 08:02:26,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267255672] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:02:26,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:02:26,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7, 7] total 30 [2023-01-28 08:02:26,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521468432] [2023-01-28 08:02:26,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:02:26,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-01-28 08:02:26,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:02:26,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-01-28 08:02:26,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=666, Unknown=7, NotChecked=58, Total=992 [2023-01-28 08:02:26,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 476 [2023-01-28 08:02:26,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 407 transitions, 4989 flow. Second operand has 32 states, 32 states have (on average 143.875) internal successors, (4604), 32 states have internal predecessors, (4604), 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) [2023-01-28 08:02:26,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:02:26,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 476 [2023-01-28 08:02:26,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:03:15,859 WARN L222 SmtUtils]: Spent 48.92s on a formula simplification. DAG size of input: 55 DAG size of output: 43 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:03:17,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:03:19,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:03:21,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:03:23,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:03:25,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:03:27,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:03:29,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:03:31,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:03:33,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:03:35,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 08:03:37,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:03:39,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:03:41,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:03:43,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 08:03:45,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:03:47,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:03:49,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:03:51,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:03:53,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:04:34,393 WARN L222 SmtUtils]: Spent 38.43s on a formula simplification. DAG size of input: 51 DAG size of output: 39 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:04:36,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:04:38,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:04:40,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:04:42,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:04:44,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:04:46,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:04:48,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:04:50,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 08:04:52,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:04:54,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:04:56,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:04:58,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:05:00,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:05:02,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:05:04,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:05:06,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:05:08,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:05:10,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:05:12,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 08:05:14,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:05:16,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:05:18,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:05:20,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 08:05:22,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:05:24,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:05:26,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:05:28,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:05:30,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:05:32,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:05:34,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:05:36,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:05:38,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:05:49,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:05:56,919 INFO L130 PetriNetUnfolder]: 19701/37634 cut-off events. [2023-01-28 08:05:56,920 INFO L131 PetriNetUnfolder]: For 352008/352028 co-relation queries the response was YES. [2023-01-28 08:05:57,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194750 conditions, 37634 events. 19701/37634 cut-off events. For 352008/352028 co-relation queries the response was YES. Maximal size of possible extension queue 1564. Compared 362258 event pairs, 4354 based on Foata normal form. 60/34477 useless extension candidates. Maximal degree in co-relation 192109. Up to 20182 conditions per place. [2023-01-28 08:05:57,219 INFO L137 encePairwiseOnDemand]: 454/476 looper letters, 466 selfloop transitions, 207 changer transitions 128/810 dead transitions. [2023-01-28 08:05:57,219 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 810 transitions, 10325 flow [2023-01-28 08:05:57,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-01-28 08:05:57,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-01-28 08:05:57,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 4551 transitions. [2023-01-28 08:05:57,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32968704723268616 [2023-01-28 08:05:57,223 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 4551 transitions. [2023-01-28 08:05:57,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 4551 transitions. [2023-01-28 08:05:57,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:05:57,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 4551 transitions. [2023-01-28 08:05:57,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 156.93103448275863) internal successors, (4551), 29 states have internal predecessors, (4551), 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) [2023-01-28 08:05:57,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 476.0) internal successors, (14280), 30 states have internal predecessors, (14280), 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) [2023-01-28 08:05:57,237 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 476.0) internal successors, (14280), 30 states have internal predecessors, (14280), 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) [2023-01-28 08:05:57,237 INFO L175 Difference]: Start difference. First operand has 222 places, 407 transitions, 4989 flow. Second operand 29 states and 4551 transitions. [2023-01-28 08:05:57,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 810 transitions, 10325 flow [2023-01-28 08:05:59,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 810 transitions, 9847 flow, removed 199 selfloop flow, removed 6 redundant places. [2023-01-28 08:05:59,410 INFO L231 Difference]: Finished difference. Result has 252 places, 479 transitions, 6522 flow [2023-01-28 08:05:59,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=4701, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=6522, PETRI_PLACES=252, PETRI_TRANSITIONS=479} [2023-01-28 08:05:59,410 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 184 predicate places. [2023-01-28 08:05:59,410 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 479 transitions, 6522 flow [2023-01-28 08:05:59,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 143.875) internal successors, (4604), 32 states have internal predecessors, (4604), 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) [2023-01-28 08:05:59,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:05:59,411 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:05:59,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-01-28 08:05:59,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:05:59,615 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:05:59,616 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:05:59,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1477902326, now seen corresponding path program 4 times [2023-01-28 08:05:59,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:05:59,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415194336] [2023-01-28 08:05:59,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:05:59,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:05:59,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:06:02,136 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 08:06:02,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:06:02,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415194336] [2023-01-28 08:06:02,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415194336] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:06:02,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187431318] [2023-01-28 08:06:02,136 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-28 08:06:02,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:06:02,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:06:02,141 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:06:02,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-01-28 08:06:02,249 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-28 08:06:02,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:06:02,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 42 conjunts are in the unsatisfiable core [2023-01-28 08:06:02,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:06:02,257 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 6 [2023-01-28 08:06:02,347 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:06:02,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:06:02,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:06:02,395 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 12 [2023-01-28 08:06:02,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:06:02,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-01-28 08:06:02,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-01-28 08:06:02,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:06:02,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-01-28 08:06:02,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-01-28 08:06:02,648 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:06:02,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-01-28 08:06:02,708 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 08:06:02,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:06:02,819 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_67| Int)) (let ((.cse0 (* |v_t_funThread2of2ForFork0_~i~0#1_67| 28))) (or (< |v_t_funThread2of2ForFork0_~i~0#1_67| 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_978) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse0)) 0)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_979) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0)) 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_67|)))) is different from false [2023-01-28 08:06:02,944 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:06:02,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-01-28 08:06:02,950 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:06:02,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2023-01-28 08:06:02,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-01-28 08:06:04,982 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread1of2ForFork0_~i~0#1_77| Int) (v_ArrVal_979 (Array Int Int)) (|~#a~0.offset| Int) (|v_t_funThread2of2ForFork0_~i~0#1_67| Int) (v_ArrVal_976 Int)) (or (< |v_t_funThread2of2ForFork0_~i~0#1_67| 0) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 (+ (* |v_t_funThread1of2ForFork0_~i~0#1_77| 28) |~#a~0.offset|) v_ArrVal_976)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_979) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_67| 28) |~#a~0.offset|)) 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_67|)))) (forall ((|v_t_funThread2of2ForFork0_~i~0#1_67| Int)) (or (< |v_t_funThread2of2ForFork0_~i~0#1_67| 0) (forall ((|v_t_funThread1of2ForFork0_~i~0#1_77| Int) (v_ArrVal_979 (Array Int Int)) (|~#a~0.offset| Int) (v_ArrVal_976 Int)) (or (= |v_t_funThread2of2ForFork0_~i~0#1_67| |v_t_funThread1of2ForFork0_~i~0#1_77|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 (+ (* |v_t_funThread1of2ForFork0_~i~0#1_77| 28) |~#a~0.offset|) v_ArrVal_976)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_979) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_67| 28) |~#a~0.offset|)) 0))) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_67|))))) is different from false [2023-01-28 08:06:07,031 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread2of2ForFork0_~i~0#1_67| Int) (v_ArrVal_972 (Array Int Int))) (or (< |v_t_funThread2of2ForFork0_~i~0#1_67| 0) (forall ((|v_t_funThread1of2ForFork0_~i~0#1_77| Int) (v_ArrVal_979 (Array Int Int)) (|~#a~0.offset| Int) (v_ArrVal_976 Int)) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_972))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_77| 28) |~#a~0.offset|) v_ArrVal_976))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_979) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_67| 28) |~#a~0.offset|)) 0) (= |v_t_funThread2of2ForFork0_~i~0#1_67| |v_t_funThread1of2ForFork0_~i~0#1_77|))) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_67|))) (or (forall ((|v_t_funThread1of2ForFork0_~i~0#1_77| Int) (v_ArrVal_979 (Array Int Int)) (|~#a~0.offset| Int) (|v_t_funThread2of2ForFork0_~i~0#1_67| Int) (v_ArrVal_976 Int) (v_ArrVal_972 (Array Int Int))) (or (< |v_t_funThread2of2ForFork0_~i~0#1_67| 0) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_972))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_77| 28) |~#a~0.offset|) v_ArrVal_976))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_979) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_67| 28) |~#a~0.offset|)) 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_67|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2023-01-28 08:06:14,048 WARN L222 SmtUtils]: Spent 6.90s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:06:14,466 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-01-28 08:06:14,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187431318] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:06:14,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:06:14,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7, 8] total 32 [2023-01-28 08:06:14,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38209091] [2023-01-28 08:06:14,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:06:14,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-01-28 08:06:14,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:06:14,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-01-28 08:06:14,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=747, Unknown=5, NotChecked=180, Total=1122 [2023-01-28 08:06:14,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 476 [2023-01-28 08:06:14,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 479 transitions, 6522 flow. Second operand has 34 states, 34 states have (on average 141.76470588235293) internal successors, (4820), 34 states have internal predecessors, (4820), 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) [2023-01-28 08:06:14,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:06:14,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 476 [2023-01-28 08:06:14,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:06:15,882 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (forall ((|v_t_funThread2of2ForFork0_~i~0#1_67| Int)) (let ((.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_67| 28))) (or (< |v_t_funThread2of2ForFork0_~i~0#1_67| 0) (= (select .cse0 (+ |c_~#a~0.offset| .cse1)) 0) (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse1)) 0)) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_67|)))) (forall ((v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_67| Int) (v_ArrVal_976 Int)) (let ((.cse2 (* |v_t_funThread2of2ForFork0_~i~0#1_67| 28))) (or (< |v_t_funThread2of2ForFork0_~i~0#1_67| 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_978) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse2)) 0)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|) v_ArrVal_976)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_979) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse2)) 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_67|)))))) is different from false [2023-01-28 08:06:20,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:06:23,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:06:30,185 INFO L130 PetriNetUnfolder]: 20672/39658 cut-off events. [2023-01-28 08:06:30,185 INFO L131 PetriNetUnfolder]: For 429241/429349 co-relation queries the response was YES. [2023-01-28 08:06:30,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216044 conditions, 39658 events. 20672/39658 cut-off events. For 429241/429349 co-relation queries the response was YES. Maximal size of possible extension queue 1744. Compared 387425 event pairs, 3675 based on Foata normal form. 68/36268 useless extension candidates. Maximal degree in co-relation 213357. Up to 20368 conditions per place. [2023-01-28 08:06:30,846 INFO L137 encePairwiseOnDemand]: 437/476 looper letters, 558 selfloop transitions, 318 changer transitions 217/1102 dead transitions. [2023-01-28 08:06:30,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 1102 transitions, 14721 flow [2023-01-28 08:06:30,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-01-28 08:06:30,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-01-28 08:06:30,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 5911 transitions. [2023-01-28 08:06:30,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32679124281291466 [2023-01-28 08:06:30,877 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 5911 transitions. [2023-01-28 08:06:30,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 5911 transitions. [2023-01-28 08:06:30,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:06:30,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 5911 transitions. [2023-01-28 08:06:30,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 155.55263157894737) internal successors, (5911), 38 states have internal predecessors, (5911), 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) [2023-01-28 08:06:30,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 476.0) internal successors, (18564), 39 states have internal predecessors, (18564), 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) [2023-01-28 08:06:30,891 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 476.0) internal successors, (18564), 39 states have internal predecessors, (18564), 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) [2023-01-28 08:06:30,892 INFO L175 Difference]: Start difference. First operand has 252 places, 479 transitions, 6522 flow. Second operand 38 states and 5911 transitions. [2023-01-28 08:06:30,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 1102 transitions, 14721 flow [2023-01-28 08:06:37,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 1102 transitions, 14131 flow, removed 225 selfloop flow, removed 16 redundant places. [2023-01-28 08:06:37,624 INFO L231 Difference]: Finished difference. Result has 290 places, 608 transitions, 8997 flow [2023-01-28 08:06:37,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=6036, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=217, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=8997, PETRI_PLACES=290, PETRI_TRANSITIONS=608} [2023-01-28 08:06:37,625 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 222 predicate places. [2023-01-28 08:06:37,625 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 608 transitions, 8997 flow [2023-01-28 08:06:37,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 141.76470588235293) internal successors, (4820), 34 states have internal predecessors, (4820), 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) [2023-01-28 08:06:37,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:06:37,626 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:06:37,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-01-28 08:06:37,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:06:37,830 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:06:37,831 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:06:37,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1230310307, now seen corresponding path program 1 times [2023-01-28 08:06:37,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:06:37,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890668955] [2023-01-28 08:06:37,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:06:37,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:06:37,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:06:37,920 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 08:06:37,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:06:37,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890668955] [2023-01-28 08:06:37,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890668955] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:06:37,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731820058] [2023-01-28 08:06:37,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:06:37,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:06:37,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:06:37,922 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:06:37,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-01-28 08:06:38,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:06:38,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-28 08:06:38,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:06:38,069 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 08:06:38,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:06:38,097 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 08:06:38,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731820058] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:06:38,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:06:38,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2023-01-28 08:06:38,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638243093] [2023-01-28 08:06:38,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:06:38,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-28 08:06:38,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:06:38,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-28 08:06:38,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2023-01-28 08:06:38,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 476 [2023-01-28 08:06:38,100 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 608 transitions, 8997 flow. Second operand has 9 states, 9 states have (on average 210.66666666666666) internal successors, (1896), 9 states have internal predecessors, (1896), 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) [2023-01-28 08:06:38,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:06:38,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 476 [2023-01-28 08:06:38,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:06:39,263 INFO L130 PetriNetUnfolder]: 2626/5575 cut-off events. [2023-01-28 08:06:39,263 INFO L131 PetriNetUnfolder]: For 106587/106702 co-relation queries the response was YES. [2023-01-28 08:06:39,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36240 conditions, 5575 events. 2626/5575 cut-off events. For 106587/106702 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 46549 event pairs, 251 based on Foata normal form. 831/6095 useless extension candidates. Maximal degree in co-relation 36151. Up to 3779 conditions per place. [2023-01-28 08:06:39,314 INFO L137 encePairwiseOnDemand]: 473/476 looper letters, 262 selfloop transitions, 6 changer transitions 307/584 dead transitions. [2023-01-28 08:06:39,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 584 transitions, 9470 flow [2023-01-28 08:06:39,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 08:06:39,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 08:06:39,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1118 transitions. [2023-01-28 08:06:39,315 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46974789915966386 [2023-01-28 08:06:39,316 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1118 transitions. [2023-01-28 08:06:39,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1118 transitions. [2023-01-28 08:06:39,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:06:39,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1118 transitions. [2023-01-28 08:06:39,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 223.6) internal successors, (1118), 5 states have internal predecessors, (1118), 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) [2023-01-28 08:06:39,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 476.0) internal successors, (2856), 6 states have internal predecessors, (2856), 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) [2023-01-28 08:06:39,319 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 476.0) internal successors, (2856), 6 states have internal predecessors, (2856), 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) [2023-01-28 08:06:39,319 INFO L175 Difference]: Start difference. First operand has 290 places, 608 transitions, 8997 flow. Second operand 5 states and 1118 transitions. [2023-01-28 08:06:39,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 584 transitions, 9470 flow [2023-01-28 08:06:39,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 584 transitions, 8094 flow, removed 525 selfloop flow, removed 40 redundant places. [2023-01-28 08:06:39,808 INFO L231 Difference]: Finished difference. Result has 212 places, 178 transitions, 1854 flow [2023-01-28 08:06:39,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=3857, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1854, PETRI_PLACES=212, PETRI_TRANSITIONS=178} [2023-01-28 08:06:39,808 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 144 predicate places. [2023-01-28 08:06:39,808 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 178 transitions, 1854 flow [2023-01-28 08:06:39,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 210.66666666666666) internal successors, (1896), 9 states have internal predecessors, (1896), 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) [2023-01-28 08:06:39,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:06:39,809 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:06:39,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-01-28 08:06:40,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:06:40,010 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:06:40,010 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:06:40,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1780543730, now seen corresponding path program 5 times [2023-01-28 08:06:40,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:06:40,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68016670] [2023-01-28 08:06:40,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:06:40,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:06:40,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:06:40,886 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 08:06:40,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:06:40,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68016670] [2023-01-28 08:06:40,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68016670] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:06:40,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961548779] [2023-01-28 08:06:40,887 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-28 08:06:40,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:06:40,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:06:40,888 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:06:40,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-01-28 08:06:41,270 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-01-28 08:06:41,271 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:06:41,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 42 conjunts are in the unsatisfiable core [2023-01-28 08:06:41,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:06:41,297 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 6 [2023-01-28 08:06:41,385 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:06:41,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:06:41,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:06:41,426 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 12 [2023-01-28 08:06:41,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:06:41,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-01-28 08:06:41,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:06:41,564 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:06:41,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-01-28 08:06:41,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-01-28 08:06:41,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-01-28 08:06:41,687 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 08:06:41,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:06:41,934 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:06:41,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-01-28 08:06:41,940 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:06:41,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2023-01-28 08:06:41,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-01-28 08:06:44,000 WARN L839 $PredicateComparison]: unable to prove that (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread2of2ForFork0_~i~0#1_71| Int) (v_ArrVal_1151 Int) (v_ArrVal_1149 (Array Int Int)) (|~#a~0.offset| Int) (|v_t_funThread1of2ForFork0_~i~0#1_81| Int) (v_ArrVal_1152 (Array Int Int))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1149))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_81| 28) |~#a~0.offset|) v_ArrVal_1151))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1152) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_71| 28) |~#a~0.offset|)) 0) (< |v_t_funThread1of2ForFork0_~i~0#1_81| 0) (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_81|)))) (forall ((|v_t_funThread1of2ForFork0_~i~0#1_81| Int)) (or (< |v_t_funThread1of2ForFork0_~i~0#1_81| 0) (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_81|) (forall ((|v_t_funThread2of2ForFork0_~i~0#1_71| Int) (v_ArrVal_1151 Int) (v_ArrVal_1149 (Array Int Int)) (|~#a~0.offset| Int) (v_ArrVal_1152 (Array Int Int))) (or (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1149))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_81| 28) |~#a~0.offset|) v_ArrVal_1151))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1152) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_71| 28) |~#a~0.offset|)) 0) (= |v_t_funThread2of2ForFork0_~i~0#1_71| |v_t_funThread1of2ForFork0_~i~0#1_81|)))))) is different from false [2023-01-28 08:06:52,148 WARN L222 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:06:52,533 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 3 not checked. [2023-01-28 08:06:52,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961548779] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:06:52,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:06:52,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 8] total 25 [2023-01-28 08:06:52,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291353750] [2023-01-28 08:06:52,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:06:52,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-01-28 08:06:52,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:06:52,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-01-28 08:06:52,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=511, Unknown=7, NotChecked=48, Total=702 [2023-01-28 08:06:52,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 476 [2023-01-28 08:06:52,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 178 transitions, 1854 flow. Second operand has 27 states, 27 states have (on average 144.22222222222223) internal successors, (3894), 27 states have internal predecessors, (3894), 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) [2023-01-28 08:06:52,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:06:52,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 476 [2023-01-28 08:06:52,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:06:53,434 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|))) (and (forall ((v_ArrVal_1151 Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) .cse0 v_ArrVal_1151)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1152) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) 0)) (forall ((|v_t_funThread2of2ForFork0_~i~0#1_71| Int) (v_ArrVal_1151 Int) (v_ArrVal_1149 (Array Int Int)) (v_ArrVal_1148 (Array Int Int)) (v_ArrVal_1152 (Array Int Int))) (let ((.cse2 (* |v_t_funThread2of2ForFork0_~i~0#1_71| 28))) (or (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1149))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) .cse0 v_ArrVal_1151))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1152) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse2)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1148) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse2 4)) 0))))))) is different from false [2023-01-28 08:06:55,115 INFO L130 PetriNetUnfolder]: 1491/3165 cut-off events. [2023-01-28 08:06:55,115 INFO L131 PetriNetUnfolder]: For 30611/30643 co-relation queries the response was YES. [2023-01-28 08:06:55,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16965 conditions, 3165 events. 1491/3165 cut-off events. For 30611/30643 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 23997 event pairs, 187 based on Foata normal form. 21/2887 useless extension candidates. Maximal degree in co-relation 16896. Up to 1551 conditions per place. [2023-01-28 08:06:55,140 INFO L137 encePairwiseOnDemand]: 462/476 looper letters, 162 selfloop transitions, 32 changer transitions 129/329 dead transitions. [2023-01-28 08:06:55,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 329 transitions, 3970 flow [2023-01-28 08:06:55,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-01-28 08:06:55,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-01-28 08:06:55,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2864 transitions. [2023-01-28 08:06:55,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31667403803626715 [2023-01-28 08:06:55,143 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2864 transitions. [2023-01-28 08:06:55,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2864 transitions. [2023-01-28 08:06:55,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:06:55,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2864 transitions. [2023-01-28 08:06:55,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 150.73684210526315) internal successors, (2864), 19 states have internal predecessors, (2864), 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) [2023-01-28 08:06:55,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 476.0) internal successors, (9520), 20 states have internal predecessors, (9520), 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) [2023-01-28 08:06:55,154 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 476.0) internal successors, (9520), 20 states have internal predecessors, (9520), 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) [2023-01-28 08:06:55,154 INFO L175 Difference]: Start difference. First operand has 212 places, 178 transitions, 1854 flow. Second operand 19 states and 2864 transitions. [2023-01-28 08:06:55,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 329 transitions, 3970 flow [2023-01-28 08:06:55,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 329 transitions, 3407 flow, removed 118 selfloop flow, removed 35 redundant places. [2023-01-28 08:06:55,256 INFO L231 Difference]: Finished difference. Result has 186 places, 167 transitions, 1467 flow [2023-01-28 08:06:55,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1455, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1467, PETRI_PLACES=186, PETRI_TRANSITIONS=167} [2023-01-28 08:06:55,257 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 118 predicate places. [2023-01-28 08:06:55,257 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 167 transitions, 1467 flow [2023-01-28 08:06:55,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 144.22222222222223) internal successors, (3894), 27 states have internal predecessors, (3894), 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) [2023-01-28 08:06:55,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:06:55,257 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:06:55,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-01-28 08:06:55,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:06:55,463 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:06:55,463 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:06:55,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1603886776, now seen corresponding path program 4 times [2023-01-28 08:06:55,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:06:55,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030802376] [2023-01-28 08:06:55,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:06:55,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:06:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:06:55,818 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:06:55,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:06:55,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030802376] [2023-01-28 08:06:55,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030802376] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:06:55,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157765165] [2023-01-28 08:06:55,819 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-28 08:06:55,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:06:55,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:06:55,820 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:06:55,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-01-28 08:06:55,935 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-28 08:06:55,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:06:55,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 40 conjunts are in the unsatisfiable core [2023-01-28 08:06:55,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:06:55,940 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 6 [2023-01-28 08:06:55,992 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:06:55,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:06:56,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:06:56,026 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 12 [2023-01-28 08:06:56,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:06:56,096 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:06:56,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-01-28 08:06:56,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-01-28 08:06:56,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-01-28 08:06:56,233 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:06:56,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:06:56,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2023-01-28 08:06:56,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2023-01-28 08:06:58,419 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1241 Int) (|v_t_funThread2of2ForFork0_~i~0#1_73| Int) (|~#a~0.offset| Int) (v_ArrVal_1242 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_83| Int)) (or (< |v_t_funThread2of2ForFork0_~i~0#1_73| 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_73|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_73| 28) |~#a~0.offset|) v_ArrVal_1241)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1242) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_83| 28) |~#a~0.offset|)) 0) (= |v_t_funThread2of2ForFork0_~i~0#1_73| |v_t_funThread1of2ForFork0_~i~0#1_83|))) is different from false [2023-01-28 08:07:00,452 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1236 (Array Int Int)) (v_ArrVal_1241 Int) (|v_t_funThread2of2ForFork0_~i~0#1_73| Int) (|~#a~0.offset| Int) (v_ArrVal_1242 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_83| Int)) (or (< |v_t_funThread2of2ForFork0_~i~0#1_73| 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_73|) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1236))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_73| 28) |~#a~0.offset|) v_ArrVal_1241))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1242) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_83| 28) |~#a~0.offset|)) 0) (= |v_t_funThread2of2ForFork0_~i~0#1_73| |v_t_funThread1of2ForFork0_~i~0#1_83|))) is different from false [2023-01-28 08:07:00,664 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 4 not checked. [2023-01-28 08:07:00,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157765165] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:07:00,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:07:00,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 19 [2023-01-28 08:07:00,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119789077] [2023-01-28 08:07:00,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:07:00,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-01-28 08:07:00,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:07:00,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-01-28 08:07:00,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=252, Unknown=6, NotChecked=70, Total=420 [2023-01-28 08:07:00,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 476 [2023-01-28 08:07:00,667 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 167 transitions, 1467 flow. Second operand has 21 states, 21 states have (on average 149.66666666666666) internal successors, (3143), 21 states have internal predecessors, (3143), 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) [2023-01-28 08:07:00,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:07:00,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 476 [2023-01-28 08:07:00,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:07:01,362 INFO L130 PetriNetUnfolder]: 1163/2479 cut-off events. [2023-01-28 08:07:01,362 INFO L131 PetriNetUnfolder]: For 15414/15444 co-relation queries the response was YES. [2023-01-28 08:07:01,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12611 conditions, 2479 events. 1163/2479 cut-off events. For 15414/15444 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 17730 event pairs, 235 based on Foata normal form. 11/2354 useless extension candidates. Maximal degree in co-relation 12546. Up to 1560 conditions per place. [2023-01-28 08:07:01,378 INFO L137 encePairwiseOnDemand]: 467/476 looper letters, 151 selfloop transitions, 11 changer transitions 50/218 dead transitions. [2023-01-28 08:07:01,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 218 transitions, 2260 flow [2023-01-28 08:07:01,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 08:07:01,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 08:07:01,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1419 transitions. [2023-01-28 08:07:01,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33123249299719887 [2023-01-28 08:07:01,380 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1419 transitions. [2023-01-28 08:07:01,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1419 transitions. [2023-01-28 08:07:01,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:07:01,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1419 transitions. [2023-01-28 08:07:01,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 157.66666666666666) internal successors, (1419), 9 states have internal predecessors, (1419), 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) [2023-01-28 08:07:01,383 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 476.0) internal successors, (4760), 10 states have internal predecessors, (4760), 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) [2023-01-28 08:07:01,383 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 476.0) internal successors, (4760), 10 states have internal predecessors, (4760), 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) [2023-01-28 08:07:01,383 INFO L175 Difference]: Start difference. First operand has 186 places, 167 transitions, 1467 flow. Second operand 9 states and 1419 transitions. [2023-01-28 08:07:01,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 218 transitions, 2260 flow [2023-01-28 08:07:01,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 218 transitions, 2146 flow, removed 55 selfloop flow, removed 14 redundant places. [2023-01-28 08:07:01,425 INFO L231 Difference]: Finished difference. Result has 171 places, 158 transitions, 1306 flow [2023-01-28 08:07:01,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1359, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1306, PETRI_PLACES=171, PETRI_TRANSITIONS=158} [2023-01-28 08:07:01,426 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 103 predicate places. [2023-01-28 08:07:01,426 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 158 transitions, 1306 flow [2023-01-28 08:07:01,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 149.66666666666666) internal successors, (3143), 21 states have internal predecessors, (3143), 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) [2023-01-28 08:07:01,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:07:01,426 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:07:01,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-01-28 08:07:01,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-01-28 08:07:01,631 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:07:01,632 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:07:01,632 INFO L85 PathProgramCache]: Analyzing trace with hash -8580036, now seen corresponding path program 6 times [2023-01-28 08:07:01,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:07:01,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928865694] [2023-01-28 08:07:01,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:07:01,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:07:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:07:01,900 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-01-28 08:07:01,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:07:01,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928865694] [2023-01-28 08:07:01,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928865694] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:07:01,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712249357] [2023-01-28 08:07:01,900 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-28 08:07:01,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:07:01,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:07:01,901 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:07:01,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-01-28 08:07:02,255 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-01-28 08:07:02,255 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:07:02,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 40 conjunts are in the unsatisfiable core [2023-01-28 08:07:02,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:07:02,262 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 6 [2023-01-28 08:07:02,318 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:07:02,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:07:02,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:07:02,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:07:02,403 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 12 [2023-01-28 08:07:02,443 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:07:02,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-01-28 08:07:02,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-01-28 08:07:02,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-01-28 08:07:02,579 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-01-28 08:07:02,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:07:02,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 63 [2023-01-28 08:07:02,712 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:07:02,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 48 [2023-01-28 08:07:04,838 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-01-28 08:07:04,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712249357] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:07:04,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:07:04,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2023-01-28 08:07:04,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276076196] [2023-01-28 08:07:04,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:07:04,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-01-28 08:07:04,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:07:04,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-01-28 08:07:04,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2023-01-28 08:07:04,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 476 [2023-01-28 08:07:04,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 158 transitions, 1306 flow. Second operand has 17 states, 17 states have (on average 148.58823529411765) internal successors, (2526), 17 states have internal predecessors, (2526), 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) [2023-01-28 08:07:04,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:07:04,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 476 [2023-01-28 08:07:04,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:07:05,619 INFO L130 PetriNetUnfolder]: 950/2092 cut-off events. [2023-01-28 08:07:05,619 INFO L131 PetriNetUnfolder]: For 11727/11757 co-relation queries the response was YES. [2023-01-28 08:07:05,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10553 conditions, 2092 events. 950/2092 cut-off events. For 11727/11757 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 14793 event pairs, 221 based on Foata normal form. 9/2011 useless extension candidates. Maximal degree in co-relation 10496. Up to 1318 conditions per place. [2023-01-28 08:07:05,631 INFO L137 encePairwiseOnDemand]: 466/476 looper letters, 140 selfloop transitions, 8 changer transitions 63/217 dead transitions. [2023-01-28 08:07:05,631 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 217 transitions, 2243 flow [2023-01-28 08:07:05,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-28 08:07:05,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-01-28 08:07:05,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1554 transitions. [2023-01-28 08:07:05,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3264705882352941 [2023-01-28 08:07:05,633 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1554 transitions. [2023-01-28 08:07:05,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1554 transitions. [2023-01-28 08:07:05,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:07:05,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1554 transitions. [2023-01-28 08:07:05,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 155.4) internal successors, (1554), 10 states have internal predecessors, (1554), 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) [2023-01-28 08:07:05,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 476.0) internal successors, (5236), 11 states have internal predecessors, (5236), 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) [2023-01-28 08:07:05,637 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 476.0) internal successors, (5236), 11 states have internal predecessors, (5236), 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) [2023-01-28 08:07:05,637 INFO L175 Difference]: Start difference. First operand has 171 places, 158 transitions, 1306 flow. Second operand 10 states and 1554 transitions. [2023-01-28 08:07:05,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 217 transitions, 2243 flow [2023-01-28 08:07:05,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 217 transitions, 2161 flow, removed 24 selfloop flow, removed 14 redundant places. [2023-01-28 08:07:05,662 INFO L231 Difference]: Finished difference. Result has 160 places, 146 transitions, 1134 flow [2023-01-28 08:07:05,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1232, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1134, PETRI_PLACES=160, PETRI_TRANSITIONS=146} [2023-01-28 08:07:05,663 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 92 predicate places. [2023-01-28 08:07:05,663 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 146 transitions, 1134 flow [2023-01-28 08:07:05,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 148.58823529411765) internal successors, (2526), 17 states have internal predecessors, (2526), 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) [2023-01-28 08:07:05,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:07:05,663 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:07:05,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2023-01-28 08:07:05,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-01-28 08:07:05,869 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:07:05,869 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:07:05,869 INFO L85 PathProgramCache]: Analyzing trace with hash -792221384, now seen corresponding path program 5 times [2023-01-28 08:07:05,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:07:05,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870470510] [2023-01-28 08:07:05,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:07:05,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:07:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:07:06,380 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-01-28 08:07:06,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:07:06,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870470510] [2023-01-28 08:07:06,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870470510] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:07:06,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073378917] [2023-01-28 08:07:06,381 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-28 08:07:06,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:07:06,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:07:06,382 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:07:06,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-01-28 08:07:06,625 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-01-28 08:07:06,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:07:06,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 42 conjunts are in the unsatisfiable core [2023-01-28 08:07:06,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:07:06,634 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 6 [2023-01-28 08:07:06,707 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:07:06,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:07:06,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:07:06,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:07:06,782 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 12 [2023-01-28 08:07:06,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:07:06,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-01-28 08:07:06,861 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:07:06,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-01-28 08:07:06,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-01-28 08:07:06,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-01-28 08:07:06,978 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-01-28 08:07:06,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:07:06,983 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1423 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1423) |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) is different from false [2023-01-28 08:07:07,115 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~i~0#1_87| Int) (v_ArrVal_1423 (Array Int Int)) (v_ArrVal_1420 (Array Int Int)) (v_ArrVal_1421 Int)) (let ((.cse0 (* |v_t_funThread1of2ForFork0_~i~0#1_87| 28))) (or (< |v_t_funThread1of2ForFork0_~i~0#1_87| 0) (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_87|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)) v_ArrVal_1421)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1423) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0)) 0) (not (= 0 (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1420) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse0))))))) is different from false [2023-01-28 08:07:07,145 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:07:07,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-01-28 08:07:07,153 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:07:07,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2023-01-28 08:07:07,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-01-28 08:07:07,198 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread1of2ForFork0_~i~0#1_87| Int) (v_ArrVal_1423 (Array Int Int)) (|~#a~0.offset| Int) (v_ArrVal_1421 Int) (|v_t_funThread2of2ForFork0_~i~0#1_77| Int)) (or (< |v_t_funThread1of2ForFork0_~i~0#1_87| 0) (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_87|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 (+ (* |v_t_funThread2of2ForFork0_~i~0#1_77| 28) |~#a~0.offset|) v_ArrVal_1421)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1423) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_87| 28) |~#a~0.offset|)) 0)))) (forall ((|v_t_funThread1of2ForFork0_~i~0#1_87| Int)) (or (< |v_t_funThread1of2ForFork0_~i~0#1_87| 0) (forall ((v_ArrVal_1423 (Array Int Int)) (|~#a~0.offset| Int) (v_ArrVal_1421 Int) (|v_t_funThread2of2ForFork0_~i~0#1_77| Int)) (or (= |v_t_funThread2of2ForFork0_~i~0#1_77| |v_t_funThread1of2ForFork0_~i~0#1_87|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 (+ (* |v_t_funThread2of2ForFork0_~i~0#1_77| 28) |~#a~0.offset|) v_ArrVal_1421)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1423) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_87| 28) |~#a~0.offset|)) 0))) (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_87|))))) is different from false [2023-01-28 08:07:09,283 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((|v_t_funThread1of2ForFork0_~i~0#1_87| Int) (v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1423 (Array Int Int)) (|~#a~0.offset| Int) (v_ArrVal_1421 Int) (|v_t_funThread2of2ForFork0_~i~0#1_77| Int)) (or (< |v_t_funThread1of2ForFork0_~i~0#1_87| 0) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1417))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_77| 28) |~#a~0.offset|) v_ArrVal_1421))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1423) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_87| 28) |~#a~0.offset|)) 0) (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_87|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((v_ArrVal_1417 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_87| Int)) (or (< |v_t_funThread1of2ForFork0_~i~0#1_87| 0) (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_87|) (forall ((v_ArrVal_1423 (Array Int Int)) (|~#a~0.offset| Int) (v_ArrVal_1421 Int) (|v_t_funThread2of2ForFork0_~i~0#1_77| Int)) (or (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1417))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_77| 28) |~#a~0.offset|) v_ArrVal_1421))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1423) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_87| 28) |~#a~0.offset|)) 0) (= |v_t_funThread2of2ForFork0_~i~0#1_77| |v_t_funThread1of2ForFork0_~i~0#1_87|)))))) is different from false [2023-01-28 08:07:16,533 WARN L222 SmtUtils]: Spent 7.09s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:07:16,882 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-01-28 08:07:16,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073378917] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:07:16,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:07:16,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 23 [2023-01-28 08:07:16,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105873429] [2023-01-28 08:07:16,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:07:16,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-01-28 08:07:16,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:07:16,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-01-28 08:07:16,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=332, Unknown=7, NotChecked=164, Total=600 [2023-01-28 08:07:16,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 476 [2023-01-28 08:07:16,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 146 transitions, 1134 flow. Second operand has 25 states, 25 states have (on average 147.2) internal successors, (3680), 25 states have internal predecessors, (3680), 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) [2023-01-28 08:07:16,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:07:16,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 476 [2023-01-28 08:07:16,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:07:18,744 INFO L130 PetriNetUnfolder]: 887/2008 cut-off events. [2023-01-28 08:07:18,744 INFO L131 PetriNetUnfolder]: For 9337/9369 co-relation queries the response was YES. [2023-01-28 08:07:18,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9328 conditions, 2008 events. 887/2008 cut-off events. For 9337/9369 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 14378 event pairs, 255 based on Foata normal form. 15/1907 useless extension candidates. Maximal degree in co-relation 9276. Up to 1040 conditions per place. [2023-01-28 08:07:18,755 INFO L137 encePairwiseOnDemand]: 460/476 looper letters, 124 selfloop transitions, 12 changer transitions 90/232 dead transitions. [2023-01-28 08:07:18,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 232 transitions, 2147 flow [2023-01-28 08:07:18,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-28 08:07:18,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-01-28 08:07:18,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2594 transitions. [2023-01-28 08:07:18,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32056351952545725 [2023-01-28 08:07:18,757 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2594 transitions. [2023-01-28 08:07:18,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2594 transitions. [2023-01-28 08:07:18,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:07:18,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2594 transitions. [2023-01-28 08:07:18,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 152.58823529411765) internal successors, (2594), 17 states have internal predecessors, (2594), 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) [2023-01-28 08:07:18,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 476.0) internal successors, (8568), 18 states have internal predecessors, (8568), 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) [2023-01-28 08:07:18,763 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 476.0) internal successors, (8568), 18 states have internal predecessors, (8568), 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) [2023-01-28 08:07:18,763 INFO L175 Difference]: Start difference. First operand has 160 places, 146 transitions, 1134 flow. Second operand 17 states and 2594 transitions. [2023-01-28 08:07:18,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 232 transitions, 2147 flow [2023-01-28 08:07:18,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 232 transitions, 2102 flow, removed 11 selfloop flow, removed 10 redundant places. [2023-01-28 08:07:18,787 INFO L231 Difference]: Finished difference. Result has 165 places, 134 transitions, 1052 flow [2023-01-28 08:07:18,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1091, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1052, PETRI_PLACES=165, PETRI_TRANSITIONS=134} [2023-01-28 08:07:18,787 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 97 predicate places. [2023-01-28 08:07:18,787 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 134 transitions, 1052 flow [2023-01-28 08:07:18,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 147.2) internal successors, (3680), 25 states have internal predecessors, (3680), 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) [2023-01-28 08:07:18,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:07:18,788 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:07:18,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-01-28 08:07:18,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-01-28 08:07:18,994 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:07:18,994 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:07:18,994 INFO L85 PathProgramCache]: Analyzing trace with hash -858990792, now seen corresponding path program 6 times [2023-01-28 08:07:18,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:07:18,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115423819] [2023-01-28 08:07:18,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:07:18,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:07:19,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:07:19,487 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-01-28 08:07:19,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:07:19,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115423819] [2023-01-28 08:07:19,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115423819] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:07:19,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186173979] [2023-01-28 08:07:19,488 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-28 08:07:19,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:07:19,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:07:19,489 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:07:19,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-01-28 08:07:19,794 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-01-28 08:07:19,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:07:19,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 43 conjunts are in the unsatisfiable core [2023-01-28 08:07:19,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:07:19,803 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 6 [2023-01-28 08:07:19,895 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:07:19,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:07:19,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:07:19,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:07:19,979 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 12 [2023-01-28 08:07:20,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:07:20,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-01-28 08:07:20,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-01-28 08:07:20,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:07:20,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-01-28 08:07:20,155 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:07:20,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-01-28 08:07:20,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-01-28 08:07:20,275 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-01-28 08:07:20,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:07:20,281 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1515 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1515) |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) is different from false [2023-01-28 08:07:20,322 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1515 (Array Int Int)) (v_ArrVal_1514 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_89| Int)) (let ((.cse0 (* |v_t_funThread1of2ForFork0_~i~0#1_89| 28))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1515) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1514) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse0)) 0))))) is different from false [2023-01-28 08:07:20,390 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:07:20,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-01-28 08:07:20,399 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:07:20,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2023-01-28 08:07:20,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-01-28 08:07:22,447 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (forall ((|v_t_funThread2of2ForFork0_~i~0#1_79| Int)) (or (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_79|) (< |v_t_funThread2of2ForFork0_~i~0#1_79| 0) (forall ((v_ArrVal_1515 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_89| Int) (|~#a~0.offset| Int) (v_ArrVal_1512 Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 (+ (* |v_t_funThread2of2ForFork0_~i~0#1_79| 28) |~#a~0.offset|) v_ArrVal_1512)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1515) |c_~#a~0.base|) (+ |~#a~0.offset| (* |v_t_funThread1of2ForFork0_~i~0#1_89| 28))) 0) (= |v_t_funThread2of2ForFork0_~i~0#1_79| |v_t_funThread1of2ForFork0_~i~0#1_89|))))) (or (forall ((v_ArrVal_1515 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_89| Int) (|v_t_funThread2of2ForFork0_~i~0#1_79| Int) (|~#a~0.offset| Int) (v_ArrVal_1512 Int)) (or (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_79|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 (+ (* |v_t_funThread2of2ForFork0_~i~0#1_79| 28) |~#a~0.offset|) v_ArrVal_1512)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1515) |c_~#a~0.base|) (+ |~#a~0.offset| (* |v_t_funThread1of2ForFork0_~i~0#1_89| 28))) 0) (< |v_t_funThread2of2ForFork0_~i~0#1_79| 0))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))))) is different from false [2023-01-28 08:07:24,529 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread2of2ForFork0_~i~0#1_79| Int) (v_ArrVal_1508 (Array Int Int))) (or (forall ((v_ArrVal_1515 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_89| Int) (|~#a~0.offset| Int) (v_ArrVal_1512 Int)) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1508))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_79| 28) |~#a~0.offset|) v_ArrVal_1512))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1515) |c_~#a~0.base|) (+ |~#a~0.offset| (* |v_t_funThread1of2ForFork0_~i~0#1_89| 28))) 0) (= |v_t_funThread2of2ForFork0_~i~0#1_79| |v_t_funThread1of2ForFork0_~i~0#1_89|))) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_79|) (< |v_t_funThread2of2ForFork0_~i~0#1_79| 0))) (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((v_ArrVal_1515 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_89| Int) (|v_t_funThread2of2ForFork0_~i~0#1_79| Int) (|~#a~0.offset| Int) (v_ArrVal_1512 Int) (v_ArrVal_1508 (Array Int Int))) (or (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_79|) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1508))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_79| 28) |~#a~0.offset|) v_ArrVal_1512))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1515) |c_~#a~0.base|) (+ |~#a~0.offset| (* |v_t_funThread1of2ForFork0_~i~0#1_89| 28))) 0) (< |v_t_funThread2of2ForFork0_~i~0#1_79| 0))))) is different from false [2023-01-28 08:07:31,766 WARN L222 SmtUtils]: Spent 7.09s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:07:32,043 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-01-28 08:07:32,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186173979] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:07:32,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:07:32,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 22 [2023-01-28 08:07:32,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127394806] [2023-01-28 08:07:32,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:07:32,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-01-28 08:07:32,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:07:32,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-01-28 08:07:32,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=299, Unknown=4, NotChecked=156, Total=552 [2023-01-28 08:07:32,045 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 476 [2023-01-28 08:07:32,047 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 134 transitions, 1052 flow. Second operand has 24 states, 24 states have (on average 149.29166666666666) internal successors, (3583), 24 states have internal predecessors, (3583), 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) [2023-01-28 08:07:32,047 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:07:32,047 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 476 [2023-01-28 08:07:32,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:07:58,477 WARN L222 SmtUtils]: Spent 26.40s on a formula simplification. DAG size of input: 60 DAG size of output: 43 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:08:00,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:08:02,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 08:08:04,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 08:08:06,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:08:35,058 WARN L222 SmtUtils]: Spent 26.16s on a formula simplification. DAG size of input: 73 DAG size of output: 43 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:08:37,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:08:40,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 08:08:42,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:08:44,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:08:46,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:08:48,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:08:49,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 08:08:51,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:08:53,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 08:08:55,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 08:08:57,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:08:59,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:09:01,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:09:03,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:09:05,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:09:07,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:09:09,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:09:11,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:09:13,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:09:15,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:09:16,451 INFO L130 PetriNetUnfolder]: 589/1382 cut-off events. [2023-01-28 08:09:16,451 INFO L131 PetriNetUnfolder]: For 8666/8682 co-relation queries the response was YES. [2023-01-28 08:09:16,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7330 conditions, 1382 events. 589/1382 cut-off events. For 8666/8682 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9396 event pairs, 138 based on Foata normal form. 23/1351 useless extension candidates. Maximal degree in co-relation 7276. Up to 818 conditions per place. [2023-01-28 08:09:16,459 INFO L137 encePairwiseOnDemand]: 459/476 looper letters, 126 selfloop transitions, 31 changer transitions 36/199 dead transitions. [2023-01-28 08:09:16,459 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 199 transitions, 2003 flow [2023-01-28 08:09:16,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-28 08:09:16,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-01-28 08:09:16,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2161 transitions. [2023-01-28 08:09:16,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3242797118847539 [2023-01-28 08:09:16,461 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2161 transitions. [2023-01-28 08:09:16,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2161 transitions. [2023-01-28 08:09:16,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:09:16,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2161 transitions. [2023-01-28 08:09:16,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 154.35714285714286) internal successors, (2161), 14 states have internal predecessors, (2161), 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) [2023-01-28 08:09:16,465 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 476.0) internal successors, (7140), 15 states have internal predecessors, (7140), 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) [2023-01-28 08:09:16,466 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 476.0) internal successors, (7140), 15 states have internal predecessors, (7140), 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) [2023-01-28 08:09:16,466 INFO L175 Difference]: Start difference. First operand has 165 places, 134 transitions, 1052 flow. Second operand 14 states and 2161 transitions. [2023-01-28 08:09:16,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 199 transitions, 2003 flow [2023-01-28 08:09:16,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 199 transitions, 1880 flow, removed 48 selfloop flow, removed 14 redundant places. [2023-01-28 08:09:16,484 INFO L231 Difference]: Finished difference. Result has 156 places, 147 transitions, 1184 flow [2023-01-28 08:09:16,485 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=990, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1184, PETRI_PLACES=156, PETRI_TRANSITIONS=147} [2023-01-28 08:09:16,485 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 88 predicate places. [2023-01-28 08:09:16,485 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 147 transitions, 1184 flow [2023-01-28 08:09:16,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 149.29166666666666) internal successors, (3583), 24 states have internal predecessors, (3583), 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) [2023-01-28 08:09:16,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:09:16,486 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:09:16,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-01-28 08:09:16,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:09:16,691 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:09:16,692 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:09:16,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1958020811, now seen corresponding path program 1 times [2023-01-28 08:09:16,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:09:16,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017269701] [2023-01-28 08:09:16,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:09:16,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:09:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:09:17,008 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:09:17,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:09:17,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017269701] [2023-01-28 08:09:17,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017269701] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:09:17,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886703842] [2023-01-28 08:09:17,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:09:17,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:09:17,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:09:17,010 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:09:17,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-01-28 08:09:17,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:09:17,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 39 conjunts are in the unsatisfiable core [2023-01-28 08:09:17,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:09:17,146 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 6 [2023-01-28 08:09:17,204 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:09:17,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:09:17,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:09:17,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:09:17,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-01-28 08:09:17,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2023-01-28 08:09:17,366 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:09:17,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:09:18,968 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1608 (Array Int Int))) (= (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1608) |c_~#a~0.base|) ((as const (Array Int Int)) 0))) is different from false [2023-01-28 08:09:19,024 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-01-28 08:09:19,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886703842] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:09:19,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:09:19,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 20 [2023-01-28 08:09:19,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352829362] [2023-01-28 08:09:19,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:09:19,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-01-28 08:09:19,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:09:19,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-01-28 08:09:19,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=335, Unknown=1, NotChecked=38, Total=462 [2023-01-28 08:09:19,026 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 476 [2023-01-28 08:09:19,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 147 transitions, 1184 flow. Second operand has 22 states, 22 states have (on average 149.8181818181818) internal successors, (3296), 22 states have internal predecessors, (3296), 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) [2023-01-28 08:09:19,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:09:19,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 476 [2023-01-28 08:09:19,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:09:19,507 INFO L130 PetriNetUnfolder]: 707/1621 cut-off events. [2023-01-28 08:09:19,507 INFO L131 PetriNetUnfolder]: For 11006/11016 co-relation queries the response was YES. [2023-01-28 08:09:19,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8984 conditions, 1621 events. 707/1621 cut-off events. For 11006/11016 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 11462 event pairs, 179 based on Foata normal form. 19/1637 useless extension candidates. Maximal degree in co-relation 8932. Up to 921 conditions per place. [2023-01-28 08:09:19,517 INFO L137 encePairwiseOnDemand]: 465/476 looper letters, 164 selfloop transitions, 45 changer transitions 18/233 dead transitions. [2023-01-28 08:09:19,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 233 transitions, 2474 flow [2023-01-28 08:09:19,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-28 08:09:19,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-01-28 08:09:19,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1863 transitions. [2023-01-28 08:09:19,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32615546218487396 [2023-01-28 08:09:19,519 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1863 transitions. [2023-01-28 08:09:19,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1863 transitions. [2023-01-28 08:09:19,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:09:19,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1863 transitions. [2023-01-28 08:09:19,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 155.25) internal successors, (1863), 12 states have internal predecessors, (1863), 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) [2023-01-28 08:09:19,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 476.0) internal successors, (6188), 13 states have internal predecessors, (6188), 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) [2023-01-28 08:09:19,524 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 476.0) internal successors, (6188), 13 states have internal predecessors, (6188), 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) [2023-01-28 08:09:19,524 INFO L175 Difference]: Start difference. First operand has 156 places, 147 transitions, 1184 flow. Second operand 12 states and 1863 transitions. [2023-01-28 08:09:19,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 233 transitions, 2474 flow [2023-01-28 08:09:19,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 233 transitions, 2419 flow, removed 20 selfloop flow, removed 7 redundant places. [2023-01-28 08:09:19,546 INFO L231 Difference]: Finished difference. Result has 163 places, 174 transitions, 1524 flow [2023-01-28 08:09:19,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1139, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1524, PETRI_PLACES=163, PETRI_TRANSITIONS=174} [2023-01-28 08:09:19,547 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 95 predicate places. [2023-01-28 08:09:19,547 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 174 transitions, 1524 flow [2023-01-28 08:09:19,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 149.8181818181818) internal successors, (3296), 22 states have internal predecessors, (3296), 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) [2023-01-28 08:09:19,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:09:19,547 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:09:19,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-01-28 08:09:19,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-01-28 08:09:19,751 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:09:19,751 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:09:19,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1958141083, now seen corresponding path program 2 times [2023-01-28 08:09:19,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:09:19,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216327545] [2023-01-28 08:09:19,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:09:19,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:09:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:09:20,841 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 08:09:20,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:09:20,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216327545] [2023-01-28 08:09:20,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216327545] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:09:20,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701598016] [2023-01-28 08:09:20,841 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 08:09:20,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:09:20,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:09:20,842 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:09:20,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-01-28 08:09:20,971 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 08:09:20,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:09:20,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 39 conjunts are in the unsatisfiable core [2023-01-28 08:09:20,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:09:20,976 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 6 [2023-01-28 08:09:21,038 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:09:21,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:09:21,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:09:21,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-01-28 08:09:21,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2023-01-28 08:09:21,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:09:21,231 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:09:21,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:09:21,348 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~i~0#1_83| Int) (v_ArrVal_1709 (Array Int Int))) (or (< |v_t_funThread2of2ForFork0_~i~0#1_83| 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_83|) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1709) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_83| 28))) 0))) is different from false [2023-01-28 08:09:21,364 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~i~0#1_83| Int) (v_ArrVal_1709 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|) (+ (- 1) |c_t_funThread1of2ForFork0_#t~post39#1|))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1709) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_83| 28))) 0) (< |v_t_funThread2of2ForFork0_~i~0#1_83| 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_83|))) is different from false [2023-01-28 08:09:21,373 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~i~0#1_83| Int) (v_ArrVal_1709 (Array Int Int))) (or (< |v_t_funThread2of2ForFork0_~i~0#1_83| 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_83|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|)) (.cse1 (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1709) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_83| 28))) 0))) is different from false [2023-01-28 08:09:21,396 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~i~0#1_83| Int) (v_ArrVal_1709 (Array Int Int))) (or (< |v_t_funThread2of2ForFork0_~i~0#1_83| 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_83|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|) |c_t_funThread1of2ForFork0_#t~mem35#1|)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1709) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_83| 28))) 0))) is different from false [2023-01-28 08:09:21,404 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~i~0#1_83| Int) (|~#a~0.offset| Int) (v_ArrVal_1709 (Array Int Int)) (|t_funThread1of2ForFork0_~i~0#1| Int)) (or (< |v_t_funThread2of2ForFork0_~i~0#1_83| 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_83|) (= 0 (select (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|)) (.cse1 (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (store .cse0 .cse1 (select .cse0 .cse1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1709) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_83| 28) |~#a~0.offset|))))) is different from false [2023-01-28 08:09:21,451 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~i~0#1_83| Int) (|~#a~0.offset| Int) (v_ArrVal_1709 (Array Int Int)) (|t_funThread1of2ForFork0_~i~0#1| Int) (v_ArrVal_1704 (Array Int Int))) (or (< |v_t_funThread2of2ForFork0_~i~0#1_83| 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_83|) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1704))) (store .cse0 |c_~#a~0.base| (let ((.cse1 (select .cse0 |c_~#a~0.base|)) (.cse2 (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (store .cse1 .cse2 (select .cse1 .cse2))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1709) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_83| 28) |~#a~0.offset|)) 0))) is different from false [2023-01-28 08:09:21,630 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-01-28 08:09:21,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701598016] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:09:21,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:09:21,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 9] total 25 [2023-01-28 08:09:21,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869053715] [2023-01-28 08:09:21,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:09:21,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-01-28 08:09:21,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:09:21,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-01-28 08:09:21,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=338, Unknown=6, NotChecked=258, Total=702 [2023-01-28 08:09:21,634 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 476 [2023-01-28 08:09:21,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 174 transitions, 1524 flow. Second operand has 27 states, 27 states have (on average 144.44444444444446) internal successors, (3900), 27 states have internal predecessors, (3900), 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) [2023-01-28 08:09:21,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:09:21,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 476 [2023-01-28 08:09:21,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:09:22,463 INFO L130 PetriNetUnfolder]: 732/1699 cut-off events. [2023-01-28 08:09:22,463 INFO L131 PetriNetUnfolder]: For 12046/12056 co-relation queries the response was YES. [2023-01-28 08:09:22,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9762 conditions, 1699 events. 732/1699 cut-off events. For 12046/12056 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 12333 event pairs, 110 based on Foata normal form. 21/1717 useless extension candidates. Maximal degree in co-relation 9708. Up to 446 conditions per place. [2023-01-28 08:09:22,473 INFO L137 encePairwiseOnDemand]: 465/476 looper letters, 58 selfloop transitions, 6 changer transitions 168/236 dead transitions. [2023-01-28 08:09:22,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 236 transitions, 2631 flow [2023-01-28 08:09:22,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-28 08:09:22,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-01-28 08:09:22,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2085 transitions. [2023-01-28 08:09:22,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31287515006002403 [2023-01-28 08:09:22,475 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2085 transitions. [2023-01-28 08:09:22,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2085 transitions. [2023-01-28 08:09:22,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:09:22,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2085 transitions. [2023-01-28 08:09:22,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 148.92857142857142) internal successors, (2085), 14 states have internal predecessors, (2085), 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) [2023-01-28 08:09:22,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 476.0) internal successors, (7140), 15 states have internal predecessors, (7140), 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) [2023-01-28 08:09:22,480 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 476.0) internal successors, (7140), 15 states have internal predecessors, (7140), 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) [2023-01-28 08:09:22,480 INFO L175 Difference]: Start difference. First operand has 163 places, 174 transitions, 1524 flow. Second operand 14 states and 2085 transitions. [2023-01-28 08:09:22,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 236 transitions, 2631 flow [2023-01-28 08:09:22,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 236 transitions, 2542 flow, removed 23 selfloop flow, removed 8 redundant places. [2023-01-28 08:09:22,508 INFO L231 Difference]: Finished difference. Result has 167 places, 66 transitions, 464 flow [2023-01-28 08:09:22,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1428, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=464, PETRI_PLACES=167, PETRI_TRANSITIONS=66} [2023-01-28 08:09:22,509 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 99 predicate places. [2023-01-28 08:09:22,509 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 66 transitions, 464 flow [2023-01-28 08:09:22,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 144.44444444444446) internal successors, (3900), 27 states have internal predecessors, (3900), 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) [2023-01-28 08:09:22,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:09:22,509 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:09:22,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-01-28 08:09:22,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:09:22,715 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:09:22,717 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:09:22,717 INFO L85 PathProgramCache]: Analyzing trace with hash -899509460, now seen corresponding path program 1 times [2023-01-28 08:09:22,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:09:22,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780714896] [2023-01-28 08:09:22,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:09:22,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:09:22,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:09:23,058 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:09:23,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:09:23,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780714896] [2023-01-28 08:09:23,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780714896] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:09:23,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685502360] [2023-01-28 08:09:23,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:09:23,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:09:23,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:09:23,061 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:09:23,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-01-28 08:09:23,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:09:23,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 39 conjunts are in the unsatisfiable core [2023-01-28 08:09:23,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:09:23,215 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 6 [2023-01-28 08:09:23,275 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:09:23,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:09:23,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:09:23,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:09:23,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-01-28 08:09:23,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2023-01-28 08:09:23,482 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:09:23,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:09:57,837 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1802 (Array Int Int)) (|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (|v_t_funThread1of2ForFork0_~i~0#1_95| Int)) (or (= (select (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1802) |c_~#a~0.base|)) (.cse1 (+ (* 28 |t_funThread2of2ForFork0_~i~0#1|) |~#a~0.offset|))) (store .cse0 .cse1 (select .cse0 .cse1))) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_95| 28) |~#a~0.offset|)) 0) (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_95|) (< |v_t_funThread1of2ForFork0_~i~0#1_95| 0))) is different from false [2023-01-28 08:09:57,996 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-01-28 08:09:57,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685502360] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:09:57,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:09:57,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 25 [2023-01-28 08:09:57,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367671441] [2023-01-28 08:09:57,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:09:57,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-01-28 08:09:57,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:09:57,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-01-28 08:09:57,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=536, Unknown=13, NotChecked=48, Total=702 [2023-01-28 08:09:57,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 476 [2023-01-28 08:09:58,000 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 66 transitions, 464 flow. Second operand has 27 states, 27 states have (on average 145.33333333333334) internal successors, (3924), 27 states have internal predecessors, (3924), 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) [2023-01-28 08:09:58,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:09:58,000 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 476 [2023-01-28 08:09:58,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:10:15,271 INFO L130 PetriNetUnfolder]: 189/484 cut-off events. [2023-01-28 08:10:15,271 INFO L131 PetriNetUnfolder]: For 2751/2751 co-relation queries the response was YES. [2023-01-28 08:10:15,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2453 conditions, 484 events. 189/484 cut-off events. For 2751/2751 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2657 event pairs, 4 based on Foata normal form. 27/511 useless extension candidates. Maximal degree in co-relation 2402. Up to 145 conditions per place. [2023-01-28 08:10:15,273 INFO L137 encePairwiseOnDemand]: 460/476 looper letters, 84 selfloop transitions, 66 changer transitions 1/155 dead transitions. [2023-01-28 08:10:15,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 155 transitions, 1605 flow [2023-01-28 08:10:15,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-01-28 08:10:15,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-01-28 08:10:15,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 4274 transitions. [2023-01-28 08:10:15,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30962039988409157 [2023-01-28 08:10:15,277 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 4274 transitions. [2023-01-28 08:10:15,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 4274 transitions. [2023-01-28 08:10:15,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:10:15,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 4274 transitions. [2023-01-28 08:10:15,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 147.3793103448276) internal successors, (4274), 29 states have internal predecessors, (4274), 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) [2023-01-28 08:10:15,286 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 476.0) internal successors, (14280), 30 states have internal predecessors, (14280), 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) [2023-01-28 08:10:15,287 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 476.0) internal successors, (14280), 30 states have internal predecessors, (14280), 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) [2023-01-28 08:10:15,287 INFO L175 Difference]: Start difference. First operand has 167 places, 66 transitions, 464 flow. Second operand 29 states and 4274 transitions. [2023-01-28 08:10:15,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 155 transitions, 1605 flow [2023-01-28 08:10:15,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 155 transitions, 1395 flow, removed 82 selfloop flow, removed 28 redundant places. [2023-01-28 08:10:15,293 INFO L231 Difference]: Finished difference. Result has 127 places, 109 transitions, 897 flow [2023-01-28 08:10:15,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=897, PETRI_PLACES=127, PETRI_TRANSITIONS=109} [2023-01-28 08:10:15,293 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 59 predicate places. [2023-01-28 08:10:15,293 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 109 transitions, 897 flow [2023-01-28 08:10:15,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 145.33333333333334) internal successors, (3924), 27 states have internal predecessors, (3924), 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) [2023-01-28 08:10:15,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:10:15,294 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:10:15,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-01-28 08:10:15,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2023-01-28 08:10:15,499 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:10:15,500 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:10:15,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1293684274, now seen corresponding path program 1 times [2023-01-28 08:10:15,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:10:15,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990253814] [2023-01-28 08:10:15,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:10:15,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:10:15,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:10:15,783 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:10:15,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:10:15,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990253814] [2023-01-28 08:10:15,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990253814] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:10:15,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670718516] [2023-01-28 08:10:15,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:10:15,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:10:15,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:10:15,785 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:10:15,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-01-28 08:10:15,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:10:15,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 39 conjunts are in the unsatisfiable core [2023-01-28 08:10:15,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:10:15,931 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 6 [2023-01-28 08:10:15,990 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:10:15,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:10:16,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:10:16,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:10:16,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-01-28 08:10:16,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2023-01-28 08:10:16,157 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:10:16,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:10:19,864 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1903 (Array Int Int))) (= (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1903) |c_~#a~0.base|) ((as const (Array Int Int)) 0))) is different from false [2023-01-28 08:10:19,921 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-01-28 08:10:19,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670718516] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:10:19,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:10:19,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 20 [2023-01-28 08:10:19,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116549831] [2023-01-28 08:10:19,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:10:19,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-01-28 08:10:19,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:10:19,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-01-28 08:10:19,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=335, Unknown=1, NotChecked=38, Total=462 [2023-01-28 08:10:19,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 476 [2023-01-28 08:10:19,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 109 transitions, 897 flow. Second operand has 22 states, 22 states have (on average 149.8181818181818) internal successors, (3296), 22 states have internal predecessors, (3296), 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) [2023-01-28 08:10:19,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:10:19,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 476 [2023-01-28 08:10:19,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:10:20,285 INFO L130 PetriNetUnfolder]: 184/474 cut-off events. [2023-01-28 08:10:20,286 INFO L131 PetriNetUnfolder]: For 2164/2164 co-relation queries the response was YES. [2023-01-28 08:10:20,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2526 conditions, 474 events. 184/474 cut-off events. For 2164/2164 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2574 event pairs, 11 based on Foata normal form. 3/477 useless extension candidates. Maximal degree in co-relation 2484. Up to 144 conditions per place. [2023-01-28 08:10:20,288 INFO L137 encePairwiseOnDemand]: 465/476 looper letters, 72 selfloop transitions, 50 changer transitions 3/129 dead transitions. [2023-01-28 08:10:20,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 129 transitions, 1322 flow [2023-01-28 08:10:20,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-28 08:10:20,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-01-28 08:10:20,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1823 transitions. [2023-01-28 08:10:20,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31915266106442575 [2023-01-28 08:10:20,290 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1823 transitions. [2023-01-28 08:10:20,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1823 transitions. [2023-01-28 08:10:20,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:10:20,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1823 transitions. [2023-01-28 08:10:20,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 151.91666666666666) internal successors, (1823), 12 states have internal predecessors, (1823), 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) [2023-01-28 08:10:20,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 476.0) internal successors, (6188), 13 states have internal predecessors, (6188), 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) [2023-01-28 08:10:20,295 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 476.0) internal successors, (6188), 13 states have internal predecessors, (6188), 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) [2023-01-28 08:10:20,295 INFO L175 Difference]: Start difference. First operand has 127 places, 109 transitions, 897 flow. Second operand 12 states and 1823 transitions. [2023-01-28 08:10:20,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 129 transitions, 1322 flow [2023-01-28 08:10:20,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 129 transitions, 1222 flow, removed 29 selfloop flow, removed 10 redundant places. [2023-01-28 08:10:20,303 INFO L231 Difference]: Finished difference. Result has 129 places, 111 transitions, 934 flow [2023-01-28 08:10:20,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=934, PETRI_PLACES=129, PETRI_TRANSITIONS=111} [2023-01-28 08:10:20,303 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 61 predicate places. [2023-01-28 08:10:20,304 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 111 transitions, 934 flow [2023-01-28 08:10:20,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 149.8181818181818) internal successors, (3296), 22 states have internal predecessors, (3296), 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) [2023-01-28 08:10:20,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:10:20,304 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:10:20,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2023-01-28 08:10:20,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:10:20,509 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:10:20,509 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:10:20,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1139005814, now seen corresponding path program 2 times [2023-01-28 08:10:20,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:10:20,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759877208] [2023-01-28 08:10:20,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:10:20,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:10:20,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:10:20,921 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-01-28 08:10:20,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:10:20,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759877208] [2023-01-28 08:10:20,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759877208] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:10:20,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166522368] [2023-01-28 08:10:20,921 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 08:10:20,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:10:20,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:10:20,922 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:10:20,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-01-28 08:10:21,081 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 08:10:21,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:10:21,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 40 conjunts are in the unsatisfiable core [2023-01-28 08:10:21,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:10:21,086 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 6 [2023-01-28 08:10:21,142 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:10:21,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:10:21,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:10:21,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:10:21,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-01-28 08:10:21,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2023-01-28 08:10:21,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 40 [2023-01-28 08:10:21,371 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-01-28 08:10:21,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:10:23,984 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~i~0#1_99| Int) (v_ArrVal_2007 (Array Int Int))) (or (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_99|) (< |v_t_funThread1of2ForFork0_~i~0#1_99| 0) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2007) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)) (+ (- 1) |c_t_funThread2of2ForFork0_#t~mem38#1|)) (+ |c_~#a~0.offset| (* |v_t_funThread1of2ForFork0_~i~0#1_99| 28))) 0))) is different from false [2023-01-28 08:10:25,128 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~i~0#1_99| Int) (v_ArrVal_2007 (Array Int Int))) (or (= (select (let ((.cse0 (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2007) |c_~#a~0.base|) .cse0 (+ (- 1) (select (select |c_#memory_int| |c_~#a~0.base|) .cse0)))) (+ |c_~#a~0.offset| (* |v_t_funThread1of2ForFork0_~i~0#1_99| 28))) 0) (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_99|) (< |v_t_funThread1of2ForFork0_~i~0#1_99| 0))) is different from false [2023-01-28 08:10:27,435 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~i~0#1_99| Int) (v_ArrVal_2007 (Array Int Int)) (|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int)) (or (= (select (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|)) (.cse1 (+ (* 28 |t_funThread2of2ForFork0_~i~0#1|) |~#a~0.offset|))) (let ((.cse2 (select .cse0 .cse1))) (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 .cse1 (+ .cse2 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2007) |c_~#a~0.base|) .cse1 .cse2))) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_99| 28) |~#a~0.offset|)) 0) (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_99|) (< |v_t_funThread1of2ForFork0_~i~0#1_99| 0))) is different from false [2023-01-28 08:10:29,489 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~i~0#1_99| Int) (v_ArrVal_2007 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int)) (or (= (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2004))) (let ((.cse1 (select .cse0 |c_~#a~0.base|)) (.cse2 (+ (* 28 |t_funThread2of2ForFork0_~i~0#1|) |~#a~0.offset|))) (let ((.cse3 (select .cse1 .cse2))) (store (select (store (store .cse0 |c_~#a~0.base| (store .cse1 .cse2 (+ .cse3 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2007) |c_~#a~0.base|) .cse2 .cse3)))) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_99| 28) |~#a~0.offset|)) 0) (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_99|) (< |v_t_funThread1of2ForFork0_~i~0#1_99| 0))) is different from false [2023-01-28 08:10:29,669 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-01-28 08:10:29,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166522368] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:10:29,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:10:29,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 24 [2023-01-28 08:10:29,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816631302] [2023-01-28 08:10:29,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:10:29,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-01-28 08:10:29,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:10:29,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-01-28 08:10:29,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=385, Unknown=7, NotChecked=172, Total=650 [2023-01-28 08:10:29,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 476 [2023-01-28 08:10:29,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 111 transitions, 934 flow. Second operand has 26 states, 26 states have (on average 149.5) internal successors, (3887), 26 states have internal predecessors, (3887), 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) [2023-01-28 08:10:29,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:10:29,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 476 [2023-01-28 08:10:29,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:10:30,538 INFO L130 PetriNetUnfolder]: 169/418 cut-off events. [2023-01-28 08:10:30,538 INFO L131 PetriNetUnfolder]: For 1849/1849 co-relation queries the response was YES. [2023-01-28 08:10:30,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2204 conditions, 418 events. 169/418 cut-off events. For 1849/1849 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2120 event pairs, 13 based on Foata normal form. 6/424 useless extension candidates. Maximal degree in co-relation 2162. Up to 127 conditions per place. [2023-01-28 08:10:30,539 INFO L137 encePairwiseOnDemand]: 466/476 looper letters, 0 selfloop transitions, 0 changer transitions 136/136 dead transitions. [2023-01-28 08:10:30,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 136 transitions, 1404 flow [2023-01-28 08:10:30,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-01-28 08:10:30,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-01-28 08:10:30,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1967 transitions. [2023-01-28 08:10:30,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3178733031674208 [2023-01-28 08:10:30,541 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1967 transitions. [2023-01-28 08:10:30,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1967 transitions. [2023-01-28 08:10:30,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:10:30,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1967 transitions. [2023-01-28 08:10:30,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 151.30769230769232) internal successors, (1967), 13 states have internal predecessors, (1967), 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) [2023-01-28 08:10:30,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 476.0) internal successors, (6664), 14 states have internal predecessors, (6664), 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) [2023-01-28 08:10:30,546 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 476.0) internal successors, (6664), 14 states have internal predecessors, (6664), 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) [2023-01-28 08:10:30,546 INFO L175 Difference]: Start difference. First operand has 129 places, 111 transitions, 934 flow. Second operand 13 states and 1967 transitions. [2023-01-28 08:10:30,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 136 transitions, 1404 flow [2023-01-28 08:10:30,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 136 transitions, 1321 flow, removed 1 selfloop flow, removed 13 redundant places. [2023-01-28 08:10:30,552 INFO L231 Difference]: Finished difference. Result has 127 places, 0 transitions, 0 flow [2023-01-28 08:10:30,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=832, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=0, PETRI_PLACES=127, PETRI_TRANSITIONS=0} [2023-01-28 08:10:30,553 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 59 predicate places. [2023-01-28 08:10:30,553 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 0 transitions, 0 flow [2023-01-28 08:10:30,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 149.5) internal successors, (3887), 26 states have internal predecessors, (3887), 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) [2023-01-28 08:10:30,553 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-01-28 08:10:30,554 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-01-28 08:10:30,554 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-01-28 08:10:30,554 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-01-28 08:10:30,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2023-01-28 08:10:30,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:10:30,761 INFO L445 BasicCegarLoop]: Path program histogram: [6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-01-28 08:10:30,761 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE (1/2) [2023-01-28 08:10:30,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 260 transitions, 538 flow [2023-01-28 08:10:30,788 INFO L130 PetriNetUnfolder]: 75/424 cut-off events. [2023-01-28 08:10:30,788 INFO L131 PetriNetUnfolder]: For 6/8 co-relation queries the response was YES. [2023-01-28 08:10:30,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 424 events. 75/424 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1687 event pairs, 0 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 262. Up to 12 conditions per place. [2023-01-28 08:10:30,790 INFO L82 GeneralOperation]: Start removeDead. Operand has 220 places, 260 transitions, 538 flow [2023-01-28 08:10:30,791 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 220 places, 260 transitions, 538 flow [2023-01-28 08:10:30,791 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 08:10:30,792 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 220 places, 260 transitions, 538 flow [2023-01-28 08:10:30,792 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 220 places, 260 transitions, 538 flow [2023-01-28 08:10:30,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 260 transitions, 538 flow [2023-01-28 08:10:30,816 INFO L130 PetriNetUnfolder]: 75/424 cut-off events. [2023-01-28 08:10:30,816 INFO L131 PetriNetUnfolder]: For 6/8 co-relation queries the response was YES. [2023-01-28 08:10:30,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 424 events. 75/424 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1687 event pairs, 0 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 262. Up to 12 conditions per place. [2023-01-28 08:10:30,822 INFO L119 LiptonReduction]: Number of co-enabled transitions 31416 [2023-01-28 08:10:33,250 INFO L134 LiptonReduction]: Checked pairs total: 54189 [2023-01-28 08:10:33,250 INFO L136 LiptonReduction]: Total number of compositions: 212 [2023-01-28 08:10:33,251 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-01-28 08:10:33,251 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;@78496575, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 08:10:33,251 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-28 08:10:33,255 INFO L130 PetriNetUnfolder]: 35/109 cut-off events. [2023-01-28 08:10:33,255 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-28 08:10:33,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:10:33,256 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2023-01-28 08:10:33,256 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 08:10:33,256 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:10:33,256 INFO L85 PathProgramCache]: Analyzing trace with hash -2023237836, now seen corresponding path program 1 times [2023-01-28 08:10:33,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:10:33,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546243034] [2023-01-28 08:10:33,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:10:33,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:10:33,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:10:33,275 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-01-28 08:10:33,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:10:33,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546243034] [2023-01-28 08:10:33,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546243034] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:10:33,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 08:10:33,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 08:10:33,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253111407] [2023-01-28 08:10:33,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:10:33,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 08:10:33,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:10:33,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 08:10:33,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 08:10:33,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 472 [2023-01-28 08:10:33,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 100 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 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) [2023-01-28 08:10:33,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:10:33,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 472 [2023-01-28 08:10:33,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:10:33,902 INFO L130 PetriNetUnfolder]: 9849/15756 cut-off events. [2023-01-28 08:10:33,902 INFO L131 PetriNetUnfolder]: For 109/109 co-relation queries the response was YES. [2023-01-28 08:10:33,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30204 conditions, 15756 events. 9849/15756 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 104674 event pairs, 9112 based on Foata normal form. 2729/16053 useless extension candidates. Maximal degree in co-relation 12153. Up to 14349 conditions per place. [2023-01-28 08:10:33,933 INFO L137 encePairwiseOnDemand]: 438/472 looper letters, 36 selfloop transitions, 2 changer transitions 23/70 dead transitions. [2023-01-28 08:10:33,933 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 70 transitions, 272 flow [2023-01-28 08:10:33,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 08:10:33,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 08:10:33,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 710 transitions. [2023-01-28 08:10:33,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.501412429378531 [2023-01-28 08:10:33,934 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 710 transitions. [2023-01-28 08:10:33,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 710 transitions. [2023-01-28 08:10:33,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:10:33,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 710 transitions. [2023-01-28 08:10:33,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 236.66666666666666) internal successors, (710), 3 states have internal predecessors, (710), 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) [2023-01-28 08:10:33,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 472.0) internal successors, (1888), 4 states have internal predecessors, (1888), 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) [2023-01-28 08:10:33,936 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 472.0) internal successors, (1888), 4 states have internal predecessors, (1888), 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) [2023-01-28 08:10:33,936 INFO L175 Difference]: Start difference. First operand has 68 places, 100 transitions, 218 flow. Second operand 3 states and 710 transitions. [2023-01-28 08:10:33,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 70 transitions, 272 flow [2023-01-28 08:10:33,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 70 transitions, 272 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 08:10:33,937 INFO L231 Difference]: Finished difference. Result has 71 places, 47 transitions, 116 flow [2023-01-28 08:10:33,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=71, PETRI_TRANSITIONS=47} [2023-01-28 08:10:33,937 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2023-01-28 08:10:33,937 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 47 transitions, 116 flow [2023-01-28 08:10:33,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 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) [2023-01-28 08:10:33,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:10:33,938 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-01-28 08:10:33,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-01-28 08:10:33,938 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 08:10:33,938 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:10:33,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1786261897, now seen corresponding path program 1 times [2023-01-28 08:10:33,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:10:33,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114452881] [2023-01-28 08:10:33,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:10:33,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:10:33,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:10:33,954 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-01-28 08:10:33,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:10:33,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114452881] [2023-01-28 08:10:33,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114452881] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:10:33,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38989497] [2023-01-28 08:10:33,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:10:33,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:10:33,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:10:33,956 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:10:33,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-01-28 08:10:34,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:10:34,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 3 conjunts are in the unsatisfiable core [2023-01-28 08:10:34,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:10:34,109 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-01-28 08:10:34,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:10:34,117 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-01-28 08:10:34,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38989497] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:10:34,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:10:34,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-01-28 08:10:34,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977116699] [2023-01-28 08:10:34,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:10:34,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 08:10:34,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:10:34,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 08:10:34,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-01-28 08:10:34,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 472 [2023-01-28 08:10:34,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 47 transitions, 116 flow. Second operand has 7 states, 7 states have (on average 208.71428571428572) internal successors, (1461), 7 states have internal predecessors, (1461), 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) [2023-01-28 08:10:34,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:10:34,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 472 [2023-01-28 08:10:34,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:10:34,284 INFO L130 PetriNetUnfolder]: 1738/2923 cut-off events. [2023-01-28 08:10:34,285 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2023-01-28 08:10:34,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5649 conditions, 2923 events. 1738/2923 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 16159 event pairs, 1617 based on Foata normal form. 0/2391 useless extension candidates. Maximal degree in co-relation 5636. Up to 2647 conditions per place. [2023-01-28 08:10:34,292 INFO L137 encePairwiseOnDemand]: 469/472 looper letters, 36 selfloop transitions, 5 changer transitions 0/50 dead transitions. [2023-01-28 08:10:34,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 50 transitions, 210 flow [2023-01-28 08:10:34,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 08:10:34,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 08:10:34,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1286 transitions. [2023-01-28 08:10:34,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4540960451977401 [2023-01-28 08:10:34,293 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1286 transitions. [2023-01-28 08:10:34,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1286 transitions. [2023-01-28 08:10:34,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:10:34,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1286 transitions. [2023-01-28 08:10:34,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 214.33333333333334) internal successors, (1286), 6 states have internal predecessors, (1286), 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) [2023-01-28 08:10:34,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 472.0) internal successors, (3304), 7 states have internal predecessors, (3304), 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) [2023-01-28 08:10:34,296 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 472.0) internal successors, (3304), 7 states have internal predecessors, (3304), 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) [2023-01-28 08:10:34,296 INFO L175 Difference]: Start difference. First operand has 71 places, 47 transitions, 116 flow. Second operand 6 states and 1286 transitions. [2023-01-28 08:10:34,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 50 transitions, 210 flow [2023-01-28 08:10:34,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 50 transitions, 204 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-01-28 08:10:34,297 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 146 flow [2023-01-28 08:10:34,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=146, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2023-01-28 08:10:34,297 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -10 predicate places. [2023-01-28 08:10:34,297 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 146 flow [2023-01-28 08:10:34,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 208.71428571428572) internal successors, (1461), 7 states have internal predecessors, (1461), 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) [2023-01-28 08:10:34,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:10:34,297 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1] [2023-01-28 08:10:34,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2023-01-28 08:10:34,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:10:34,502 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 08:10:34,502 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:10:34,502 INFO L85 PathProgramCache]: Analyzing trace with hash -170507148, now seen corresponding path program 2 times [2023-01-28 08:10:34,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:10:34,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087298075] [2023-01-28 08:10:34,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:10:34,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:10:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:10:34,539 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-01-28 08:10:34,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:10:34,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087298075] [2023-01-28 08:10:34,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087298075] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:10:34,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823768491] [2023-01-28 08:10:34,540 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 08:10:34,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:10:34,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:10:34,541 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:10:34,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-01-28 08:10:34,666 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 08:10:34,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:10:34,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjunts are in the unsatisfiable core [2023-01-28 08:10:34,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:10:34,675 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-01-28 08:10:34,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:10:34,711 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-01-28 08:10:34,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823768491] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:10:34,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:10:34,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-01-28 08:10:34,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561359921] [2023-01-28 08:10:34,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:10:34,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-01-28 08:10:34,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:10:34,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-01-28 08:10:34,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-01-28 08:10:34,713 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 472 [2023-01-28 08:10:34,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 146 flow. Second operand has 13 states, 13 states have (on average 208.3846153846154) internal successors, (2709), 13 states have internal predecessors, (2709), 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) [2023-01-28 08:10:34,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:10:34,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 472 [2023-01-28 08:10:34,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:10:34,949 INFO L130 PetriNetUnfolder]: 1738/2929 cut-off events. [2023-01-28 08:10:34,949 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2023-01-28 08:10:34,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5680 conditions, 2929 events. 1738/2929 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 16125 event pairs, 1617 based on Foata normal form. 6/2404 useless extension candidates. Maximal degree in co-relation 5621. Up to 2647 conditions per place. [2023-01-28 08:10:34,958 INFO L137 encePairwiseOnDemand]: 469/472 looper letters, 36 selfloop transitions, 11 changer transitions 0/56 dead transitions. [2023-01-28 08:10:34,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 56 transitions, 276 flow [2023-01-28 08:10:34,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-28 08:10:34,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-01-28 08:10:34,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2537 transitions. [2023-01-28 08:10:34,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4479166666666667 [2023-01-28 08:10:34,961 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2537 transitions. [2023-01-28 08:10:34,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2537 transitions. [2023-01-28 08:10:34,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:10:34,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2537 transitions. [2023-01-28 08:10:34,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 211.41666666666666) internal successors, (2537), 12 states have internal predecessors, (2537), 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) [2023-01-28 08:10:34,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 472.0) internal successors, (6136), 13 states have internal predecessors, (6136), 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) [2023-01-28 08:10:34,970 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 472.0) internal successors, (6136), 13 states have internal predecessors, (6136), 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) [2023-01-28 08:10:34,970 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 146 flow. Second operand 12 states and 2537 transitions. [2023-01-28 08:10:34,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 56 transitions, 276 flow [2023-01-28 08:10:34,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 56 transitions, 262 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-01-28 08:10:34,971 INFO L231 Difference]: Finished difference. Result has 74 places, 56 transitions, 216 flow [2023-01-28 08:10:34,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=216, PETRI_PLACES=74, PETRI_TRANSITIONS=56} [2023-01-28 08:10:34,972 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 6 predicate places. [2023-01-28 08:10:34,972 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 56 transitions, 216 flow [2023-01-28 08:10:34,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 208.3846153846154) internal successors, (2709), 13 states have internal predecessors, (2709), 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) [2023-01-28 08:10:34,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:10:34,972 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1] [2023-01-28 08:10:34,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2023-01-28 08:10:35,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2023-01-28 08:10:35,173 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 08:10:35,173 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:10:35,173 INFO L85 PathProgramCache]: Analyzing trace with hash 447921236, now seen corresponding path program 3 times [2023-01-28 08:10:35,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:10:35,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735877140] [2023-01-28 08:10:35,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:10:35,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:10:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 08:10:35,197 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 08:10:35,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 08:10:35,210 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 08:10:35,210 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 08:10:35,211 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-01-28 08:10:35,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-01-28 08:10:35,211 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-01-28 08:10:35,211 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-01-28 08:10:35,211 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-01-28 08:10:35,211 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-01-28 08:10:35,235 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-01-28 08:10:35,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 278 places, 330 transitions, 690 flow [2023-01-28 08:10:35,279 INFO L130 PetriNetUnfolder]: 110/619 cut-off events. [2023-01-28 08:10:35,279 INFO L131 PetriNetUnfolder]: For 19/22 co-relation queries the response was YES. [2023-01-28 08:10:35,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 647 conditions, 619 events. 110/619 cut-off events. For 19/22 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2706 event pairs, 1 based on Foata normal form. 0/498 useless extension candidates. Maximal degree in co-relation 432. Up to 16 conditions per place. [2023-01-28 08:10:35,284 INFO L82 GeneralOperation]: Start removeDead. Operand has 278 places, 330 transitions, 690 flow [2023-01-28 08:10:35,288 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 278 places, 330 transitions, 690 flow [2023-01-28 08:10:35,288 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 08:10:35,289 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 278 places, 330 transitions, 690 flow [2023-01-28 08:10:35,289 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 278 places, 330 transitions, 690 flow [2023-01-28 08:10:35,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 278 places, 330 transitions, 690 flow [2023-01-28 08:10:35,328 INFO L130 PetriNetUnfolder]: 110/619 cut-off events. [2023-01-28 08:10:35,328 INFO L131 PetriNetUnfolder]: For 19/22 co-relation queries the response was YES. [2023-01-28 08:10:35,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 647 conditions, 619 events. 110/619 cut-off events. For 19/22 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2706 event pairs, 1 based on Foata normal form. 0/498 useless extension candidates. Maximal degree in co-relation 432. Up to 16 conditions per place. [2023-01-28 08:10:35,344 INFO L119 LiptonReduction]: Number of co-enabled transitions 61608 [2023-01-28 08:10:38,038 INFO L134 LiptonReduction]: Checked pairs total: 111186 [2023-01-28 08:10:38,039 INFO L136 LiptonReduction]: Total number of compositions: 274 [2023-01-28 08:10:38,039 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 08:10:38,040 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;@78496575, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 08:10:38,040 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-01-28 08:10:38,041 INFO L130 PetriNetUnfolder]: 8/30 cut-off events. [2023-01-28 08:10:38,041 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 08:10:38,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:10:38,041 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-01-28 08:10:38,041 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-01-28 08:10:38,041 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:10:38,041 INFO L85 PathProgramCache]: Analyzing trace with hash 258191094, now seen corresponding path program 1 times [2023-01-28 08:10:38,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:10:38,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838088113] [2023-01-28 08:10:38,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:10:38,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:10:38,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:10:38,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 08:10:38,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:10:38,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838088113] [2023-01-28 08:10:38,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838088113] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:10:38,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 08:10:38,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 08:10:38,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748936820] [2023-01-28 08:10:38,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:10:38,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 08:10:38,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:10:38,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 08:10:38,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 08:10:38,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 604 [2023-01-28 08:10:38,058 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 131 transitions, 292 flow. Second operand has 3 states, 3 states have (on average 264.0) internal successors, (792), 3 states have internal predecessors, (792), 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) [2023-01-28 08:10:38,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:10:38,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 604 [2023-01-28 08:10:38,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:10:55,842 INFO L130 PetriNetUnfolder]: 252661/348965 cut-off events. [2023-01-28 08:10:55,842 INFO L131 PetriNetUnfolder]: For 3589/3589 co-relation queries the response was YES. [2023-01-28 08:10:56,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 681977 conditions, 348965 events. 252661/348965 cut-off events. For 3589/3589 co-relation queries the response was YES. Maximal size of possible extension queue 8440. Compared 2626051 event pairs, 240676 based on Foata normal form. 57687/354412 useless extension candidates. Maximal degree in co-relation 94389. Up to 330814 conditions per place. [2023-01-28 08:10:57,253 INFO L137 encePairwiseOnDemand]: 559/604 looper letters, 73 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2023-01-28 08:10:57,253 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 90 transitions, 360 flow [2023-01-28 08:10:57,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 08:10:57,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 08:10:57,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 904 transitions. [2023-01-28 08:10:57,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4988962472406181 [2023-01-28 08:10:57,254 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 904 transitions. [2023-01-28 08:10:57,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 904 transitions. [2023-01-28 08:10:57,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:10:57,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 904 transitions. [2023-01-28 08:10:57,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 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) [2023-01-28 08:10:57,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 604.0) internal successors, (2416), 4 states have internal predecessors, (2416), 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) [2023-01-28 08:10:57,400 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 604.0) internal successors, (2416), 4 states have internal predecessors, (2416), 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) [2023-01-28 08:10:57,400 INFO L175 Difference]: Start difference. First operand has 88 places, 131 transitions, 292 flow. Second operand 3 states and 904 transitions. [2023-01-28 08:10:57,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 90 transitions, 360 flow [2023-01-28 08:10:57,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 90 transitions, 360 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 08:10:57,403 INFO L231 Difference]: Finished difference. Result has 91 places, 90 transitions, 220 flow [2023-01-28 08:10:57,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=604, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=91, PETRI_TRANSITIONS=90} [2023-01-28 08:10:57,403 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 3 predicate places. [2023-01-28 08:10:57,403 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 90 transitions, 220 flow [2023-01-28 08:10:57,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 264.0) internal successors, (792), 3 states have internal predecessors, (792), 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) [2023-01-28 08:10:57,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:10:57,403 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:10:57,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-01-28 08:10:57,403 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-01-28 08:10:57,404 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:10:57,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1517144130, now seen corresponding path program 1 times [2023-01-28 08:10:57,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:10:57,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342089414] [2023-01-28 08:10:57,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:10:57,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:10:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:10:57,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 08:10:57,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:10:57,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342089414] [2023-01-28 08:10:57,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342089414] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:10:57,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124822363] [2023-01-28 08:10:57,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:10:57,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:10:57,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:10:57,444 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:10:57,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-01-28 08:10:57,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:10:57,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjunts are in the unsatisfiable core [2023-01-28 08:10:57,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:10:57,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 08:10:57,610 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 08:10:57,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124822363] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:10:57,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 08:10:57,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-01-28 08:10:57,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393805077] [2023-01-28 08:10:57,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:10:57,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 08:10:57,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:10:57,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 08:10:57,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 08:10:57,612 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 604 [2023-01-28 08:10:57,612 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 90 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 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) [2023-01-28 08:10:57,612 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:10:57,612 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 604 [2023-01-28 08:10:57,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:11:16,182 INFO L130 PetriNetUnfolder]: 252584/348596 cut-off events. [2023-01-28 08:11:16,182 INFO L131 PetriNetUnfolder]: For 3555/3555 co-relation queries the response was YES. [2023-01-28 08:11:16,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 681684 conditions, 348596 events. 252584/348596 cut-off events. For 3555/3555 co-relation queries the response was YES. Maximal size of possible extension queue 8487. Compared 2620959 event pairs, 157576 based on Foata normal form. 0/296520 useless extension candidates. Maximal degree in co-relation 681670. Up to 330782 conditions per place. [2023-01-28 08:11:17,879 INFO L137 encePairwiseOnDemand]: 601/604 looper letters, 90 selfloop transitions, 2 changer transitions 0/107 dead transitions. [2023-01-28 08:11:17,879 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 107 transitions, 438 flow [2023-01-28 08:11:17,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 08:11:17,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 08:11:17,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 878 transitions. [2023-01-28 08:11:17,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4845474613686534 [2023-01-28 08:11:17,881 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 878 transitions. [2023-01-28 08:11:17,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 878 transitions. [2023-01-28 08:11:17,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:11:17,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 878 transitions. [2023-01-28 08:11:17,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 292.6666666666667) internal successors, (878), 3 states have internal predecessors, (878), 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) [2023-01-28 08:11:17,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 604.0) internal successors, (2416), 4 states have internal predecessors, (2416), 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) [2023-01-28 08:11:17,882 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 604.0) internal successors, (2416), 4 states have internal predecessors, (2416), 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) [2023-01-28 08:11:17,882 INFO L175 Difference]: Start difference. First operand has 91 places, 90 transitions, 220 flow. Second operand 3 states and 878 transitions. [2023-01-28 08:11:17,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 107 transitions, 438 flow [2023-01-28 08:11:17,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 107 transitions, 434 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-28 08:11:17,885 INFO L231 Difference]: Finished difference. Result has 93 places, 91 transitions, 228 flow [2023-01-28 08:11:17,885 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=604, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=93, PETRI_TRANSITIONS=91} [2023-01-28 08:11:17,885 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 5 predicate places. [2023-01-28 08:11:17,885 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 91 transitions, 228 flow [2023-01-28 08:11:17,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 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) [2023-01-28 08:11:17,886 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:11:17,886 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:11:17,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2023-01-28 08:11:18,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2023-01-28 08:11:18,093 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-01-28 08:11:18,093 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:11:18,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1905250772, now seen corresponding path program 1 times [2023-01-28 08:11:18,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:11:18,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430979543] [2023-01-28 08:11:18,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:11:18,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:11:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:11:18,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 08:11:18,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:11:18,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430979543] [2023-01-28 08:11:18,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430979543] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:11:18,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631810823] [2023-01-28 08:11:18,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:11:18,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:11:18,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:11:18,111 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:11:18,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-01-28 08:11:18,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:11:18,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 3 conjunts are in the unsatisfiable core [2023-01-28 08:11:18,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:11:18,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 08:11:18,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:11:18,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 08:11:18,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631810823] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:11:18,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:11:18,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-01-28 08:11:18,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595086000] [2023-01-28 08:11:18,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:11:18,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 08:11:18,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:11:18,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 08:11:18,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-01-28 08:11:18,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 604 [2023-01-28 08:11:18,260 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 91 transitions, 228 flow. Second operand has 7 states, 7 states have (on average 264.0) internal successors, (1848), 7 states have internal predecessors, (1848), 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) [2023-01-28 08:11:18,260 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:11:18,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 604 [2023-01-28 08:11:18,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:11:37,300 INFO L130 PetriNetUnfolder]: 254329/349484 cut-off events. [2023-01-28 08:11:37,300 INFO L131 PetriNetUnfolder]: For 12214/12214 co-relation queries the response was YES. [2023-01-28 08:11:38,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 691246 conditions, 349484 events. 254329/349484 cut-off events. For 12214/12214 co-relation queries the response was YES. Maximal size of possible extension queue 8447. Compared 2598994 event pairs, 240676 based on Foata normal form. 3/301654 useless extension candidates. Maximal degree in co-relation 691217. Up to 330799 conditions per place. [2023-01-28 08:11:38,876 INFO L137 encePairwiseOnDemand]: 601/604 looper letters, 74 selfloop transitions, 5 changer transitions 0/94 dead transitions. [2023-01-28 08:11:38,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 94 transitions, 398 flow [2023-01-28 08:11:38,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 08:11:38,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 08:11:38,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1653 transitions. [2023-01-28 08:11:38,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45612582781456956 [2023-01-28 08:11:38,878 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1653 transitions. [2023-01-28 08:11:38,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1653 transitions. [2023-01-28 08:11:38,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:11:38,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1653 transitions. [2023-01-28 08:11:38,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 275.5) internal successors, (1653), 6 states have internal predecessors, (1653), 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) [2023-01-28 08:11:38,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 604.0) internal successors, (4228), 7 states have internal predecessors, (4228), 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) [2023-01-28 08:11:38,880 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 604.0) internal successors, (4228), 7 states have internal predecessors, (4228), 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) [2023-01-28 08:11:38,880 INFO L175 Difference]: Start difference. First operand has 93 places, 91 transitions, 228 flow. Second operand 6 states and 1653 transitions. [2023-01-28 08:11:38,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 94 transitions, 398 flow [2023-01-28 08:11:38,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 94 transitions, 396 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 08:11:38,889 INFO L231 Difference]: Finished difference. Result has 100 places, 94 transitions, 262 flow [2023-01-28 08:11:38,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=604, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=262, PETRI_PLACES=100, PETRI_TRANSITIONS=94} [2023-01-28 08:11:38,890 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 12 predicate places. [2023-01-28 08:11:38,890 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 94 transitions, 262 flow [2023-01-28 08:11:38,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 264.0) internal successors, (1848), 7 states have internal predecessors, (1848), 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) [2023-01-28 08:11:38,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:11:38,890 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:11:38,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2023-01-28 08:11:39,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2023-01-28 08:11:39,095 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-01-28 08:11:39,095 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:11:39,095 INFO L85 PathProgramCache]: Analyzing trace with hash 409718028, now seen corresponding path program 2 times [2023-01-28 08:11:39,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:11:39,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106692711] [2023-01-28 08:11:39,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:11:39,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:11:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:11:39,135 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 08:11:39,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:11:39,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106692711] [2023-01-28 08:11:39,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106692711] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:11:39,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413614916] [2023-01-28 08:11:39,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 08:11:39,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:11:39,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:11:39,138 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:11:39,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2023-01-28 08:11:39,272 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-01-28 08:11:39,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:11:39,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 22 conjunts are in the unsatisfiable core [2023-01-28 08:11:39,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:11:39,276 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 6 [2023-01-28 08:11:39,307 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:11:39,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:11:39,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:11:39,362 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-01-28 08:11:39,363 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 08:11:39,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413614916] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:11:39,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 08:11:39,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-01-28 08:11:39,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154746213] [2023-01-28 08:11:39,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:11:39,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 08:11:39,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:11:39,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 08:11:39,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-01-28 08:11:39,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 604 [2023-01-28 08:11:39,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 94 transitions, 262 flow. Second operand has 6 states, 6 states have (on average 222.5) internal successors, (1335), 6 states have internal predecessors, (1335), 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) [2023-01-28 08:11:39,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:11:39,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 604 [2023-01-28 08:11:39,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:11:59,826 INFO L130 PetriNetUnfolder]: 271147/372031 cut-off events. [2023-01-28 08:11:59,826 INFO L131 PetriNetUnfolder]: For 12764/12764 co-relation queries the response was YES. [2023-01-28 08:12:00,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 741956 conditions, 372031 events. 271147/372031 cut-off events. For 12764/12764 co-relation queries the response was YES. Maximal size of possible extension queue 9754. Compared 2798565 event pairs, 76420 based on Foata normal form. 0/326948 useless extension candidates. Maximal degree in co-relation 741919. Up to 316594 conditions per place. [2023-01-28 08:12:01,665 INFO L137 encePairwiseOnDemand]: 592/604 looper letters, 193 selfloop transitions, 18 changer transitions 0/225 dead transitions. [2023-01-28 08:12:01,665 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 225 transitions, 997 flow [2023-01-28 08:12:01,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 08:12:01,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 08:12:01,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1542 transitions. [2023-01-28 08:12:01,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42549668874172186 [2023-01-28 08:12:01,667 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1542 transitions. [2023-01-28 08:12:01,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1542 transitions. [2023-01-28 08:12:01,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:12:01,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1542 transitions. [2023-01-28 08:12:01,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 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) [2023-01-28 08:12:01,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 604.0) internal successors, (4228), 7 states have internal predecessors, (4228), 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) [2023-01-28 08:12:01,669 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 604.0) internal successors, (4228), 7 states have internal predecessors, (4228), 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) [2023-01-28 08:12:01,669 INFO L175 Difference]: Start difference. First operand has 100 places, 94 transitions, 262 flow. Second operand 6 states and 1542 transitions. [2023-01-28 08:12:01,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 225 transitions, 997 flow [2023-01-28 08:12:01,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 225 transitions, 983 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-01-28 08:12:01,674 INFO L231 Difference]: Finished difference. Result has 108 places, 110 transitions, 375 flow [2023-01-28 08:12:01,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=604, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=375, PETRI_PLACES=108, PETRI_TRANSITIONS=110} [2023-01-28 08:12:01,675 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 20 predicate places. [2023-01-28 08:12:01,675 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 110 transitions, 375 flow [2023-01-28 08:12:01,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 222.5) internal successors, (1335), 6 states have internal predecessors, (1335), 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) [2023-01-28 08:12:01,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:12:01,675 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:12:01,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2023-01-28 08:12:01,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2023-01-28 08:12:01,879 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-01-28 08:12:01,879 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:12:01,879 INFO L85 PathProgramCache]: Analyzing trace with hash -375198459, now seen corresponding path program 1 times [2023-01-28 08:12:01,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:12:01,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553735615] [2023-01-28 08:12:01,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:12:01,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:12:01,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:12:01,905 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-01-28 08:12:01,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:12:01,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553735615] [2023-01-28 08:12:01,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553735615] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:12:01,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762608992] [2023-01-28 08:12:01,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:12:01,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:12:01,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:12:01,906 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:12:01,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2023-01-28 08:12:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:12:02,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 6 conjunts are in the unsatisfiable core [2023-01-28 08:12:02,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:12:02,104 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 08:12:02,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:12:02,155 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 08:12:02,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762608992] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:12:02,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:12:02,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2023-01-28 08:12:02,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696571750] [2023-01-28 08:12:02,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:12:02,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-01-28 08:12:02,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:12:02,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-01-28 08:12:02,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-01-28 08:12:02,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 604 [2023-01-28 08:12:02,158 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 110 transitions, 375 flow. Second operand has 14 states, 14 states have (on average 258.14285714285717) internal successors, (3614), 14 states have internal predecessors, (3614), 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) [2023-01-28 08:12:02,158 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:12:02,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 604 [2023-01-28 08:12:02,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:12:24,494 INFO L130 PetriNetUnfolder]: 259411/360314 cut-off events. [2023-01-28 08:12:24,494 INFO L131 PetriNetUnfolder]: For 144850/144850 co-relation queries the response was YES. [2023-01-28 08:12:25,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 808227 conditions, 360314 events. 259411/360314 cut-off events. For 144850/144850 co-relation queries the response was YES. Maximal size of possible extension queue 9517. Compared 2792293 event pairs, 79293 based on Foata normal form. 22/337819 useless extension candidates. Maximal degree in co-relation 808167. Up to 344537 conditions per place. [2023-01-28 08:12:27,208 INFO L137 encePairwiseOnDemand]: 599/604 looper letters, 138 selfloop transitions, 14 changer transitions 0/167 dead transitions. [2023-01-28 08:12:27,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 167 transitions, 857 flow [2023-01-28 08:12:27,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-28 08:12:27,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-01-28 08:12:27,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3723 transitions. [2023-01-28 08:12:27,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44027909176915797 [2023-01-28 08:12:27,212 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 3723 transitions. [2023-01-28 08:12:27,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 3723 transitions. [2023-01-28 08:12:27,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:12:27,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 3723 transitions. [2023-01-28 08:12:27,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 265.92857142857144) internal successors, (3723), 14 states have internal predecessors, (3723), 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) [2023-01-28 08:12:27,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 604.0) internal successors, (9060), 15 states have internal predecessors, (9060), 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) [2023-01-28 08:12:27,219 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 604.0) internal successors, (9060), 15 states have internal predecessors, (9060), 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) [2023-01-28 08:12:27,219 INFO L175 Difference]: Start difference. First operand has 108 places, 110 transitions, 375 flow. Second operand 14 states and 3723 transitions. [2023-01-28 08:12:27,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 167 transitions, 857 flow [2023-01-28 08:12:27,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 167 transitions, 857 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 08:12:27,794 INFO L231 Difference]: Finished difference. Result has 122 places, 117 transitions, 451 flow [2023-01-28 08:12:27,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=604, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=451, PETRI_PLACES=122, PETRI_TRANSITIONS=117} [2023-01-28 08:12:27,794 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 34 predicate places. [2023-01-28 08:12:27,794 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 117 transitions, 451 flow [2023-01-28 08:12:27,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 258.14285714285717) internal successors, (3614), 14 states have internal predecessors, (3614), 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) [2023-01-28 08:12:27,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:12:27,795 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:12:27,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2023-01-28 08:12:28,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:12:28,000 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-01-28 08:12:28,001 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:12:28,001 INFO L85 PathProgramCache]: Analyzing trace with hash 823062819, now seen corresponding path program 1 times [2023-01-28 08:12:28,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:12:28,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430511686] [2023-01-28 08:12:28,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:12:28,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:12:28,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:12:28,061 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 08:12:28,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:12:28,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430511686] [2023-01-28 08:12:28,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430511686] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:12:28,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 08:12:28,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 08:12:28,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505011640] [2023-01-28 08:12:28,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:12:28,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 08:12:28,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:12:28,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 08:12:28,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 08:12:28,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 604 [2023-01-28 08:12:28,063 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 117 transitions, 451 flow. Second operand has 5 states, 5 states have (on average 208.4) internal successors, (1042), 5 states have internal predecessors, (1042), 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) [2023-01-28 08:12:28,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:12:28,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 604 [2023-01-28 08:12:28,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:12:39,784 INFO L130 PetriNetUnfolder]: 114542/177903 cut-off events. [2023-01-28 08:12:39,784 INFO L131 PetriNetUnfolder]: For 65967/65967 co-relation queries the response was YES. [2023-01-28 08:12:40,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407262 conditions, 177903 events. 114542/177903 cut-off events. For 65967/65967 co-relation queries the response was YES. Maximal size of possible extension queue 4624. Compared 1537642 event pairs, 45191 based on Foata normal form. 31418/191975 useless extension candidates. Maximal degree in co-relation 407188. Up to 98280 conditions per place. [2023-01-28 08:12:40,824 INFO L137 encePairwiseOnDemand]: 576/604 looper letters, 158 selfloop transitions, 28 changer transitions 0/197 dead transitions. [2023-01-28 08:12:40,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 197 transitions, 1110 flow [2023-01-28 08:12:40,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 08:12:40,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 08:12:40,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 972 transitions. [2023-01-28 08:12:40,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.402317880794702 [2023-01-28 08:12:40,825 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 972 transitions. [2023-01-28 08:12:40,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 972 transitions. [2023-01-28 08:12:40,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:12:40,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 972 transitions. [2023-01-28 08:12:40,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 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) [2023-01-28 08:12:40,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 604.0) internal successors, (3020), 5 states have internal predecessors, (3020), 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) [2023-01-28 08:12:40,827 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 604.0) internal successors, (3020), 5 states have internal predecessors, (3020), 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) [2023-01-28 08:12:40,827 INFO L175 Difference]: Start difference. First operand has 122 places, 117 transitions, 451 flow. Second operand 4 states and 972 transitions. [2023-01-28 08:12:40,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 197 transitions, 1110 flow [2023-01-28 08:12:40,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 197 transitions, 1037 flow, removed 26 selfloop flow, removed 10 redundant places. [2023-01-28 08:12:40,946 INFO L231 Difference]: Finished difference. Result has 116 places, 132 transitions, 524 flow [2023-01-28 08:12:40,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=604, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=524, PETRI_PLACES=116, PETRI_TRANSITIONS=132} [2023-01-28 08:12:40,946 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 28 predicate places. [2023-01-28 08:12:40,946 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 132 transitions, 524 flow [2023-01-28 08:12:40,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 208.4) internal successors, (1042), 5 states have internal predecessors, (1042), 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) [2023-01-28 08:12:40,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:12:40,946 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:12:40,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2023-01-28 08:12:40,946 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-01-28 08:12:40,947 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:12:40,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1646308287, now seen corresponding path program 1 times [2023-01-28 08:12:40,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:12:40,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063993389] [2023-01-28 08:12:40,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:12:40,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:12:40,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:12:41,201 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:12:41,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:12:41,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063993389] [2023-01-28 08:12:41,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063993389] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:12:41,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176228447] [2023-01-28 08:12:41,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:12:41,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:12:41,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:12:41,203 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:12:41,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2023-01-28 08:12:41,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:12:41,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 42 conjunts are in the unsatisfiable core [2023-01-28 08:12:41,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:12:41,532 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 6 [2023-01-28 08:12:41,595 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:12:41,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:12:41,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:12:41,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:12:41,652 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 12 [2023-01-28 08:12:41,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:12:41,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-01-28 08:12:41,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-01-28 08:12:41,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:12:41,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-01-28 08:12:41,752 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:12:41,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-01-28 08:12:41,788 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:12:41,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:12:41,914 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:12:41,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-01-28 08:12:41,921 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:12:41,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2023-01-28 08:12:41,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-01-28 08:12:54,699 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:12:54,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176228447] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:12:54,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:12:54,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2023-01-28 08:12:54,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539339285] [2023-01-28 08:12:54,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:12:54,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-01-28 08:12:54,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:12:54,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-01-28 08:12:54,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=295, Unknown=4, NotChecked=0, Total=420 [2023-01-28 08:12:54,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 604 [2023-01-28 08:12:54,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 132 transitions, 524 flow. Second operand has 21 states, 21 states have (on average 190.42857142857142) internal successors, (3999), 21 states have internal predecessors, (3999), 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) [2023-01-28 08:12:54,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:12:54,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 604 [2023-01-28 08:12:54,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:12:57,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:13:03,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:13:11,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2023-01-28 08:13:13,053 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-28 08:13:13,053 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 [2023-01-28 08:13:13,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-01-28 08:13:13,364 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-01-28 08:13:13,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2023-01-28 08:13:13,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2023-01-28 08:13:13,570 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (21states, 188/604 universal loopers) in iteration 7,while PetriNetUnfolder was constructing finite prefix that currently has 309731 conditions, 115810 events (75720/115809 cut-off events. For 74528/74806 co-relation queries the response was YES. Maximal size of possible extension queue 7497. Compared 1041094 event pairs, 4501 based on Foata normal form. 193/107221 useless extension candidates. Maximal degree in co-relation 302487. Up to 40053 conditions per place.). [2023-01-28 08:13:13,570 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-01-28 08:13:13,570 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-01-28 08:13:13,570 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-01-28 08:13:13,570 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-01-28 08:13:13,570 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2023-01-28 08:13:13,571 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/2) [2023-01-28 08:13:13,571 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2023-01-28 08:13:13,571 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 08:13:13,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 08:13:13 BasicIcfg [2023-01-28 08:13:13,591 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 08:13:13,591 INFO L158 Benchmark]: Toolchain (without parser) took 814871.04ms. Allocated memory was 364.9MB in the beginning and 16.0GB in the end (delta: 15.6GB). Free memory was 301.4MB in the beginning and 13.6GB in the end (delta: -13.3GB). Peak memory consumption was 2.7GB. Max. memory is 16.0GB. [2023-01-28 08:13:13,591 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 364.9MB. Free memory is still 313.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 08:13:13,591 INFO L158 Benchmark]: CACSL2BoogieTranslator took 470.93ms. Allocated memory was 364.9MB in the beginning and 532.7MB in the end (delta: 167.8MB). Free memory was 301.4MB in the beginning and 490.8MB in the end (delta: -189.4MB). Peak memory consumption was 29.9MB. Max. memory is 16.0GB. [2023-01-28 08:13:13,591 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.35ms. Allocated memory is still 532.7MB. Free memory was 490.8MB in the beginning and 488.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-01-28 08:13:13,591 INFO L158 Benchmark]: Boogie Preprocessor took 21.46ms. Allocated memory is still 532.7MB. Free memory was 488.0MB in the beginning and 485.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 08:13:13,591 INFO L158 Benchmark]: RCFGBuilder took 449.61ms. Allocated memory is still 532.7MB. Free memory was 485.9MB in the beginning and 467.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-01-28 08:13:13,591 INFO L158 Benchmark]: TraceAbstraction took 813874.39ms. Allocated memory was 532.7MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 466.2MB in the beginning and 13.6GB in the end (delta: -13.2GB). Peak memory consumption was 2.7GB. Max. memory is 16.0GB. [2023-01-28 08:13:13,592 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 364.9MB. Free memory is still 313.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 470.93ms. Allocated memory was 364.9MB in the beginning and 532.7MB in the end (delta: 167.8MB). Free memory was 301.4MB in the beginning and 490.8MB in the end (delta: -189.4MB). Peak memory consumption was 29.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 45.35ms. Allocated memory is still 532.7MB. Free memory was 490.8MB in the beginning and 488.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 21.46ms. Allocated memory is still 532.7MB. Free memory was 488.0MB in the beginning and 485.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 449.61ms. Allocated memory is still 532.7MB. Free memory was 485.9MB in the beginning and 467.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 813874.39ms. Allocated memory was 532.7MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 466.2MB in the beginning and 13.6GB in the end (delta: -13.2GB). Peak memory consumption was 2.7GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 158 PlacesBefore, 45 PlacesAfterwards, 185 TransitionsBefore, 65 TransitionsAfterwards, 10336 CoEnabledTransitionPairs, 5 FixpointIterations, 35 TrivialSequentialCompositions, 88 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 16 ConcurrentYvCompositions, 7 ChoiceCompositions, 151 TotalNumberOfCompositions, 15158 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8146, independent: 7914, independent conditional: 0, independent unconditional: 7914, dependent: 232, dependent conditional: 0, dependent unconditional: 232, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5129, independent: 5073, independent conditional: 0, independent unconditional: 5073, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8146, independent: 2841, independent conditional: 0, independent unconditional: 2841, dependent: 176, dependent conditional: 0, dependent unconditional: 176, unknown: 5129, unknown conditional: 0, unknown unconditional: 5129] , Statistics on independence cache: Total cache size (in pairs): 230, Positive cache size: 201, Positive conditional cache size: 0, Positive unconditional cache size: 201, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.6s, 158 PlacesBefore, 45 PlacesAfterwards, 185 TransitionsBefore, 66 TransitionsAfterwards, 10336 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 90 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 16 ConcurrentYvCompositions, 6 ChoiceCompositions, 150 TotalNumberOfCompositions, 16649 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8305, independent: 8033, independent conditional: 0, independent unconditional: 8033, dependent: 272, dependent conditional: 0, dependent unconditional: 272, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5080, independent: 5023, independent conditional: 0, independent unconditional: 5023, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8305, independent: 3010, independent conditional: 0, independent unconditional: 3010, dependent: 215, dependent conditional: 0, dependent unconditional: 215, unknown: 5080, unknown conditional: 0, unknown unconditional: 5080] , Statistics on independence cache: Total cache size (in pairs): 227, Positive cache size: 199, Positive conditional cache size: 0, Positive unconditional cache size: 199, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 220 PlacesBefore, 68 PlacesAfterwards, 260 TransitionsBefore, 101 TransitionsAfterwards, 31416 CoEnabledTransitionPairs, 5 FixpointIterations, 37 TrivialSequentialCompositions, 141 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 27 ConcurrentYvCompositions, 7 ChoiceCompositions, 216 TotalNumberOfCompositions, 49651 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 25177, independent: 24830, independent conditional: 0, independent unconditional: 24830, dependent: 347, dependent conditional: 0, dependent unconditional: 347, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15630, independent: 15542, independent conditional: 0, independent unconditional: 15542, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 25177, independent: 9288, independent conditional: 0, independent unconditional: 9288, dependent: 259, dependent conditional: 0, dependent unconditional: 259, unknown: 15630, unknown conditional: 0, unknown unconditional: 15630] , Statistics on independence cache: Total cache size (in pairs): 542, Positive cache size: 501, Positive conditional cache size: 0, Positive unconditional cache size: 501, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 220 PlacesBefore, 68 PlacesAfterwards, 260 TransitionsBefore, 100 TransitionsAfterwards, 31416 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 138 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 25 ConcurrentYvCompositions, 8 ChoiceCompositions, 212 TotalNumberOfCompositions, 54189 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 24660, independent: 24228, independent conditional: 0, independent unconditional: 24228, dependent: 432, dependent conditional: 0, dependent unconditional: 432, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15532, independent: 15426, independent conditional: 0, independent unconditional: 15426, dependent: 106, dependent conditional: 0, dependent unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 24660, independent: 8802, independent conditional: 0, independent unconditional: 8802, dependent: 326, dependent conditional: 0, dependent unconditional: 326, unknown: 15532, unknown conditional: 0, unknown unconditional: 15532] , Statistics on independence cache: Total cache size (in pairs): 668, Positive cache size: 613, Positive conditional cache size: 0, Positive unconditional cache size: 613, Negative cache size: 55, Negative conditional cache size: 0, Negative unconditional cache size: 55, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 278 PlacesBefore, 88 PlacesAfterwards, 330 TransitionsBefore, 131 TransitionsAfterwards, 61608 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 191 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 34 ConcurrentYvCompositions, 9 ChoiceCompositions, 274 TotalNumberOfCompositions, 111186 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 48104, independent: 47527, independent conditional: 0, independent unconditional: 47527, dependent: 577, dependent conditional: 0, dependent unconditional: 577, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 30111, independent: 29979, independent conditional: 0, independent unconditional: 29979, dependent: 132, dependent conditional: 0, dependent unconditional: 132, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 48104, independent: 17548, independent conditional: 0, independent unconditional: 17548, dependent: 445, dependent conditional: 0, dependent unconditional: 445, unknown: 30111, unknown conditional: 0, unknown unconditional: 30111] , Statistics on independence cache: Total cache size (in pairs): 698, Positive cache size: 633, Positive conditional cache size: 0, Positive unconditional cache size: 633, Negative cache size: 65, Negative conditional cache size: 0, Negative unconditional cache size: 65, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (21states, 188/604 universal loopers) in iteration 7,while PetriNetUnfolder was constructing finite prefix that currently has 309731 conditions, 115810 events (75720/115809 cut-off events. For 74528/74806 co-relation queries the response was YES. Maximal size of possible extension queue 7497. Compared 1041094 event pairs, 4501 based on Foata normal form. 193/107221 useless extension candidates. Maximal degree in co-relation 302487. Up to 40053 conditions per place.). - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (21states, 188/604 universal loopers) in iteration 7,while PetriNetUnfolder was constructing finite prefix that currently has 309731 conditions, 115810 events (75720/115809 cut-off events. For 74528/74806 co-relation queries the response was YES. Maximal size of possible extension queue 7497. Compared 1041094 event pairs, 4501 based on Foata normal form. 193/107221 useless extension candidates. Maximal degree in co-relation 302487. Up to 40053 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 216 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: 4.8s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 119 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 119 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 538 IncrementalHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 0 mSDtfsCounter, 538 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157occurred in iteration=4, InterpolantAutomatonStates: 32, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 100 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 117 ConstructedInterpolants, 0 QuantifiedInterpolants, 321 SizeOfPredicates, 3 NumberOfNonLiveVariables, 530 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 23/58 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 272 locations, 5 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: 643.5s, OverallIterations: 24, TraceHistogramMax: 10, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 414.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, HoareTripleCheckerStatistics: 377 mSolverCounterUnknown, 6863 SdHoareTripleChecker+Valid, 174.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6863 mSDsluCounter, 266 SdHoareTripleChecker+Invalid, 172.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 7426 IncrementalHoareTripleChecker+Unchecked, 247 mSDsCounter, 1099 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17592 IncrementalHoareTripleChecker+Invalid, 26494 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1099 mSolverCounterUnsat, 19 mSDtfsCounter, 17592 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 377 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1612 GetRequests, 960 SyntacticMatches, 50 SemanticMatches, 602 ConstructedPredicates, 35 IntricatePredicates, 1 DeprecatedPredicates, 3844 ImplicationChecksByTransitivity, 381.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8997occurred in iteration=13, InterpolantAutomatonStates: 349, 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.3s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 218.4s InterpolantComputationTime, 1260 NumberOfCodeBlocks, 1236 NumberOfCodeBlocksAsserted, 72 NumberOfCheckSat, 1788 ConstructedInterpolants, 501 QuantifiedInterpolants, 43480 SizeOfPredicates, 178 NumberOfNonLiveVariables, 5090 ConjunctsInSsa, 724 ConjunctsInUnsatCore, 66 InterpolantComputations, 4 PerfectInterpolantSequences, 3013/3277 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 - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 328 locations, 6 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: 158.3s, OverallIterations: 7, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 139.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 29 mSolverCounterUnknown, 1631 SdHoareTripleChecker+Valid, 9.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1631 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 9.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 270 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3479 IncrementalHoareTripleChecker+Invalid, 3778 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 270 mSolverCounterUnsat, 0 mSDtfsCounter, 3479 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 179 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 15.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=524occurred in iteration=6, InterpolantAutomatonStates: 36, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 13.8s InterpolantComputationTime, 188 NumberOfCodeBlocks, 184 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 231 ConstructedInterpolants, 30 QuantifiedInterpolants, 2466 SizeOfPredicates, 14 NumberOfNonLiveVariables, 778 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 15 InterpolantComputations, 4 PerfectInterpolantSequences, 248/286 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 3 procedures, 216 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: 2.6s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 244 IncrementalHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 0 mSDtfsCounter, 244 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171occurred in iteration=3, InterpolantAutomatonStates: 21, 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.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 62 NumberOfCodeBlocks, 62 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 101 SizeOfPredicates, 0 NumberOfNonLiveVariables, 231 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 14/47 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 2 thread instances CFG has 4 procedures, 272 locations, 5 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: 4.4s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 339 IncrementalHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 0 mSDtfsCounter, 339 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=218occurred in iteration=0, InterpolantAutomatonStates: 21, 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.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 92 ConstructedInterpolants, 0 QuantifiedInterpolants, 136 SizeOfPredicates, 0 NumberOfNonLiveVariables, 269 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 56/89 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