/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_74-tricky_address1_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 07:59:21,696 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 07:59:21,698 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 07:59:21,721 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 07:59:21,721 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 07:59:21,722 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 07:59:21,723 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 07:59:21,724 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 07:59:21,725 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 07:59:21,725 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 07:59:21,726 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 07:59:21,727 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 07:59:21,727 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 07:59:21,727 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 07:59:21,728 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 07:59:21,729 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 07:59:21,729 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 07:59:21,730 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 07:59:21,731 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 07:59:21,732 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 07:59:21,732 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 07:59:21,734 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 07:59:21,734 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 07:59:21,735 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 07:59:21,737 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 07:59:21,737 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 07:59:21,737 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 07:59:21,738 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 07:59:21,738 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 07:59:21,738 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 07:59:21,739 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 07:59:21,739 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 07:59:21,739 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 07:59:21,740 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 07:59:21,740 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 07:59:21,741 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 07:59:21,741 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 07:59:21,741 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 07:59:21,741 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 07:59:21,742 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 07:59:21,742 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 07:59:21,747 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:21,770 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 07:59:21,771 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 07:59:21,772 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 07:59:21,772 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 07:59:21,772 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 07:59:21,773 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 07:59:21,773 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 07:59:21,773 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 07:59:21,773 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 07:59:21,773 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 07:59:21,773 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 07:59:21,774 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 07:59:21,774 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 07:59:21,774 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 07:59:21,774 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 07:59:21,774 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 07:59:21,774 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 07:59:21,774 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 07:59:21,774 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 07:59:21,774 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 07:59:21,774 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 07:59:21,774 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 07:59:21,774 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 07:59:21,774 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 07:59:21,775 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 07:59:21,775 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 07:59:21,775 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 07:59:21,775 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 07:59:21,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 07:59:21,775 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 07:59:21,775 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 07:59:21,775 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:21,944 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 07:59:21,967 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 07:59:21,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 07:59:21,970 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 07:59:21,970 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 07:59:21,972 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_74-tricky_address1_racefree.i [2023-01-28 07:59:23,051 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 07:59:23,221 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 07:59:23,221 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_74-tricky_address1_racefree.i [2023-01-28 07:59:23,232 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5c52af7a/459d9f906c0e4e229a174b9f5d6834c0/FLAGb4d0ecb68 [2023-01-28 07:59:23,243 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5c52af7a/459d9f906c0e4e229a174b9f5d6834c0 [2023-01-28 07:59:23,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 07:59:23,245 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 07:59:23,246 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 07:59:23,246 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 07:59:23,248 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 07:59:23,248 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 07:59:23" (1/1) ... [2023-01-28 07:59:23,249 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59a68650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:59:23, skipping insertion in model container [2023-01-28 07:59:23,249 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 07:59:23" (1/1) ... [2023-01-28 07:59:23,253 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 07:59:23,291 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 07:59:23,521 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_74-tricky_address1_racefree.i[41323,41336] [2023-01-28 07:59:23,542 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 07:59:23,569 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 07:59:23,611 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_74-tricky_address1_racefree.i[41323,41336] [2023-01-28 07:59:23,624 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 07:59:23,668 INFO L208 MainTranslator]: Completed translation [2023-01-28 07:59:23,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:59:23 WrapperNode [2023-01-28 07:59:23,668 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 07:59:23,669 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 07:59:23,669 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 07:59:23,669 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 07:59:23,673 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:23" (1/1) ... [2023-01-28 07:59:23,684 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:23" (1/1) ... [2023-01-28 07:59:23,701 INFO L138 Inliner]: procedures = 270, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 190 [2023-01-28 07:59:23,701 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 07:59:23,702 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 07:59:23,702 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 07:59:23,702 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 07:59:23,708 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:23" (1/1) ... [2023-01-28 07:59:23,708 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:23" (1/1) ... [2023-01-28 07:59:23,711 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:23" (1/1) ... [2023-01-28 07:59:23,711 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:23" (1/1) ... [2023-01-28 07:59:23,717 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:23" (1/1) ... [2023-01-28 07:59:23,720 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:23" (1/1) ... [2023-01-28 07:59:23,721 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:23" (1/1) ... [2023-01-28 07:59:23,722 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:23" (1/1) ... [2023-01-28 07:59:23,724 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 07:59:23,724 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 07:59:23,725 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 07:59:23,725 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 07:59:23,725 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:59:23" (1/1) ... [2023-01-28 07:59:23,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 07:59:23,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:59:23,769 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:23,777 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:23,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 07:59:23,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 07:59:23,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-28 07:59:23,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 07:59:23,797 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-01-28 07:59:23,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 07:59:23,797 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-01-28 07:59:23,797 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-01-28 07:59:23,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 07:59:23,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 07:59:23,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 07:59:23,798 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:23,951 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 07:59:23,952 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 07:59:24,151 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 07:59:24,158 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 07:59:24,159 INFO L302 CfgBuilder]: Removed 23 assume(true) statements. [2023-01-28 07:59:24,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 07:59:24 BoogieIcfgContainer [2023-01-28 07:59:24,160 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 07:59:24,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 07:59:24,162 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 07:59:24,164 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 07:59:24,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 07:59:23" (1/3) ... [2023-01-28 07:59:24,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74e3f2dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 07:59:24, skipping insertion in model container [2023-01-28 07:59:24,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:59:23" (2/3) ... [2023-01-28 07:59:24,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74e3f2dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 07:59:24, skipping insertion in model container [2023-01-28 07:59:24,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 07:59:24" (3/3) ... [2023-01-28 07:59:24,165 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_74-tricky_address1_racefree.i [2023-01-28 07:59:24,176 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 07:59:24,177 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 07:59:24,177 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 07:59:24,222 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-01-28 07:59:24,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 190 transitions, 388 flow [2023-01-28 07:59:24,313 INFO L130 PetriNetUnfolder]: 45/260 cut-off events. [2023-01-28 07:59:24,314 INFO L131 PetriNetUnfolder]: For 1/2 co-relation queries the response was YES. [2023-01-28 07:59:24,320 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:24,320 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 190 transitions, 388 flow [2023-01-28 07:59:24,328 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 185 transitions, 375 flow [2023-01-28 07:59:24,330 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 07:59:24,339 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 185 transitions, 375 flow [2023-01-28 07:59:24,341 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 185 transitions, 375 flow [2023-01-28 07:59:24,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 185 transitions, 375 flow [2023-01-28 07:59:24,370 INFO L130 PetriNetUnfolder]: 44/255 cut-off events. [2023-01-28 07:59:24,370 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:59:24,371 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:24,375 INFO L119 LiptonReduction]: Number of co-enabled transitions 10336 [2023-01-28 07:59:26,654 INFO L134 LiptonReduction]: Checked pairs total: 15158 [2023-01-28 07:59:26,654 INFO L136 LiptonReduction]: Total number of compositions: 151 [2023-01-28 07:59:26,667 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 07:59:26,673 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;@7791dfe8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 07:59:26,673 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-01-28 07:59:26,678 INFO L130 PetriNetUnfolder]: 5/27 cut-off events. [2023-01-28 07:59:26,678 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:59:26,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:59:26,679 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-01-28 07:59:26,679 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:26,683 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:59:26,684 INFO L85 PathProgramCache]: Analyzing trace with hash 826457834, now seen corresponding path program 1 times [2023-01-28 07:59:26,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:59:26,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864229349] [2023-01-28 07:59:26,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:26,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:59:26,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:26,888 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:26,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:59:26,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864229349] [2023-01-28 07:59:26,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864229349] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:59:26,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:59:26,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 07:59:26,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149128113] [2023-01-28 07:59:26,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:59:26,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 07:59:26,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:59:26,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 07:59:26,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 07:59:26,922 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 341 [2023-01-28 07:59:26,925 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:26,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:59:26,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 341 [2023-01-28 07:59:26,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:59:27,070 INFO L130 PetriNetUnfolder]: 301/651 cut-off events. [2023-01-28 07:59:27,070 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:59:27,072 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:27,075 INFO L137 encePairwiseOnDemand]: 318/341 looper letters, 36 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2023-01-28 07:59:27,075 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 173 flow [2023-01-28 07:59:27,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 07:59:27,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 07:59:27,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 515 transitions. [2023-01-28 07:59:27,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5034213098729228 [2023-01-28 07:59:27,089 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 515 transitions. [2023-01-28 07:59:27,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 515 transitions. [2023-01-28 07:59:27,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:59:27,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 515 transitions. [2023-01-28 07:59:27,097 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:27,101 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:27,102 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:27,104 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:27,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 173 flow [2023-01-28 07:59:27,107 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:27,109 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 107 flow [2023-01-28 07:59:27,110 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:27,113 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2023-01-28 07:59:27,113 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 46 transitions, 107 flow [2023-01-28 07:59:27,114 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:27,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:59:27,114 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:59:27,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 07:59:27,114 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:27,115 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:59:27,115 INFO L85 PathProgramCache]: Analyzing trace with hash -669135341, now seen corresponding path program 1 times [2023-01-28 07:59:27,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:59:27,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227023424] [2023-01-28 07:59:27,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:27,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:59:27,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:27,180 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:27,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:59:27,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227023424] [2023-01-28 07:59:27,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227023424] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 07:59:27,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184432563] [2023-01-28 07:59:27,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:27,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:59:27,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:59:27,191 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:27,212 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:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:27,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjunts are in the unsatisfiable core [2023-01-28 07:59:27,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 07:59:27,304 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:27,304 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 07:59:27,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184432563] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:59:27,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 07:59:27,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-01-28 07:59:27,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462672282] [2023-01-28 07:59:27,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:59:27,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 07:59:27,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:59:27,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 07:59:27,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 07:59:27,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 341 [2023-01-28 07:59:27,307 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:27,308 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:59:27,308 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 341 [2023-01-28 07:59:27,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:59:27,421 INFO L130 PetriNetUnfolder]: 283/635 cut-off events. [2023-01-28 07:59:27,421 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:59:27,422 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:27,423 INFO L137 encePairwiseOnDemand]: 338/341 looper letters, 51 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-01-28 07:59:27,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 61 transitions, 243 flow [2023-01-28 07:59:27,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 07:59:27,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 07:59:27,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions. [2023-01-28 07:59:27,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4975562072336266 [2023-01-28 07:59:27,438 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 509 transitions. [2023-01-28 07:59:27,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 509 transitions. [2023-01-28 07:59:27,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:59:27,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 509 transitions. [2023-01-28 07:59:27,439 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:27,441 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:27,442 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:27,442 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:27,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 61 transitions, 243 flow [2023-01-28 07:59:27,442 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:27,443 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 111 flow [2023-01-28 07:59:27,443 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:27,444 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 5 predicate places. [2023-01-28 07:59:27,444 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 111 flow [2023-01-28 07:59:27,444 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:27,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:59:27,445 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:59:27,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-01-28 07:59:27,645 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:27,646 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:27,646 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:59:27,646 INFO L85 PathProgramCache]: Analyzing trace with hash 735439460, now seen corresponding path program 1 times [2023-01-28 07:59:27,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:59:27,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280131084] [2023-01-28 07:59:27,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:27,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:59:27,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:27,710 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:27,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:59:27,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280131084] [2023-01-28 07:59:27,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280131084] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 07:59:27,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576462726] [2023-01-28 07:59:27,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:27,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:59:27,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:59:27,713 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:27,757 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:27,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:27,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 3 conjunts are in the unsatisfiable core [2023-01-28 07:59:27,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 07:59:27,815 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:27,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 07:59:27,833 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:27,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576462726] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 07:59:27,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 07:59:27,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-01-28 07:59:27,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817484407] [2023-01-28 07:59:27,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 07:59:27,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 07:59:27,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:59:27,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 07:59:27,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-01-28 07:59:27,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 341 [2023-01-28 07:59:27,837 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:27,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:59:27,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 341 [2023-01-28 07:59:27,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:59:27,989 INFO L130 PetriNetUnfolder]: 301/637 cut-off events. [2023-01-28 07:59:27,989 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2023-01-28 07:59:27,990 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:27,991 INFO L137 encePairwiseOnDemand]: 338/341 looper letters, 36 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2023-01-28 07:59:27,991 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 49 transitions, 205 flow [2023-01-28 07:59:27,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 07:59:27,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 07:59:27,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 956 transitions. [2023-01-28 07:59:27,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46725317693059626 [2023-01-28 07:59:27,993 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 956 transitions. [2023-01-28 07:59:27,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 956 transitions. [2023-01-28 07:59:27,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:59:27,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 956 transitions. [2023-01-28 07:59:27,995 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:27,998 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:27,999 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:27,999 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:27,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 49 transitions, 205 flow [2023-01-28 07:59:28,000 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:28,001 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 143 flow [2023-01-28 07:59:28,002 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:28,002 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 11 predicate places. [2023-01-28 07:59:28,003 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 143 flow [2023-01-28 07:59:28,003 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:28,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:59:28,003 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:59:28,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-01-28 07:59:28,208 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:28,208 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:28,209 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:59:28,210 INFO L85 PathProgramCache]: Analyzing trace with hash 967406523, now seen corresponding path program 2 times [2023-01-28 07:59:28,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:59:28,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493941977] [2023-01-28 07:59:28,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:28,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:59:28,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:28,327 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:28,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:59:28,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493941977] [2023-01-28 07:59:28,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493941977] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 07:59:28,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051941582] [2023-01-28 07:59:28,328 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 07:59:28,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:59:28,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:59:28,332 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:28,337 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:28,396 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-01-28 07:59:28,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 07:59:28,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 24 conjunts are in the unsatisfiable core [2023-01-28 07:59:28,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 07:59:28,422 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:28,482 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 07:59:28,482 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:28,508 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:28,557 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:28,558 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 07:59:28,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051941582] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:59:28,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 07:59:28,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-01-28 07:59:28,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921235705] [2023-01-28 07:59:28,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:59:28,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 07:59:28,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:59:28,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 07:59:28,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-01-28 07:59:28,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 341 [2023-01-28 07:59:28,561 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:28,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:59:28,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 341 [2023-01-28 07:59:28,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:59:28,732 INFO L130 PetriNetUnfolder]: 319/710 cut-off events. [2023-01-28 07:59:28,732 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2023-01-28 07:59:28,734 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:28,735 INFO L137 encePairwiseOnDemand]: 333/341 looper letters, 45 selfloop transitions, 6 changer transitions 36/93 dead transitions. [2023-01-28 07:59:28,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 93 transitions, 409 flow [2023-01-28 07:59:28,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 07:59:28,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 07:59:28,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 824 transitions. [2023-01-28 07:59:28,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4027370478983382 [2023-01-28 07:59:28,737 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 824 transitions. [2023-01-28 07:59:28,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 824 transitions. [2023-01-28 07:59:28,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:59:28,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 824 transitions. [2023-01-28 07:59:28,738 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:28,741 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:28,742 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:28,742 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:28,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 93 transitions, 409 flow [2023-01-28 07:59:28,744 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:28,745 INFO L231 Difference]: Finished difference. Result has 64 places, 46 transitions, 157 flow [2023-01-28 07:59:28,745 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:28,747 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 19 predicate places. [2023-01-28 07:59:28,747 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 46 transitions, 157 flow [2023-01-28 07:59:28,748 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:28,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:59:28,748 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:28,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-01-28 07:59:28,953 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:28,953 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:28,953 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:59:28,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1432371976, now seen corresponding path program 1 times [2023-01-28 07:59:28,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:59:28,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065363011] [2023-01-28 07:59:28,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:28,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:59:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:29,022 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:29,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:59:29,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065363011] [2023-01-28 07:59:29,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065363011] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 07:59:29,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414070691] [2023-01-28 07:59:29,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:29,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:59:29,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:59:29,024 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:29,062 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:29,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:29,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 6 conjunts are in the unsatisfiable core [2023-01-28 07:59:29,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 07:59:29,133 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:29,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 07:59:29,177 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:29,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414070691] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 07:59:29,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 07:59:29,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2023-01-28 07:59:29,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300521845] [2023-01-28 07:59:29,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 07:59:29,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-01-28 07:59:29,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:59:29,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-01-28 07:59:29,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-01-28 07:59:29,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 341 [2023-01-28 07:59:29,182 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:29,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:59:29,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 341 [2023-01-28 07:59:29,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:59:29,226 INFO L130 PetriNetUnfolder]: 23/80 cut-off events. [2023-01-28 07:59:29,226 INFO L131 PetriNetUnfolder]: For 130/130 co-relation queries the response was YES. [2023-01-28 07:59:29,227 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:29,227 INFO L137 encePairwiseOnDemand]: 336/341 looper letters, 0 selfloop transitions, 0 changer transitions 43/43 dead transitions. [2023-01-28 07:59:29,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 43 transitions, 236 flow [2023-01-28 07:59:29,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-28 07:59:29,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-01-28 07:59:29,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2090 transitions. [2023-01-28 07:59:29,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4377880184331797 [2023-01-28 07:59:29,230 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2090 transitions. [2023-01-28 07:59:29,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2090 transitions. [2023-01-28 07:59:29,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:59:29,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2090 transitions. [2023-01-28 07:59:29,234 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:29,238 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:29,240 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:29,240 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:29,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 43 transitions, 236 flow [2023-01-28 07:59:29,242 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:29,243 INFO L231 Difference]: Finished difference. Result has 46 places, 0 transitions, 0 flow [2023-01-28 07:59:29,243 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:29,244 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 1 predicate places. [2023-01-28 07:59:29,244 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 0 transitions, 0 flow [2023-01-28 07:59:29,245 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:29,247 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-01-28 07:59:29,247 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-01-28 07:59:29,247 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-01-28 07:59:29,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-01-28 07:59:29,452 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:29,452 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2023-01-28 07:59:29,456 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-01-28 07:59:29,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 190 transitions, 388 flow [2023-01-28 07:59:29,474 INFO L130 PetriNetUnfolder]: 45/260 cut-off events. [2023-01-28 07:59:29,474 INFO L131 PetriNetUnfolder]: For 1/2 co-relation queries the response was YES. [2023-01-28 07:59:29,475 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:29,475 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 190 transitions, 388 flow [2023-01-28 07:59:29,476 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 185 transitions, 375 flow [2023-01-28 07:59:29,477 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 07:59:29,477 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 185 transitions, 375 flow [2023-01-28 07:59:29,478 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 185 transitions, 375 flow [2023-01-28 07:59:29,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 185 transitions, 375 flow [2023-01-28 07:59:29,490 INFO L130 PetriNetUnfolder]: 44/255 cut-off events. [2023-01-28 07:59:29,490 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:59:29,491 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:29,494 INFO L119 LiptonReduction]: Number of co-enabled transitions 10336 [2023-01-28 07:59:31,510 INFO L134 LiptonReduction]: Checked pairs total: 16649 [2023-01-28 07:59:31,510 INFO L136 LiptonReduction]: Total number of compositions: 150 [2023-01-28 07:59:31,516 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-01-28 07:59:31,529 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;@7791dfe8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 07:59:31,529 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-28 07:59:31,533 INFO L130 PetriNetUnfolder]: 12/42 cut-off events. [2023-01-28 07:59:31,533 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:59:31,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:59:31,533 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-01-28 07:59:31,533 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 07:59:31,534 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:59:31,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1785070566, now seen corresponding path program 1 times [2023-01-28 07:59:31,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:59:31,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482411248] [2023-01-28 07:59:31,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:31,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:59:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:31,607 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:31,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:59:31,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482411248] [2023-01-28 07:59:31,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482411248] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:59:31,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:59:31,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 07:59:31,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731046863] [2023-01-28 07:59:31,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:59:31,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 07:59:31,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:59:31,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 07:59:31,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 07:59:31,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 340 [2023-01-28 07:59:31,610 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:31,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:59:31,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 340 [2023-01-28 07:59:31,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:59:31,726 INFO L130 PetriNetUnfolder]: 300/656 cut-off events. [2023-01-28 07:59:31,727 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:59:31,727 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:31,728 INFO L137 encePairwiseOnDemand]: 316/340 looper letters, 20 selfloop transitions, 2 changer transitions 19/46 dead transitions. [2023-01-28 07:59:31,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 173 flow [2023-01-28 07:59:31,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 07:59:31,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 07:59:31,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 516 transitions. [2023-01-28 07:59:31,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5058823529411764 [2023-01-28 07:59:31,734 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 516 transitions. [2023-01-28 07:59:31,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 516 transitions. [2023-01-28 07:59:31,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:59:31,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 516 transitions. [2023-01-28 07:59:31,736 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:31,738 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:31,738 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:31,739 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:31,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 173 flow [2023-01-28 07:59:31,740 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:31,741 INFO L231 Difference]: Finished difference. Result has 48 places, 27 transitions, 69 flow [2023-01-28 07:59:31,741 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:31,742 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2023-01-28 07:59:31,742 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 27 transitions, 69 flow [2023-01-28 07:59:31,742 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:31,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:59:31,743 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-01-28 07:59:31,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 07:59:31,744 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 07:59:31,744 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:59:31,744 INFO L85 PathProgramCache]: Analyzing trace with hash -523375806, now seen corresponding path program 1 times [2023-01-28 07:59:31,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:59:31,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76872184] [2023-01-28 07:59:31,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:31,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:59:31,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:31,802 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:31,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:59:31,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76872184] [2023-01-28 07:59:31,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76872184] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 07:59:31,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143919194] [2023-01-28 07:59:31,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:31,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:59:31,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:59:31,819 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:31,865 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:31,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:31,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2023-01-28 07:59:31,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 07:59:31,938 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:31,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 07:59:31,949 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:31,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143919194] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 07:59:31,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 07:59:31,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-01-28 07:59:31,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6021094] [2023-01-28 07:59:31,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 07:59:31,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 07:59:31,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:59:31,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 07:59:31,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-01-28 07:59:31,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 340 [2023-01-28 07:59:31,954 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:31,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:59:31,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 340 [2023-01-28 07:59:31,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:59:31,989 INFO L130 PetriNetUnfolder]: 47/128 cut-off events. [2023-01-28 07:59:31,989 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:59:31,990 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:31,990 INFO L137 encePairwiseOnDemand]: 337/340 looper letters, 20 selfloop transitions, 5 changer transitions 0/30 dead transitions. [2023-01-28 07:59:31,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 131 flow [2023-01-28 07:59:31,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 07:59:31,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 07:59:31,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 940 transitions. [2023-01-28 07:59:31,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46078431372549017 [2023-01-28 07:59:31,993 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 940 transitions. [2023-01-28 07:59:31,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 940 transitions. [2023-01-28 07:59:31,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:59:31,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 940 transitions. [2023-01-28 07:59:31,996 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:31,998 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:31,999 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:31,999 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:31,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 131 flow [2023-01-28 07:59:32,000 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:32,000 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 101 flow [2023-01-28 07:59:32,000 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:32,001 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -8 predicate places. [2023-01-28 07:59:32,001 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 101 flow [2023-01-28 07:59:32,001 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:32,002 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:59:32,002 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2023-01-28 07:59:32,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-01-28 07:59:32,208 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:32,208 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 07:59:32,208 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:59:32,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1162836454, now seen corresponding path program 2 times [2023-01-28 07:59:32,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:59:32,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420623050] [2023-01-28 07:59:32,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:32,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:59:32,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:32,287 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:32,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:59:32,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420623050] [2023-01-28 07:59:32,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420623050] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 07:59:32,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033627463] [2023-01-28 07:59:32,288 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 07:59:32,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:59:32,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:59:32,303 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:32,304 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:32,376 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 07:59:32,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 07:59:32,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2023-01-28 07:59:32,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 07:59:32,394 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:32,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 07:59:32,438 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:32,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033627463] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 07:59:32,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 07:59:32,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-01-28 07:59:32,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626744619] [2023-01-28 07:59:32,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 07:59:32,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-01-28 07:59:32,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:59:32,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-01-28 07:59:32,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-01-28 07:59:32,443 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 340 [2023-01-28 07:59:32,446 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:32,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:59:32,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 340 [2023-01-28 07:59:32,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:59:32,517 INFO L130 PetriNetUnfolder]: 47/134 cut-off events. [2023-01-28 07:59:32,518 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-01-28 07:59:32,518 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:32,518 INFO L137 encePairwiseOnDemand]: 337/340 looper letters, 20 selfloop transitions, 11 changer transitions 0/36 dead transitions. [2023-01-28 07:59:32,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 36 transitions, 199 flow [2023-01-28 07:59:32,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-28 07:59:32,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-01-28 07:59:32,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1861 transitions. [2023-01-28 07:59:32,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45612745098039215 [2023-01-28 07:59:32,524 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1861 transitions. [2023-01-28 07:59:32,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1861 transitions. [2023-01-28 07:59:32,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:59:32,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1861 transitions. [2023-01-28 07:59:32,529 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:32,536 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:32,537 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:32,537 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:32,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 36 transitions, 199 flow [2023-01-28 07:59:32,540 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:32,541 INFO L231 Difference]: Finished difference. Result has 53 places, 36 transitions, 171 flow [2023-01-28 07:59:32,541 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:32,543 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 8 predicate places. [2023-01-28 07:59:32,543 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 36 transitions, 171 flow [2023-01-28 07:59:32,544 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:32,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:59:32,544 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2023-01-28 07:59:32,555 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:32,750 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:32,750 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 07:59:32,751 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:59:32,751 INFO L85 PathProgramCache]: Analyzing trace with hash -834996966, now seen corresponding path program 3 times [2023-01-28 07:59:32,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:59:32,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017013487] [2023-01-28 07:59:32,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:32,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:59:32,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 07:59:32,791 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 07:59:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 07:59:32,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 07:59:32,828 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 07:59:32,829 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-01-28 07:59:32,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 07:59:32,829 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-01-28 07:59:32,829 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-01-28 07:59:32,830 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-01-28 07:59:32,830 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-01-28 07:59:32,868 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-01-28 07:59:32,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 260 transitions, 538 flow [2023-01-28 07:59:32,897 INFO L130 PetriNetUnfolder]: 75/424 cut-off events. [2023-01-28 07:59:32,898 INFO L131 PetriNetUnfolder]: For 6/8 co-relation queries the response was YES. [2023-01-28 07:59:32,899 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:32,900 INFO L82 GeneralOperation]: Start removeDead. Operand has 220 places, 260 transitions, 538 flow [2023-01-28 07:59:32,902 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 220 places, 260 transitions, 538 flow [2023-01-28 07:59:32,902 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 07:59:32,902 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 220 places, 260 transitions, 538 flow [2023-01-28 07:59:32,902 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 220 places, 260 transitions, 538 flow [2023-01-28 07:59:32,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 260 transitions, 538 flow [2023-01-28 07:59:32,930 INFO L130 PetriNetUnfolder]: 75/424 cut-off events. [2023-01-28 07:59:32,930 INFO L131 PetriNetUnfolder]: For 6/8 co-relation queries the response was YES. [2023-01-28 07:59:32,932 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:32,946 INFO L119 LiptonReduction]: Number of co-enabled transitions 31416 [2023-01-28 07:59:35,695 INFO L134 LiptonReduction]: Checked pairs total: 49651 [2023-01-28 07:59:35,695 INFO L136 LiptonReduction]: Total number of compositions: 216 [2023-01-28 07:59:35,697 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 07:59:35,697 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;@7791dfe8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 07:59:35,697 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-01-28 07:59:35,699 INFO L130 PetriNetUnfolder]: 8/30 cut-off events. [2023-01-28 07:59:35,699 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:59:35,700 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:59:35,700 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-01-28 07:59:35,700 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:35,700 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:59:35,700 INFO L85 PathProgramCache]: Analyzing trace with hash -200231614, now seen corresponding path program 1 times [2023-01-28 07:59:35,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:59:35,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826928722] [2023-01-28 07:59:35,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:35,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:59:35,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:35,717 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:35,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:59:35,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826928722] [2023-01-28 07:59:35,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826928722] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:59:35,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:59:35,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 07:59:35,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969977757] [2023-01-28 07:59:35,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:59:35,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 07:59:35,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:59:35,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 07:59:35,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 07:59:35,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 476 [2023-01-28 07:59:35,719 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:35,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:59:35,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 476 [2023-01-28 07:59:35,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:59:36,575 INFO L130 PetriNetUnfolder]: 9872/15757 cut-off events. [2023-01-28 07:59:36,575 INFO L131 PetriNetUnfolder]: For 109/109 co-relation queries the response was YES. [2023-01-28 07:59:36,600 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:36,675 INFO L137 encePairwiseOnDemand]: 441/476 looper letters, 55 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-01-28 07:59:36,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 70 transitions, 272 flow [2023-01-28 07:59:36,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 07:59:36,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 07:59:36,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 711 transitions. [2023-01-28 07:59:36,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49789915966386555 [2023-01-28 07:59:36,678 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 711 transitions. [2023-01-28 07:59:36,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 711 transitions. [2023-01-28 07:59:36,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:59:36,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 711 transitions. [2023-01-28 07:59:36,680 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:36,682 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:36,683 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:36,683 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:36,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 70 transitions, 272 flow [2023-01-28 07:59:36,684 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:36,685 INFO L231 Difference]: Finished difference. Result has 71 places, 70 transitions, 168 flow [2023-01-28 07:59:36,685 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:36,686 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2023-01-28 07:59:36,686 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 70 transitions, 168 flow [2023-01-28 07:59:36,686 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:36,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:59:36,686 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:59:36,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 07:59:36,686 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:36,687 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:59:36,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1798379354, now seen corresponding path program 1 times [2023-01-28 07:59:36,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:59:36,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991096411] [2023-01-28 07:59:36,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:36,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:59:36,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:36,715 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:36,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:59:36,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991096411] [2023-01-28 07:59:36,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991096411] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 07:59:36,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733510959] [2023-01-28 07:59:36,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:36,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:59:36,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:59:36,729 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:36,738 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:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:36,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjunts are in the unsatisfiable core [2023-01-28 07:59:36,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 07:59:36,793 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:36,793 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 07:59:36,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733510959] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:59:36,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 07:59:36,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-01-28 07:59:36,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25896909] [2023-01-28 07:59:36,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:59:36,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 07:59:36,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:59:36,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 07:59:36,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 07:59:36,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 476 [2023-01-28 07:59:36,795 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:36,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:59:36,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 476 [2023-01-28 07:59:36,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:59:37,671 INFO L130 PetriNetUnfolder]: 9675/15570 cut-off events. [2023-01-28 07:59:37,671 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2023-01-28 07:59:37,699 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:37,752 INFO L137 encePairwiseOnDemand]: 473/476 looper letters, 72 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2023-01-28 07:59:37,752 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 87 transitions, 350 flow [2023-01-28 07:59:37,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 07:59:37,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 07:59:37,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 695 transitions. [2023-01-28 07:59:37,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48669467787114845 [2023-01-28 07:59:37,754 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 695 transitions. [2023-01-28 07:59:37,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 695 transitions. [2023-01-28 07:59:37,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:59:37,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 695 transitions. [2023-01-28 07:59:37,756 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:37,900 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:37,901 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:37,901 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:37,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 87 transitions, 350 flow [2023-01-28 07:59:37,902 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:37,903 INFO L231 Difference]: Finished difference. Result has 73 places, 71 transitions, 176 flow [2023-01-28 07:59:37,903 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:37,904 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 5 predicate places. [2023-01-28 07:59:37,904 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 71 transitions, 176 flow [2023-01-28 07:59:37,904 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:37,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:59:37,904 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:59:37,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-01-28 07:59:38,105 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:38,105 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:38,106 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:59:38,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1146753669, now seen corresponding path program 1 times [2023-01-28 07:59:38,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:59:38,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837077824] [2023-01-28 07:59:38,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:38,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:59:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:38,158 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:38,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:59:38,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837077824] [2023-01-28 07:59:38,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837077824] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 07:59:38,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266328606] [2023-01-28 07:59:38,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:38,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:59:38,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:59:38,175 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:38,176 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:38,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:38,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 3 conjunts are in the unsatisfiable core [2023-01-28 07:59:38,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 07:59:38,260 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:38,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 07:59:38,270 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:38,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266328606] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 07:59:38,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 07:59:38,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-01-28 07:59:38,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034049689] [2023-01-28 07:59:38,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 07:59:38,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 07:59:38,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:59:38,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 07:59:38,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-01-28 07:59:38,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 476 [2023-01-28 07:59:38,275 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:38,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:59:38,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 476 [2023-01-28 07:59:38,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:59:39,393 INFO L130 PetriNetUnfolder]: 9912/15619 cut-off events. [2023-01-28 07:59:39,394 INFO L131 PetriNetUnfolder]: For 612/612 co-relation queries the response was YES. [2023-01-28 07:59:39,427 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:39,472 INFO L137 encePairwiseOnDemand]: 473/476 looper letters, 56 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2023-01-28 07:59:39,472 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 74 transitions, 310 flow [2023-01-28 07:59:39,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 07:59:39,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 07:59:39,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1305 transitions. [2023-01-28 07:59:39,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4569327731092437 [2023-01-28 07:59:39,477 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1305 transitions. [2023-01-28 07:59:39,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1305 transitions. [2023-01-28 07:59:39,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:59:39,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1305 transitions. [2023-01-28 07:59:39,481 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:39,485 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:39,498 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:39,498 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:39,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 74 transitions, 310 flow [2023-01-28 07:59:39,500 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:39,501 INFO L231 Difference]: Finished difference. Result has 80 places, 74 transitions, 210 flow [2023-01-28 07:59:39,501 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:39,501 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 12 predicate places. [2023-01-28 07:59:39,502 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 74 transitions, 210 flow [2023-01-28 07:59:39,502 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:39,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:59:39,503 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:59:39,523 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:39,710 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:39,711 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:39,711 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:59:39,711 INFO L85 PathProgramCache]: Analyzing trace with hash -737928083, now seen corresponding path program 2 times [2023-01-28 07:59:39,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:59:39,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80884117] [2023-01-28 07:59:39,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:39,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:59:39,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:39,788 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:39,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:59:39,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80884117] [2023-01-28 07:59:39,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80884117] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 07:59:39,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586175833] [2023-01-28 07:59:39,789 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 07:59:39,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:59:39,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:59:39,819 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:39,820 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:39,895 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-01-28 07:59:39,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 07:59:39,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 24 conjunts are in the unsatisfiable core [2023-01-28 07:59:39,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 07:59:39,902 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:39,943 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 07:59:39,944 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:39,971 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:40,016 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:40,016 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 07:59:40,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586175833] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:59:40,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 07:59:40,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-01-28 07:59:40,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178427678] [2023-01-28 07:59:40,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:59:40,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 07:59:40,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:59:40,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 07:59:40,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-01-28 07:59:40,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 476 [2023-01-28 07:59:40,020 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:40,020 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:59:40,020 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 476 [2023-01-28 07:59:40,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:59:41,160 INFO L130 PetriNetUnfolder]: 10721/17432 cut-off events. [2023-01-28 07:59:41,160 INFO L131 PetriNetUnfolder]: For 598/598 co-relation queries the response was YES. [2023-01-28 07:59:41,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34256 conditions, 17432 events. 10721/17432 cut-off events. For 598/598 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 122417 event pairs, 2064 based on Foata normal form. 0/15294 useless extension candidates. Maximal degree in co-relation 34220. Up to 12385 conditions per place. [2023-01-28 07:59:41,224 INFO L137 encePairwiseOnDemand]: 467/476 looper letters, 134 selfloop transitions, 14 changer transitions 9/169 dead transitions. [2023-01-28 07:59:41,224 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 169 transitions, 745 flow [2023-01-28 07:59:41,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 07:59:41,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 07:59:41,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1186 transitions. [2023-01-28 07:59:41,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41526610644257705 [2023-01-28 07:59:41,227 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1186 transitions. [2023-01-28 07:59:41,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1186 transitions. [2023-01-28 07:59:41,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:59:41,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1186 transitions. [2023-01-28 07:59:41,229 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:41,231 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:41,232 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:41,232 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:41,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 169 transitions, 745 flow [2023-01-28 07:59:41,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 169 transitions, 731 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-01-28 07:59:41,235 INFO L231 Difference]: Finished difference. Result has 87 places, 86 transitions, 280 flow [2023-01-28 07:59:41,235 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=280, PETRI_PLACES=87, PETRI_TRANSITIONS=86} [2023-01-28 07:59:41,235 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 19 predicate places. [2023-01-28 07:59:41,235 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 86 transitions, 280 flow [2023-01-28 07:59:41,235 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:41,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:59:41,236 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:59:41,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-01-28 07:59:41,440 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:41,440 INFO L420 AbstractCegarLoop]: === Iteration 5 === 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:41,441 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:59:41,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1645103301, now seen corresponding path program 1 times [2023-01-28 07:59:41,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:59:41,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85129653] [2023-01-28 07:59:41,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:41,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:59:41,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:41,508 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:41,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:59:41,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85129653] [2023-01-28 07:59:41,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85129653] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 07:59:41,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060852720] [2023-01-28 07:59:41,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:41,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:59:41,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:59:41,525 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:41,526 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:41,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:41,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 6 conjunts are in the unsatisfiable core [2023-01-28 07:59:41,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 07:59:41,610 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:41,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 07:59:41,643 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:41,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060852720] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 07:59:41,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 07:59:41,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-01-28 07:59:41,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195093922] [2023-01-28 07:59:41,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 07:59:41,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-01-28 07:59:41,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:59:41,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-01-28 07:59:41,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-01-28 07:59:41,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 476 [2023-01-28 07:59:41,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 86 transitions, 280 flow. Second operand has 13 states, 13 states have (on average 208.69230769230768) internal successors, (2713), 13 states have internal predecessors, (2713), 0 states have call successors, (0), 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:41,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:59:41,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 476 [2023-01-28 07:59:41,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:59:42,596 INFO L130 PetriNetUnfolder]: 10225/16589 cut-off events. [2023-01-28 07:59:42,596 INFO L131 PetriNetUnfolder]: For 3432/3437 co-relation queries the response was YES. [2023-01-28 07:59:42,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35719 conditions, 16589 events. 10225/16589 cut-off events. For 3432/3437 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 114470 event pairs, 9000 based on Foata normal form. 6/15204 useless extension candidates. Maximal degree in co-relation 35661. Up to 15411 conditions per place. [2023-01-28 07:59:42,716 INFO L137 encePairwiseOnDemand]: 473/476 looper letters, 68 selfloop transitions, 11 changer transitions 0/92 dead transitions. [2023-01-28 07:59:42,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 92 transitions, 474 flow [2023-01-28 07:59:42,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-28 07:59:42,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-01-28 07:59:42,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2556 transitions. [2023-01-28 07:59:42,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4474789915966387 [2023-01-28 07:59:42,722 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2556 transitions. [2023-01-28 07:59:42,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2556 transitions. [2023-01-28 07:59:42,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:59:42,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2556 transitions. [2023-01-28 07:59:42,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 213.0) internal successors, (2556), 12 states have internal predecessors, (2556), 0 states have call successors, (0), 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,734 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 07:59:42,735 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 07:59:42,735 INFO L175 Difference]: Start difference. First operand has 87 places, 86 transitions, 280 flow. Second operand 12 states and 2556 transitions. [2023-01-28 07:59:42,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 92 transitions, 474 flow [2023-01-28 07:59:42,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 92 transitions, 474 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 07:59:42,747 INFO L231 Difference]: Finished difference. Result has 104 places, 92 transitions, 364 flow [2023-01-28 07:59:42,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=364, PETRI_PLACES=104, PETRI_TRANSITIONS=92} [2023-01-28 07:59:42,748 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 36 predicate places. [2023-01-28 07:59:42,748 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 92 transitions, 364 flow [2023-01-28 07:59:42,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 208.69230769230768) internal successors, (2713), 13 states have internal predecessors, (2713), 0 states have call successors, (0), 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,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:59:42,749 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:59:42,755 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:42,954 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:42,955 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:42,955 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:59:42,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1249743301, now seen corresponding path program 2 times [2023-01-28 07:59:42,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:59:42,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437252790] [2023-01-28 07:59:42,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:42,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:59:42,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:43,599 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 07:59:43,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:59:43,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437252790] [2023-01-28 07:59:43,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437252790] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 07:59:43,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809704212] [2023-01-28 07:59:43,600 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 07:59:43,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:59:43,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:59:43,601 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:43,603 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:43,685 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 07:59:43,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 07:59:43,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 25 conjunts are in the unsatisfiable core [2023-01-28 07:59:43,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 07:59:43,691 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,743 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 07:59:43,743 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,755 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,774 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,805 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:43,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 07:59:53,861 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_397 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_397) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 07:59:54,020 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 07:59:54,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809704212] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 07:59:54,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 07:59:54,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2023-01-28 07:59:54,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651004704] [2023-01-28 07:59:54,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 07:59:54,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-01-28 07:59:54,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:59:54,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-01-28 07:59:54,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=132, Unknown=2, NotChecked=24, Total=210 [2023-01-28 07:59:54,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 476 [2023-01-28 07:59:54,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 92 transitions, 364 flow. Second operand has 15 states, 15 states have (on average 150.4) internal successors, (2256), 15 states have internal predecessors, (2256), 0 states have call successors, (0), 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,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:59:54,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 476 [2023-01-28 07:59:54,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:00:18,075 WARN L222 SmtUtils]: Spent 24.03s on a formula simplification. DAG size of input: 31 DAG size of output: 22 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:00:20,083 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:00:22,086 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:00:24,089 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:00:26,092 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:00:28,093 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:00:30,132 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:00:32,134 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:00:34,137 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:00:36,139 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:00:37,750 INFO L130 PetriNetUnfolder]: 13779/21926 cut-off events. [2023-01-28 08:00:37,750 INFO L131 PetriNetUnfolder]: For 4318/4318 co-relation queries the response was YES. [2023-01-28 08:00:37,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47523 conditions, 21926 events. 13779/21926 cut-off events. For 4318/4318 co-relation queries the response was YES. Maximal size of possible extension queue 679. Compared 151704 event pairs, 2524 based on Foata normal form. 0/20511 useless extension candidates. Maximal degree in co-relation 47440. Up to 14693 conditions per place. [2023-01-28 08:00:37,830 INFO L137 encePairwiseOnDemand]: 461/476 looper letters, 166 selfloop transitions, 26 changer transitions 26/227 dead transitions. [2023-01-28 08:00:37,830 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 227 transitions, 1159 flow [2023-01-28 08:00:37,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 08:00:37,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 08:00:37,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1386 transitions. [2023-01-28 08:00:37,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3639705882352941 [2023-01-28 08:00:37,833 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1386 transitions. [2023-01-28 08:00:37,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1386 transitions. [2023-01-28 08:00:37,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:00:37,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1386 transitions. [2023-01-28 08:00:37,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 173.25) internal successors, (1386), 8 states have internal predecessors, (1386), 0 states have call successors, (0), 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:37,839 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 476.0) internal successors, (4284), 9 states have internal predecessors, (4284), 0 states have call successors, (0), 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:37,839 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 476.0) internal successors, (4284), 9 states have internal predecessors, (4284), 0 states have call successors, (0), 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:37,839 INFO L175 Difference]: Start difference. First operand has 104 places, 92 transitions, 364 flow. Second operand 8 states and 1386 transitions. [2023-01-28 08:00:37,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 227 transitions, 1159 flow [2023-01-28 08:00:37,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 227 transitions, 1111 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-01-28 08:00:37,849 INFO L231 Difference]: Finished difference. Result has 111 places, 106 transitions, 487 flow [2023-01-28 08:00:37,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=487, PETRI_PLACES=111, PETRI_TRANSITIONS=106} [2023-01-28 08:00:37,849 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 43 predicate places. [2023-01-28 08:00:37,849 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 106 transitions, 487 flow [2023-01-28 08:00:37,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 150.4) internal successors, (2256), 15 states have internal predecessors, (2256), 0 states have call successors, (0), 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:37,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:00:37,850 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:00:37,869 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:38,055 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,SelfDestructingSolverStorable14 [2023-01-28 08:00:38,055 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:00:38,056 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:00:38,056 INFO L85 PathProgramCache]: Analyzing trace with hash -753113228, now seen corresponding path program 1 times [2023-01-28 08:00:38,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:00:38,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255384461] [2023-01-28 08:00:38,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:00:38,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:00:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:00:38,094 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 08:00:38,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:00:38,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255384461] [2023-01-28 08:00:38,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255384461] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:00:38,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508944335] [2023-01-28 08:00:38,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:00:38,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:00:38,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:00:38,122 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:38,123 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:38,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:00:38,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 3 conjunts are in the unsatisfiable core [2023-01-28 08:00:38,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:00:38,216 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 08:00:38,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:00:38,230 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 08:00:38,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508944335] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:00:38,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:00:38,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-01-28 08:00:38,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026521181] [2023-01-28 08:00:38,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:00:38,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 08:00:38,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:00:38,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 08:00:38,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-01-28 08:00:38,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 476 [2023-01-28 08:00:38,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 106 transitions, 487 flow. Second operand has 7 states, 7 states have (on average 210.85714285714286) internal successors, (1476), 7 states have internal predecessors, (1476), 0 states have call successors, (0), 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:38,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:00:38,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 476 [2023-01-28 08:00:38,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:00:38,428 INFO L130 PetriNetUnfolder]: 1230/2381 cut-off events. [2023-01-28 08:00:38,428 INFO L131 PetriNetUnfolder]: For 1526/1526 co-relation queries the response was YES. [2023-01-28 08:00:38,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6229 conditions, 2381 events. 1230/2381 cut-off events. For 1526/1526 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 14977 event pairs, 94 based on Foata normal form. 277/2560 useless extension candidates. Maximal degree in co-relation 6164. Up to 1472 conditions per place. [2023-01-28 08:00:38,435 INFO L137 encePairwiseOnDemand]: 473/476 looper letters, 89 selfloop transitions, 3 changer transitions 18/119 dead transitions. [2023-01-28 08:00:38,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 119 transitions, 703 flow [2023-01-28 08:00:38,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 08:00:38,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 08:00:38,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1119 transitions. [2023-01-28 08:00:38,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47016806722689075 [2023-01-28 08:00:38,438 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1119 transitions. [2023-01-28 08:00:38,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1119 transitions. [2023-01-28 08:00:38,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:00:38,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1119 transitions. [2023-01-28 08:00:38,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 223.8) internal successors, (1119), 5 states have internal predecessors, (1119), 0 states have call successors, (0), 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:38,442 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:00:38,442 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:00:38,442 INFO L175 Difference]: Start difference. First operand has 111 places, 106 transitions, 487 flow. Second operand 5 states and 1119 transitions. [2023-01-28 08:00:38,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 119 transitions, 703 flow [2023-01-28 08:00:38,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 119 transitions, 682 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-01-28 08:00:38,446 INFO L231 Difference]: Finished difference. Result has 87 places, 58 transitions, 252 flow [2023-01-28 08:00:38,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=252, PETRI_PLACES=87, PETRI_TRANSITIONS=58} [2023-01-28 08:00:38,447 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 19 predicate places. [2023-01-28 08:00:38,447 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 58 transitions, 252 flow [2023-01-28 08:00:38,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 210.85714285714286) internal successors, (1476), 7 states have internal predecessors, (1476), 0 states have call successors, (0), 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:38,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:00:38,447 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:00:38,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-01-28 08:00:38,652 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,SelfDestructingSolverStorable15 [2023-01-28 08:00:38,652 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:38,652 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:00:38,652 INFO L85 PathProgramCache]: Analyzing trace with hash 636168720, now seen corresponding path program 1 times [2023-01-28 08:00:38,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:00:38,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720679075] [2023-01-28 08:00:38,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:00:38,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:00:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:00:38,767 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:00:38,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:00:38,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720679075] [2023-01-28 08:00:38,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720679075] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:00:38,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 08:00:38,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 08:00:38,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443262546] [2023-01-28 08:00:38,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:00:38,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 08:00:38,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:00:38,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 08:00:38,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 08:00:38,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 476 [2023-01-28 08:00:38,772 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 58 transitions, 252 flow. Second operand has 5 states, 5 states have (on average 177.4) internal successors, (887), 5 states have internal predecessors, (887), 0 states have call successors, (0), 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:38,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:00:38,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 476 [2023-01-28 08:00:38,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:00:38,877 INFO L130 PetriNetUnfolder]: 513/1008 cut-off events. [2023-01-28 08:00:38,877 INFO L131 PetriNetUnfolder]: For 1028/1028 co-relation queries the response was YES. [2023-01-28 08:00:38,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2754 conditions, 1008 events. 513/1008 cut-off events. For 1028/1028 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 5121 event pairs, 163 based on Foata normal form. 108/1028 useless extension candidates. Maximal degree in co-relation 2693. Up to 568 conditions per place. [2023-01-28 08:00:38,880 INFO L137 encePairwiseOnDemand]: 463/476 looper letters, 53 selfloop transitions, 13 changer transitions 4/76 dead transitions. [2023-01-28 08:00:38,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 76 transitions, 461 flow [2023-01-28 08:00:38,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 08:00:38,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 08:00:38,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 752 transitions. [2023-01-28 08:00:38,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3949579831932773 [2023-01-28 08:00:38,882 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 752 transitions. [2023-01-28 08:00:38,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 752 transitions. [2023-01-28 08:00:38,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:00:38,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 752 transitions. [2023-01-28 08:00:38,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 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:38,886 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 08:00:38,887 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 08:00:38,887 INFO L175 Difference]: Start difference. First operand has 87 places, 58 transitions, 252 flow. Second operand 4 states and 752 transitions. [2023-01-28 08:00:38,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 76 transitions, 461 flow [2023-01-28 08:00:38,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 76 transitions, 445 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-28 08:00:38,889 INFO L231 Difference]: Finished difference. Result has 84 places, 60 transitions, 286 flow [2023-01-28 08:00:38,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=286, PETRI_PLACES=84, PETRI_TRANSITIONS=60} [2023-01-28 08:00:38,890 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 16 predicate places. [2023-01-28 08:00:38,890 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 60 transitions, 286 flow [2023-01-28 08:00:38,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 177.4) internal successors, (887), 5 states have internal predecessors, (887), 0 states have call successors, (0), 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:38,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:00:38,890 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:38,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-01-28 08:00:38,890 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:38,890 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:00:38,890 INFO L85 PathProgramCache]: Analyzing trace with hash 603317954, now seen corresponding path program 1 times [2023-01-28 08:00:38,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:00:38,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591369618] [2023-01-28 08:00:38,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:00:38,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:00:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:00:41,759 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:00:41,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:00:41,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591369618] [2023-01-28 08:00:41,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591369618] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:00:41,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914151733] [2023-01-28 08:00:41,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:00:41,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:00:41,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:00:41,761 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:41,782 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:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:00:41,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 35 conjunts are in the unsatisfiable core [2023-01-28 08:00:41,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:00:41,908 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:41,976 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:00:41,977 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:42,003 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:42,038 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:42,062 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 13 treesize of output 9 [2023-01-28 08:00:42,123 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:00:42,123 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 19 treesize of output 11 [2023-01-28 08:00:42,171 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 18 treesize of output 13 [2023-01-28 08:00:42,241 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:42,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:00:42,328 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 15 treesize of output 13 [2023-01-28 08:00:42,331 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 12 treesize of output 8 [2023-01-28 08:00:50,407 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_588 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_65| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_61| Int) (v_ArrVal_585 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_61| |v_t_funThread2of2ForFork0_~p~0#1.offset_65|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_585) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_61| v_ArrVal_588) |v_t_funThread2of2ForFork0_~p~0#1.offset_65|) 0))) is different from false [2023-01-28 08:00:50,567 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:50,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914151733] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:00:50,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:00:50,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6, 6] total 28 [2023-01-28 08:00:50,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869103209] [2023-01-28 08:00:50,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:00:50,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-01-28 08:00:50,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:00:50,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-01-28 08:00:50,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=664, Unknown=2, NotChecked=54, Total=870 [2023-01-28 08:00:50,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 476 [2023-01-28 08:00:50,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 60 transitions, 286 flow. Second operand has 30 states, 30 states have (on average 148.06666666666666) internal successors, (4442), 30 states have internal predecessors, (4442), 0 states have call successors, (0), 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:50,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:00:50,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 476 [2023-01-28 08:00:50,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:01:08,714 WARN L222 SmtUtils]: Spent 18.03s on a formula simplification. DAG size of input: 32 DAG size of output: 27 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:01:10,716 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:01:12,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:01:14,728 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:01:16,746 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:01:17,471 INFO L130 PetriNetUnfolder]: 852/1699 cut-off events. [2023-01-28 08:01:17,471 INFO L131 PetriNetUnfolder]: For 1303/1309 co-relation queries the response was YES. [2023-01-28 08:01:17,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4771 conditions, 1699 events. 852/1699 cut-off events. For 1303/1309 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 10212 event pairs, 93 based on Foata normal form. 24/1549 useless extension candidates. Maximal degree in co-relation 4710. Up to 697 conditions per place. [2023-01-28 08:01:17,476 INFO L137 encePairwiseOnDemand]: 465/476 looper letters, 94 selfloop transitions, 35 changer transitions 24/159 dead transitions. [2023-01-28 08:01:17,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 159 transitions, 967 flow [2023-01-28 08:01:17,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-01-28 08:01:17,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-01-28 08:01:17,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 3797 transitions. [2023-01-28 08:01:17,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31907563025210084 [2023-01-28 08:01:17,481 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 3797 transitions. [2023-01-28 08:01:17,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 3797 transitions. [2023-01-28 08:01:17,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:01:17,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 3797 transitions. [2023-01-28 08:01:17,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 151.88) internal successors, (3797), 25 states have internal predecessors, (3797), 0 states have call successors, (0), 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:17,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 476.0) internal successors, (12376), 26 states have internal predecessors, (12376), 0 states have call successors, (0), 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:17,495 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 476.0) internal successors, (12376), 26 states have internal predecessors, (12376), 0 states have call successors, (0), 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:17,495 INFO L175 Difference]: Start difference. First operand has 84 places, 60 transitions, 286 flow. Second operand 25 states and 3797 transitions. [2023-01-28 08:01:17,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 159 transitions, 967 flow [2023-01-28 08:01:17,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 159 transitions, 966 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 08:01:17,499 INFO L231 Difference]: Finished difference. Result has 111 places, 81 transitions, 490 flow [2023-01-28 08:01:17,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=490, PETRI_PLACES=111, PETRI_TRANSITIONS=81} [2023-01-28 08:01:17,499 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 43 predicate places. [2023-01-28 08:01:17,499 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 81 transitions, 490 flow [2023-01-28 08:01:17,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 148.06666666666666) internal successors, (4442), 30 states have internal predecessors, (4442), 0 states have call successors, (0), 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:17,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:01:17,500 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:17,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-01-28 08:01:17,704 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:17,705 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:17,705 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:01:17,705 INFO L85 PathProgramCache]: Analyzing trace with hash 191055260, now seen corresponding path program 2 times [2023-01-28 08:01:17,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:01:17,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944636841] [2023-01-28 08:01:17,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:01:17,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:01:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:01:18,092 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:18,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:01:18,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944636841] [2023-01-28 08:01:18,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944636841] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:01:18,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111575744] [2023-01-28 08:01:18,092 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 08:01:18,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:01:18,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:01:18,093 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:18,095 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:18,193 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 08:01:18,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:01:18,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 38 conjunts are in the unsatisfiable core [2023-01-28 08:01:18,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:01:18,201 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:18,276 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:01:18,277 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:18,295 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:18,319 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:18,336 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 13 treesize of output 9 [2023-01-28 08:01:18,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:01:18,377 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 16 treesize of output 18 [2023-01-28 08:01:18,403 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 18 treesize of output 13 [2023-01-28 08:01:18,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:01:18,429 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 16 treesize of output 18 [2023-01-28 08:01:18,455 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:01:18,456 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 19 treesize of output 11 [2023-01-28 08:01:18,483 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:18,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:01:18,509 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_67| Int) (v_ArrVal_676 (Array Int Int))) (or (= (select (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_67|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_676) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_67|)) 0)))) is different from false [2023-01-28 08:01:18,561 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:01:18,562 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 23 treesize of output 24 [2023-01-28 08:01:18,568 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:01:18,569 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 39 treesize of output 35 [2023-01-28 08:01:18,573 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 22 treesize of output 18 [2023-01-28 08:01:28,652 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_674 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_67| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_63| Int) (v_ArrVal_670 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_670) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_63| v_ArrVal_674) |v_t_funThread2of2ForFork0_~p~0#1.offset_67|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_63| |v_t_funThread2of2ForFork0_~p~0#1.offset_67|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-01-28 08:01:30,719 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:30,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111575744] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:01:30,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:01:30,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2023-01-28 08:01:30,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274421864] [2023-01-28 08:01:30,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:01:30,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-01-28 08:01:30,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:01:30,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-01-28 08:01:30,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=282, Unknown=5, NotChecked=74, Total=462 [2023-01-28 08:01:30,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 476 [2023-01-28 08:01:30,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 81 transitions, 490 flow. Second operand has 22 states, 22 states have (on average 153.3181818181818) internal successors, (3373), 22 states have internal predecessors, (3373), 0 states have call successors, (0), 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:30,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:01:30,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 476 [2023-01-28 08:01:30,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:01:33,419 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:01:33,644 INFO L130 PetriNetUnfolder]: 1022/2047 cut-off events. [2023-01-28 08:01:33,644 INFO L131 PetriNetUnfolder]: For 2584/2590 co-relation queries the response was YES. [2023-01-28 08:01:33,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6392 conditions, 2047 events. 1022/2047 cut-off events. For 2584/2590 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 13117 event pairs, 99 based on Foata normal form. 12/1858 useless extension candidates. Maximal degree in co-relation 6316. Up to 885 conditions per place. [2023-01-28 08:01:33,650 INFO L137 encePairwiseOnDemand]: 465/476 looper letters, 98 selfloop transitions, 36 changer transitions 24/164 dead transitions. [2023-01-28 08:01:33,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 164 transitions, 1149 flow [2023-01-28 08:01:33,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-01-28 08:01:33,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-01-28 08:01:33,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2089 transitions. [2023-01-28 08:01:33,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3375888817065288 [2023-01-28 08:01:33,653 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2089 transitions. [2023-01-28 08:01:33,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2089 transitions. [2023-01-28 08:01:33,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:01:33,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2089 transitions. [2023-01-28 08:01:33,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 160.69230769230768) internal successors, (2089), 13 states have internal predecessors, (2089), 0 states have call successors, (0), 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:33,663 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:01:33,663 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:01:33,663 INFO L175 Difference]: Start difference. First operand has 111 places, 81 transitions, 490 flow. Second operand 13 states and 2089 transitions. [2023-01-28 08:01:33,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 164 transitions, 1149 flow [2023-01-28 08:01:33,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 164 transitions, 1043 flow, removed 24 selfloop flow, removed 22 redundant places. [2023-01-28 08:01:33,669 INFO L231 Difference]: Finished difference. Result has 105 places, 98 transitions, 599 flow [2023-01-28 08:01:33,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=599, PETRI_PLACES=105, PETRI_TRANSITIONS=98} [2023-01-28 08:01:33,670 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 37 predicate places. [2023-01-28 08:01:33,670 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 98 transitions, 599 flow [2023-01-28 08:01:33,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 153.3181818181818) internal successors, (3373), 22 states have internal predecessors, (3373), 0 states have call successors, (0), 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:33,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:01:33,671 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:33,678 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:33,878 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:33,878 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:33,878 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:01:33,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1012129974, now seen corresponding path program 3 times [2023-01-28 08:01:33,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:01:33,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911724943] [2023-01-28 08:01:33,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:01:33,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:01:33,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:01:34,339 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:01:34,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:01:34,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911724943] [2023-01-28 08:01:34,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911724943] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:01:34,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177391206] [2023-01-28 08:01:34,339 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 08:01:34,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:01:34,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:01:34,357 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:34,358 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:34,452 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-28 08:01:34,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:01:34,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 38 conjunts are in the unsatisfiable core [2023-01-28 08:01:34,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:01:34,463 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:34,546 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:01:34,546 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:34,576 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:34,627 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 13 treesize of output 9 [2023-01-28 08:01:34,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:01:34,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 16 treesize of output 18 [2023-01-28 08:01:34,705 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 18 treesize of output 13 [2023-01-28 08:01:34,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:01:34,740 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 16 treesize of output 18 [2023-01-28 08:01:34,793 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 16 treesize of output 18 [2023-01-28 08:01:34,838 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:01:34,841 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 19 treesize of output 11 [2023-01-28 08:01:34,876 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:01:34,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:01:35,047 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:01:35,047 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 23 treesize of output 24 [2023-01-28 08:01:35,055 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:01:35,056 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 39 treesize of output 35 [2023-01-28 08:01:35,061 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 22 treesize of output 18 [2023-01-28 08:01:35,082 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_69| Int) (v_ArrVal_761 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_65| Int) (v_ArrVal_763 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_65| v_ArrVal_761)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_763) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_69|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_65| |v_t_funThread2of2ForFork0_~p~0#1.offset_69|))) (or (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_69| Int) (v_ArrVal_761 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_65| Int) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_65| v_ArrVal_761)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_763) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_69|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))))) is different from false [2023-01-28 08:01:35,427 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_69| Int) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_761 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_65| Int) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_756))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_65| v_ArrVal_761))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_763) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_69|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_69| Int) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_761 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_65| Int) (v_ArrVal_763 (Array Int Int))) (or (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_756))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_65| v_ArrVal_761))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_763) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_69|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_65| |v_t_funThread2of2ForFork0_~p~0#1.offset_69|)))) is different from false [2023-01-28 08:01:43,501 WARN L222 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:01:43,649 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:01:43,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177391206] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:01:43,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:01:43,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 22 [2023-01-28 08:01:43,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193675396] [2023-01-28 08:01:43,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:01:43,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-01-28 08:01:43,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:01:43,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-01-28 08:01:43,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=348, Unknown=9, NotChecked=82, Total=552 [2023-01-28 08:01:43,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 476 [2023-01-28 08:01:43,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 98 transitions, 599 flow. Second operand has 24 states, 24 states have (on average 151.125) internal successors, (3627), 24 states have internal predecessors, (3627), 0 states have call successors, (0), 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,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:01:43,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 476 [2023-01-28 08:01:43,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:01:44,071 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_69| Int)) (or (= (select (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_69|) 0) (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_69|)) 0)))) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_69| Int) (v_ArrVal_761 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (or (= 0 (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_761)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_763) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_69|)) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_762) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_69|)) 0)))) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_69| Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_762) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_69|)) 0)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_763) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_69|) 0)))) is different from false [2023-01-28 08:01:44,762 INFO L130 PetriNetUnfolder]: 1174/2384 cut-off events. [2023-01-28 08:01:44,762 INFO L131 PetriNetUnfolder]: For 4225/4231 co-relation queries the response was YES. [2023-01-28 08:01:44,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8115 conditions, 2384 events. 1174/2384 cut-off events. For 4225/4231 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 16102 event pairs, 112 based on Foata normal form. 12/2170 useless extension candidates. Maximal degree in co-relation 8061. Up to 838 conditions per place. [2023-01-28 08:01:44,771 INFO L137 encePairwiseOnDemand]: 461/476 looper letters, 122 selfloop transitions, 50 changer transitions 25/203 dead transitions. [2023-01-28 08:01:44,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 203 transitions, 1542 flow [2023-01-28 08:01:44,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-01-28 08:01:44,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-01-28 08:01:44,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2365 transitions. [2023-01-28 08:01:44,774 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33123249299719887 [2023-01-28 08:01:44,774 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2365 transitions. [2023-01-28 08:01:44,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2365 transitions. [2023-01-28 08:01:44,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:01:44,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2365 transitions. [2023-01-28 08:01:44,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 157.66666666666666) internal successors, (2365), 15 states have internal predecessors, (2365), 0 states have call successors, (0), 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:44,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 476.0) internal successors, (7616), 16 states have internal predecessors, (7616), 0 states have call successors, (0), 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:44,784 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 476.0) internal successors, (7616), 16 states have internal predecessors, (7616), 0 states have call successors, (0), 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:44,784 INFO L175 Difference]: Start difference. First operand has 105 places, 98 transitions, 599 flow. Second operand 15 states and 2365 transitions. [2023-01-28 08:01:44,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 203 transitions, 1542 flow [2023-01-28 08:01:44,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 203 transitions, 1414 flow, removed 50 selfloop flow, removed 7 redundant places. [2023-01-28 08:01:44,797 INFO L231 Difference]: Finished difference. Result has 116 places, 131 transitions, 900 flow [2023-01-28 08:01:44,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=900, PETRI_PLACES=116, PETRI_TRANSITIONS=131} [2023-01-28 08:01:44,798 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 48 predicate places. [2023-01-28 08:01:44,798 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 131 transitions, 900 flow [2023-01-28 08:01:44,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 151.125) internal successors, (3627), 24 states have internal predecessors, (3627), 0 states have call successors, (0), 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:44,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:01:44,798 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:44,818 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:45,003 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:45,004 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:45,004 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:01:45,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1245507454, now seen corresponding path program 1 times [2023-01-28 08:01:45,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:01:45,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224682365] [2023-01-28 08:01:45,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:01:45,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:01:45,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:01:45,212 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:45,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:01:45,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224682365] [2023-01-28 08:01:45,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224682365] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:01:45,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623364594] [2023-01-28 08:01:45,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:01:45,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:01:45,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:01:45,213 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:45,215 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:45,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:01:45,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 35 conjunts are in the unsatisfiable core [2023-01-28 08:01:45,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:01:45,324 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:45,366 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:01:45,367 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:45,384 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:45,402 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:45,418 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 13 treesize of output 9 [2023-01-28 08:01:45,460 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:01:45,460 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 19 treesize of output 11 [2023-01-28 08:01:45,507 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 18 treesize of output 13 [2023-01-28 08:01:45,536 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:45,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:01:45,592 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 15 treesize of output 13 [2023-01-28 08:01:45,595 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 12 treesize of output 8 [2023-01-28 08:01:57,652 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_67| Int) (v_ArrVal_844 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_71| Int) (v_ArrVal_848 Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_67| |v_t_funThread2of2ForFork0_~p~0#1.offset_71|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_844) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_71| v_ArrVal_848) |v_t_funThread1of2ForFork0_~p~0#1.offset_67|) 0))) is different from false [2023-01-28 08:01:57,791 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:57,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623364594] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:01:57,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:01:57,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2023-01-28 08:01:57,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678818665] [2023-01-28 08:01:57,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:01:57,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-01-28 08:01:57,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:01:57,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-01-28 08:01:57,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=4, NotChecked=30, Total=306 [2023-01-28 08:01:57,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 476 [2023-01-28 08:01:57,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 131 transitions, 900 flow. Second operand has 18 states, 18 states have (on average 154.72222222222223) internal successors, (2785), 18 states have internal predecessors, (2785), 0 states have call successors, (0), 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:57,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:01:57,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 476 [2023-01-28 08:01:57,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:01:58,258 INFO L130 PetriNetUnfolder]: 1239/2535 cut-off events. [2023-01-28 08:01:58,258 INFO L131 PetriNetUnfolder]: For 4957/4963 co-relation queries the response was YES. [2023-01-28 08:01:58,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9459 conditions, 2535 events. 1239/2535 cut-off events. For 4957/4963 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 17548 event pairs, 200 based on Foata normal form. 12/2312 useless extension candidates. Maximal degree in co-relation 9402. Up to 1669 conditions per place. [2023-01-28 08:01:58,269 INFO L137 encePairwiseOnDemand]: 466/476 looper letters, 144 selfloop transitions, 18 changer transitions 16/184 dead transitions. [2023-01-28 08:01:58,269 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 184 transitions, 1491 flow [2023-01-28 08:01:58,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 08:01:58,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 08:01:58,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1465 transitions. [2023-01-28 08:01:58,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3419701213818861 [2023-01-28 08:01:58,271 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1465 transitions. [2023-01-28 08:01:58,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1465 transitions. [2023-01-28 08:01:58,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:01:58,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1465 transitions. [2023-01-28 08:01:58,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 162.77777777777777) internal successors, (1465), 9 states have internal predecessors, (1465), 0 states have call successors, (0), 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:58,281 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:01:58,281 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:01:58,281 INFO L175 Difference]: Start difference. First operand has 116 places, 131 transitions, 900 flow. Second operand 9 states and 1465 transitions. [2023-01-28 08:01:58,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 184 transitions, 1491 flow [2023-01-28 08:01:58,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 184 transitions, 1454 flow, removed 8 selfloop flow, removed 5 redundant places. [2023-01-28 08:01:58,293 INFO L231 Difference]: Finished difference. Result has 122 places, 135 transitions, 945 flow [2023-01-28 08:01:58,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=864, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=945, PETRI_PLACES=122, PETRI_TRANSITIONS=135} [2023-01-28 08:01:58,293 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 54 predicate places. [2023-01-28 08:01:58,293 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 135 transitions, 945 flow [2023-01-28 08:01:58,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 154.72222222222223) internal successors, (2785), 18 states have internal predecessors, (2785), 0 states have call successors, (0), 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:58,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:01:58,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] [2023-01-28 08:01:58,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-01-28 08:01:58,499 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:01:58,499 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:01:58,500 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:01:58,500 INFO L85 PathProgramCache]: Analyzing trace with hash -567793192, now seen corresponding path program 4 times [2023-01-28 08:01:58,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:01:58,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018319829] [2023-01-28 08:01:58,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:01:58,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:01:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:01:58,797 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:58,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:01:58,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018319829] [2023-01-28 08:01:58,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018319829] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:01:58,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034260436] [2023-01-28 08:01:58,798 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-28 08:01:58,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:01:58,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:01:58,810 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:01:58,812 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:01:58,917 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-28 08:01:58,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:01:58,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 35 conjunts are in the unsatisfiable core [2023-01-28 08:01:58,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:01:58,924 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:58,989 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:01:58,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:01:59,008 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:59,030 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:59,053 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 13 treesize of output 9 [2023-01-28 08:01:59,095 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:01:59,097 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 19 treesize of output 11 [2023-01-28 08:01:59,142 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 18 treesize of output 13 [2023-01-28 08:01:59,174 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:59,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:01:59,242 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 15 treesize of output 13 [2023-01-28 08:01:59,245 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 12 treesize of output 8 [2023-01-28 08:02:05,307 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_69| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_73| Int) (v_ArrVal_929 (Array Int Int)) (v_ArrVal_933 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_929) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_69| v_ArrVal_933) |v_t_funThread2of2ForFork0_~p~0#1.offset_73|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_69| |v_t_funThread2of2ForFork0_~p~0#1.offset_73|))) is different from false [2023-01-28 08:02:05,440 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:05,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034260436] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:02:05,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:02:05,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2023-01-28 08:02:05,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696795977] [2023-01-28 08:02:05,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:02:05,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-01-28 08:02:05,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:02:05,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-01-28 08:02:05,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=275, Unknown=3, NotChecked=34, Total=380 [2023-01-28 08:02:05,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 476 [2023-01-28 08:02:05,445 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 135 transitions, 945 flow. Second operand has 20 states, 20 states have (on average 153.65) internal successors, (3073), 20 states have internal predecessors, (3073), 0 states have call successors, (0), 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:05,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:02:05,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 476 [2023-01-28 08:02:05,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:02:06,018 INFO L130 PetriNetUnfolder]: 1261/2616 cut-off events. [2023-01-28 08:02:06,018 INFO L131 PetriNetUnfolder]: For 5733/5745 co-relation queries the response was YES. [2023-01-28 08:02:06,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10024 conditions, 2616 events. 1261/2616 cut-off events. For 5733/5745 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 18420 event pairs, 215 based on Foata normal form. 12/2385 useless extension candidates. Maximal degree in co-relation 9964. Up to 1750 conditions per place. [2023-01-28 08:02:06,030 INFO L137 encePairwiseOnDemand]: 466/476 looper letters, 151 selfloop transitions, 19 changer transitions 17/193 dead transitions. [2023-01-28 08:02:06,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 193 transitions, 1618 flow [2023-01-28 08:02:06,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 08:02:06,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 08:02:06,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1457 transitions. [2023-01-28 08:02:06,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3401027077497666 [2023-01-28 08:02:06,032 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1457 transitions. [2023-01-28 08:02:06,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1457 transitions. [2023-01-28 08:02:06,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:02:06,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1457 transitions. [2023-01-28 08:02:06,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 161.88888888888889) internal successors, (1457), 9 states have internal predecessors, (1457), 0 states have call successors, (0), 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:06,036 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:02:06,036 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:02:06,036 INFO L175 Difference]: Start difference. First operand has 122 places, 135 transitions, 945 flow. Second operand 9 states and 1457 transitions. [2023-01-28 08:02:06,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 193 transitions, 1618 flow [2023-01-28 08:02:06,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 193 transitions, 1581 flow, removed 9 selfloop flow, removed 4 redundant places. [2023-01-28 08:02:06,052 INFO L231 Difference]: Finished difference. Result has 129 places, 142 transitions, 1034 flow [2023-01-28 08:02:06,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=908, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1034, PETRI_PLACES=129, PETRI_TRANSITIONS=142} [2023-01-28 08:02:06,053 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 61 predicate places. [2023-01-28 08:02:06,053 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 142 transitions, 1034 flow [2023-01-28 08:02:06,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 153.65) internal successors, (3073), 20 states have internal predecessors, (3073), 0 states have call successors, (0), 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:06,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:02:06,053 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:02:06,059 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:02:06,259 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:02:06,259 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:02:06,260 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:02:06,260 INFO L85 PathProgramCache]: Analyzing trace with hash -7444614, now seen corresponding path program 2 times [2023-01-28 08:02:06,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:02:06,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857168265] [2023-01-28 08:02:06,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:02:06,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:02:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:02:06,529 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:02:06,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:02:06,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857168265] [2023-01-28 08:02:06,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857168265] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:02:06,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348064902] [2023-01-28 08:02:06,529 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 08:02:06,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:02:06,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:02:06,530 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:02:06,568 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:02:06,663 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 08:02:06,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:02:06,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 35 conjunts are in the unsatisfiable core [2023-01-28 08:02:06,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:02:06,669 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:02:06,724 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:02:06,724 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:02:06,747 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:02:06,767 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:02: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 13 treesize of output 9 [2023-01-28 08:02:06,821 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:02:06,822 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 19 treesize of output 11 [2023-01-28 08:02:06,872 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 18 treesize of output 13 [2023-01-28 08:02:06,899 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:02:06,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:02:06,958 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 15 treesize of output 13 [2023-01-28 08:02:06,961 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 12 treesize of output 8 [2023-01-28 08:02:14,995 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_75| Int) (v_ArrVal_1014 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_71| Int) (v_ArrVal_1018 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1014) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_75| v_ArrVal_1018) |v_t_funThread1of2ForFork0_~p~0#1.offset_71|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_71| |v_t_funThread2of2ForFork0_~p~0#1.offset_75|))) is different from false [2023-01-28 08:02:15,100 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:15,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348064902] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:02:15,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:02:15,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2023-01-28 08:02:15,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168829429] [2023-01-28 08:02:15,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:02:15,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-01-28 08:02:15,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:02:15,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-01-28 08:02:15,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=4, NotChecked=26, Total=240 [2023-01-28 08:02:15,102 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 476 [2023-01-28 08:02:15,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 142 transitions, 1034 flow. Second operand has 16 states, 16 states have (on average 154.6875) internal successors, (2475), 16 states have internal predecessors, (2475), 0 states have call successors, (0), 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:15,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:02:15,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 476 [2023-01-28 08:02:15,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:02:15,753 INFO L130 PetriNetUnfolder]: 1434/2993 cut-off events. [2023-01-28 08:02:15,753 INFO L131 PetriNetUnfolder]: For 7111/7129 co-relation queries the response was YES. [2023-01-28 08:02:15,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11513 conditions, 2993 events. 1434/2993 cut-off events. For 7111/7129 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 21990 event pairs, 257 based on Foata normal form. 24/2735 useless extension candidates. Maximal degree in co-relation 11449. Up to 1942 conditions per place. [2023-01-28 08:02:15,764 INFO L137 encePairwiseOnDemand]: 466/476 looper letters, 170 selfloop transitions, 27 changer transitions 21/224 dead transitions. [2023-01-28 08:02:15,764 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 224 transitions, 1865 flow [2023-01-28 08:02:15,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-28 08:02:15,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-01-28 08:02:15,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2258 transitions. [2023-01-28 08:02:15,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33883553421368545 [2023-01-28 08:02:15,767 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2258 transitions. [2023-01-28 08:02:15,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2258 transitions. [2023-01-28 08:02:15,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:02:15,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2258 transitions. [2023-01-28 08:02:15,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 161.28571428571428) internal successors, (2258), 14 states have internal predecessors, (2258), 0 states have call successors, (0), 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:15,772 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:02:15,772 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:02:15,772 INFO L175 Difference]: Start difference. First operand has 129 places, 142 transitions, 1034 flow. Second operand 14 states and 2258 transitions. [2023-01-28 08:02:15,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 224 transitions, 1865 flow [2023-01-28 08:02:15,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 224 transitions, 1825 flow, removed 6 selfloop flow, removed 5 redundant places. [2023-01-28 08:02:15,786 INFO L231 Difference]: Finished difference. Result has 141 places, 152 transitions, 1173 flow [2023-01-28 08:02:15,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=994, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1173, PETRI_PLACES=141, PETRI_TRANSITIONS=152} [2023-01-28 08:02:15,787 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 73 predicate places. [2023-01-28 08:02:15,787 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 152 transitions, 1173 flow [2023-01-28 08:02:15,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 154.6875) internal successors, (2475), 16 states have internal predecessors, (2475), 0 states have call successors, (0), 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:15,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:02:15,787 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:02:15,793 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:02:15,992 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:02:15,992 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:02:15,993 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:02:15,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1898646590, now seen corresponding path program 3 times [2023-01-28 08:02:15,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:02:15,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182409470] [2023-01-28 08:02:15,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:02:15,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:02:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:02:16,254 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:02:16,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:02:16,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182409470] [2023-01-28 08:02:16,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182409470] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:02:16,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280001592] [2023-01-28 08:02:16,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 08:02:16,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:02:16,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:02:16,255 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:02:16,257 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:02:16,361 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-28 08:02:16,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:02:16,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 38 conjunts are in the unsatisfiable core [2023-01-28 08:02:16,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:02:16,367 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:02:16,446 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:02:16,446 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:02:16,464 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:02:16,488 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:02:16,515 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 13 treesize of output 9 [2023-01-28 08:02:16,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:02:16,557 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 16 treesize of output 18 [2023-01-28 08:02:16,581 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 18 treesize of output 13 [2023-01-28 08:02:16,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:02:16,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 16 treesize of output 18 [2023-01-28 08:02:16,635 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:02:16,635 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 19 treesize of output 11 [2023-01-28 08:02:16,663 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:02:16,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:02:16,712 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1105 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_73| Int) (v_ArrVal_1104 Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1105) |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_73| 4)) 0)) (= 0 (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1104)) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_73|)))) is different from false [2023-01-28 08:02:16,740 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:02:16,740 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 23 treesize of output 24 [2023-01-28 08:02:16,747 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:02:16,747 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 39 treesize of output 35 [2023-01-28 08:02:16,751 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 22 treesize of output 18 [2023-01-28 08:02:29,014 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:02:29,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280001592] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:02:29,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:02:29,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2023-01-28 08:02:29,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567820935] [2023-01-28 08:02:29,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:02:29,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-01-28 08:02:29,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:02:29,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-01-28 08:02:29,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=272, Unknown=4, NotChecked=36, Total=420 [2023-01-28 08:02:29,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 476 [2023-01-28 08:02:29,018 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 152 transitions, 1173 flow. Second operand has 21 states, 21 states have (on average 153.38095238095238) internal successors, (3221), 21 states have internal predecessors, (3221), 0 states have call successors, (0), 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:29,018 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:02:29,018 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 476 [2023-01-28 08:02:29,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:02:29,736 INFO L130 PetriNetUnfolder]: 1414/2995 cut-off events. [2023-01-28 08:02:29,736 INFO L131 PetriNetUnfolder]: For 7809/7809 co-relation queries the response was YES. [2023-01-28 08:02:29,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11735 conditions, 2995 events. 1414/2995 cut-off events. For 7809/7809 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 22340 event pairs, 227 based on Foata normal form. 3/2713 useless extension candidates. Maximal degree in co-relation 11667. Up to 1981 conditions per place. [2023-01-28 08:02:29,750 INFO L137 encePairwiseOnDemand]: 467/476 looper letters, 149 selfloop transitions, 29 changer transitions 13/197 dead transitions. [2023-01-28 08:02:29,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 197 transitions, 1785 flow [2023-01-28 08:02:29,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 08:02:29,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 08:02:29,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1450 transitions. [2023-01-28 08:02:29,752 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.338468720821662 [2023-01-28 08:02:29,752 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1450 transitions. [2023-01-28 08:02:29,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1450 transitions. [2023-01-28 08:02:29,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:02:29,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1450 transitions. [2023-01-28 08:02:29,754 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 161.11111111111111) internal successors, (1450), 9 states have internal predecessors, (1450), 0 states have call successors, (0), 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:29,756 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:02:29,756 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:02:29,756 INFO L175 Difference]: Start difference. First operand has 141 places, 152 transitions, 1173 flow. Second operand 9 states and 1450 transitions. [2023-01-28 08:02:29,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 197 transitions, 1785 flow [2023-01-28 08:02:29,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 197 transitions, 1686 flow, removed 39 selfloop flow, removed 6 redundant places. [2023-01-28 08:02:29,781 INFO L231 Difference]: Finished difference. Result has 145 places, 158 transitions, 1223 flow [2023-01-28 08:02:29,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1084, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1223, PETRI_PLACES=145, PETRI_TRANSITIONS=158} [2023-01-28 08:02:29,782 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 77 predicate places. [2023-01-28 08:02:29,782 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 158 transitions, 1223 flow [2023-01-28 08:02:29,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 153.38095238095238) internal successors, (3221), 21 states have internal predecessors, (3221), 0 states have call successors, (0), 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:29,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:02:29,783 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:02:29,808 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:02:29,988 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:02:29,989 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:02:29,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:02:29,989 INFO L85 PathProgramCache]: Analyzing trace with hash -21624520, now seen corresponding path program 5 times [2023-01-28 08:02:29,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:02:29,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812411829] [2023-01-28 08:02:29,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:02:29,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:02:30,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:02:30,229 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:02:30,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:02:30,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812411829] [2023-01-28 08:02:30,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812411829] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:02:30,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977085849] [2023-01-28 08:02:30,230 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-28 08:02:30,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:02:30,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:02:30,231 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:02:30,232 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:02:30,588 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-01-28 08:02:30,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:02:30,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 38 conjunts are in the unsatisfiable core [2023-01-28 08:02:30,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:02:30,600 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:02:30,692 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:02:30,692 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:02:30,715 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:02:30,745 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:02:30,762 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 13 treesize of output 9 [2023-01-28 08:02:30,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:02:30,818 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 16 treesize of output 18 [2023-01-28 08:02:30,891 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:02:30,891 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 19 treesize of output 11 [2023-01-28 08:02:30,923 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 18 treesize of output 13 [2023-01-28 08:02:30,983 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 16 treesize of output 18 [2023-01-28 08:02:31,013 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:02:31,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:02:31,020 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1196 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1196) |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:02:31,142 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:02:31,142 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 23 treesize of output 24 [2023-01-28 08:02:31,148 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:02:31,148 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 39 treesize of output 35 [2023-01-28 08:02:31,152 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 22 treesize of output 18 [2023-01-28 08:02:31,190 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_79| Int) (v_ArrVal_1195 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_75| Int) (v_ArrVal_1196 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_75| |v_t_funThread2of2ForFork0_~p~0#1.offset_79|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_75| v_ArrVal_1195)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1196) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_79|) 0))) (or (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_79| Int) (v_ArrVal_1195 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_75| Int) (v_ArrVal_1196 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_75| v_ArrVal_1195)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1196) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_79|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))))) is different from false [2023-01-28 08:02:31,425 WARN L839 $PredicateComparison]: unable to prove that (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_79| Int) (v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1195 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_75| Int) (v_ArrVal_1196 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1190))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_75| v_ArrVal_1195))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1196) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_79|) 0))) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_79| Int) (v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1195 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_75| Int) (v_ArrVal_1196 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_75| |v_t_funThread2of2ForFork0_~p~0#1.offset_79|) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1190))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_75| v_ArrVal_1195))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1196) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_79|) 0)))) is different from false [2023-01-28 08:02:39,548 WARN L222 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:02:39,717 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:02:39,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977085849] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:02:39,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:02:39,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 20 [2023-01-28 08:02:39,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385517698] [2023-01-28 08:02:39,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:02:39,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-01-28 08:02:39,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:02:39,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-01-28 08:02:39,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=275, Unknown=10, NotChecked=108, Total=462 [2023-01-28 08:02:39,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 476 [2023-01-28 08:02:39,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 158 transitions, 1223 flow. Second operand has 22 states, 22 states have (on average 153.5) internal successors, (3377), 22 states have internal predecessors, (3377), 0 states have call successors, (0), 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:39,722 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:02:39,722 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 476 [2023-01-28 08:02:39,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:02:42,083 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:02:42,277 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (and (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_79| Int) (v_ArrVal_1195 Int) (v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1193 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1195)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1196) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_79|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1193) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_79|)) 0)))) (not (= |c_t_funThread2of2ForFork0_~p~0#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (= (select (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_79| Int) (v_ArrVal_1195 Int) (v_ArrVal_1196 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1195)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1196) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_79|) 0) (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_79|)) 0)))) (forall ((v_ArrVal_1195 Int) (v_ArrVal_1196 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1195)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1196) |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0)))) is different from false [2023-01-28 08:02:42,500 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (and (= (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_79| Int) (v_ArrVal_1195 Int) (v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1193 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1195)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1196) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_79|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1193) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_79|)) 0)))) (exists ((v_ArrVal_1195 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (and (= (store ((as const (Array Int Int)) 0) |t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1195) (select |c_#memory_int| 4)) (not (= |c_t_funThread2of2ForFork0_~p~0#1.offset| |t_funThread1of2ForFork0_~p~0#1.offset|)))) (= |c_t_funThread2of2ForFork0_~p~0#1.base| 4) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)) (not (= |c_t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread1of2ForFork0_~p~0#1.offset|)) (= |c_t_funThread2of2ForFork0_~p~0#1.base| |c_t_funThread1of2ForFork0_~p~0#1.base|) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_79| Int) (v_ArrVal_1195 Int) (v_ArrVal_1196 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1195)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1196) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_79|) 0) (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_79|)) 0)))))) is different from false [2023-01-28 08:02:44,928 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:02:47,425 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:02:49,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:02:50,959 INFO L130 PetriNetUnfolder]: 1736/3747 cut-off events. [2023-01-28 08:02:50,960 INFO L131 PetriNetUnfolder]: For 9807/9831 co-relation queries the response was YES. [2023-01-28 08:02:50,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14684 conditions, 3747 events. 1736/3747 cut-off events. For 9807/9831 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 30029 event pairs, 251 based on Foata normal form. 14/3424 useless extension candidates. Maximal degree in co-relation 14613. Up to 2159 conditions per place. [2023-01-28 08:02:50,977 INFO L137 encePairwiseOnDemand]: 459/476 looper letters, 185 selfloop transitions, 52 changer transitions 104/347 dead transitions. [2023-01-28 08:02:50,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 347 transitions, 3051 flow [2023-01-28 08:02:50,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-01-28 08:02:50,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-01-28 08:02:50,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3359 transitions. [2023-01-28 08:02:50,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3360344137655062 [2023-01-28 08:02:51,008 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3359 transitions. [2023-01-28 08:02:51,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3359 transitions. [2023-01-28 08:02:51,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:02:51,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3359 transitions. [2023-01-28 08:02:51,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 159.95238095238096) internal successors, (3359), 21 states have internal predecessors, (3359), 0 states have call successors, (0), 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:51,017 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 476.0) internal successors, (10472), 22 states have internal predecessors, (10472), 0 states have call successors, (0), 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:51,018 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 476.0) internal successors, (10472), 22 states have internal predecessors, (10472), 0 states have call successors, (0), 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:51,018 INFO L175 Difference]: Start difference. First operand has 145 places, 158 transitions, 1223 flow. Second operand 21 states and 3359 transitions. [2023-01-28 08:02:51,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 347 transitions, 3051 flow [2023-01-28 08:02:51,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 347 transitions, 3004 flow, removed 13 selfloop flow, removed 5 redundant places. [2023-01-28 08:02:51,061 INFO L231 Difference]: Finished difference. Result has 172 places, 193 transitions, 1671 flow [2023-01-28 08:02:51,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1176, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1671, PETRI_PLACES=172, PETRI_TRANSITIONS=193} [2023-01-28 08:02:51,062 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 104 predicate places. [2023-01-28 08:02:51,062 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 193 transitions, 1671 flow [2023-01-28 08:02:51,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 153.5) internal successors, (3377), 22 states have internal predecessors, (3377), 0 states have call successors, (0), 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:51,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:02:51,063 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:02:51,069 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:02:51,269 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:02:51,269 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:02:51,269 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:02:51,269 INFO L85 PathProgramCache]: Analyzing trace with hash -22256920, now seen corresponding path program 6 times [2023-01-28 08:02:51,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:02:51,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558296295] [2023-01-28 08:02:51,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:02:51,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:02:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:02:53,665 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 08:02:53,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:02:53,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558296295] [2023-01-28 08:02:53,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558296295] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:02:53,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579111315] [2023-01-28 08:02:53,665 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-28 08:02:53,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:02:53,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:02:53,666 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:02:53,670 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:02:53,835 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-01-28 08:02:53,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:02:53,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 44 conjunts are in the unsatisfiable core [2023-01-28 08:02:53,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:02:53,848 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:02:53,991 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-01-28 08:02:53,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2023-01-28 08:02:54,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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:02:54,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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:02:54,088 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 13 treesize of output 9 [2023-01-28 08:02:54,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:02:54,180 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 16 treesize of output 18 [2023-01-28 08:02:54,292 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:02:54,292 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 19 treesize of output 11 [2023-01-28 08:02:54,376 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 18 treesize of output 13 [2023-01-28 08:02:54,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-28 08:02:54,520 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:02:54,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:02:54,526 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1287 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1287) |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:02:54,746 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:02:54,746 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 23 treesize of output 24 [2023-01-28 08:02:54,752 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:02:54,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 39 treesize of output 35 [2023-01-28 08:02:54,756 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 22 treesize of output 18 [2023-01-28 08:02:54,774 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_77| Int) (v_ArrVal_1285 Int) (v_ArrVal_1287 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_81| Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_77| |v_t_funThread2of2ForFork0_~p~0#1.offset_81|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_77| v_ArrVal_1285)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1287) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_81|) 0))) (or (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_77| Int) (v_ArrVal_1285 Int) (v_ArrVal_1287 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_81| Int)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_77| v_ArrVal_1285)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1287) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_81|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))))) is different from false [2023-01-28 08:02:55,174 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_77| Int) (v_ArrVal_1285 Int) (v_ArrVal_1287 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_81| Int) (v_ArrVal_1281 (Array Int Int))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1281))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_77| v_ArrVal_1285))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1287) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_81|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_77| |v_t_funThread2of2ForFork0_~p~0#1.offset_81|))) (or (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_77| Int) (v_ArrVal_1285 Int) (v_ArrVal_1287 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_81| Int) (v_ArrVal_1281 (Array Int Int))) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1281))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_77| v_ArrVal_1285))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1287) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_81|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2023-01-28 08:03:03,311 WARN L222 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:03:03,500 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:03:03,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579111315] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:03:03,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:03:03,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7, 8] total 31 [2023-01-28 08:03:03,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360820635] [2023-01-28 08:03:03,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:03:03,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-01-28 08:03:03,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:03:03,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-01-28 08:03:03,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=755, Unknown=17, NotChecked=174, Total=1056 [2023-01-28 08:03:03,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 476 [2023-01-28 08:03:03,505 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 193 transitions, 1671 flow. Second operand has 33 states, 33 states have (on average 145.0) internal successors, (4785), 33 states have internal predecessors, (4785), 0 states have call successors, (0), 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:03:03,505 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:03:03,505 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 476 [2023-01-28 08:03:03,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:03:08,621 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:11,411 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:13,966 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:14,196 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (and (= (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0) (forall ((v_ArrVal_1285 Int) (v_ArrVal_1287 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_81| Int) (v_ArrVal_1284 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1285)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1287) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_81|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1284) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_81|)) 0)))) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)) (not (= |c_t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread1of2ForFork0_~p~0#1.offset|)) (= |c_t_funThread2of2ForFork0_~p~0#1.base| |c_t_funThread1of2ForFork0_~p~0#1.base|) (forall ((v_ArrVal_1285 Int) (v_ArrVal_1287 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_81| Int)) (or (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_81|)) 0)) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1285)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1287) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_81|) 0))))) is different from false [2023-01-28 08:03:16,263 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:18,290 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:20,398 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:22,415 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:03:24,433 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:24,871 INFO L130 PetriNetUnfolder]: 1805/3994 cut-off events. [2023-01-28 08:03:24,871 INFO L131 PetriNetUnfolder]: For 22122/22146 co-relation queries the response was YES. [2023-01-28 08:03:24,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20185 conditions, 3994 events. 1805/3994 cut-off events. For 22122/22146 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 33020 event pairs, 286 based on Foata normal form. 27/3651 useless extension candidates. Maximal degree in co-relation 20101. Up to 1690 conditions per place. [2023-01-28 08:03:24,890 INFO L137 encePairwiseOnDemand]: 456/476 looper letters, 172 selfloop transitions, 59 changer transitions 190/427 dead transitions. [2023-01-28 08:03:24,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 427 transitions, 4618 flow [2023-01-28 08:03:24,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-01-28 08:03:24,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-01-28 08:03:24,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 5686 transitions. [2023-01-28 08:03:24,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3143520566121185 [2023-01-28 08:03:24,895 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 5686 transitions. [2023-01-28 08:03:24,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 5686 transitions. [2023-01-28 08:03:24,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:03:24,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 5686 transitions. [2023-01-28 08:03:24,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 149.6315789473684) internal successors, (5686), 38 states have internal predecessors, (5686), 0 states have call successors, (0), 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:03:24,907 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:03:24,908 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:03:24,908 INFO L175 Difference]: Start difference. First operand has 172 places, 193 transitions, 1671 flow. Second operand 38 states and 5686 transitions. [2023-01-28 08:03:24,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 427 transitions, 4618 flow [2023-01-28 08:03:24,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 427 transitions, 4541 flow, removed 28 selfloop flow, removed 9 redundant places. [2023-01-28 08:03:25,018 INFO L231 Difference]: Finished difference. Result has 210 places, 179 transitions, 1691 flow [2023-01-28 08:03:25,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1620, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=1691, PETRI_PLACES=210, PETRI_TRANSITIONS=179} [2023-01-28 08:03:25,018 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 142 predicate places. [2023-01-28 08:03:25,019 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 179 transitions, 1691 flow [2023-01-28 08:03:25,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 145.0) internal successors, (4785), 33 states have internal predecessors, (4785), 0 states have call successors, (0), 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:03:25,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:03:25,019 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:03:25,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-01-28 08:03:25,219 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:03:25,220 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:03:25,220 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:03:25,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1603886776, now seen corresponding path program 4 times [2023-01-28 08:03:25,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:03:25,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229947343] [2023-01-28 08:03:25,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:03:25,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:03:25,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:03:25,557 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:03:25,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:03:25,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229947343] [2023-01-28 08:03:25,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229947343] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:03:25,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714337495] [2023-01-28 08:03:25,558 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-28 08:03:25,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:03:25,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:03:25,559 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:03:25,561 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:03:25,677 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-28 08:03:25,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:03:25,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 36 conjunts are in the unsatisfiable core [2023-01-28 08:03:25,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:03:25,683 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:03:25,739 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:03:25,739 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:03:25,756 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:03:25,774 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 13 treesize of output 9 [2023-01-28 08:03:25,810 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:03:25,850 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:03:25,850 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 19 treesize of output 11 [2023-01-28 08:03:25,907 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 18 treesize of output 13 [2023-01-28 08:03:25,944 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 16 treesize of output 18 [2023-01-28 08:03:25,963 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:03:25,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:03:25,968 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1377 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1377) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:03:26,076 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 15 treesize of output 13 [2023-01-28 08:03:26,080 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 12 treesize of output 8 [2023-01-28 08:03:26,085 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_79| Int) (v_ArrVal_1375 Int) (v_ArrVal_1377 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_83| Int) (v_ArrVal_1374 (Array Int Int))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1374))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_83| v_ArrVal_1375))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1377) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_79|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_79| |v_t_funThread2of2ForFork0_~p~0#1.offset_83|))) is different from false [2023-01-28 08:03:26,194 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 5 not checked. [2023-01-28 08:03:26,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714337495] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:03:26,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:03:26,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 20 [2023-01-28 08:03:26,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045209745] [2023-01-28 08:03:26,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:03:26,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-01-28 08:03:26,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:03:26,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-01-28 08:03:26,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=298, Unknown=6, NotChecked=74, Total=462 [2023-01-28 08:03:26,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 476 [2023-01-28 08:03:26,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 179 transitions, 1691 flow. Second operand has 22 states, 22 states have (on average 151.5909090909091) internal successors, (3335), 22 states have internal predecessors, (3335), 0 states have call successors, (0), 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:03:26,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:03:26,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 476 [2023-01-28 08:03:26,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:03:27,313 INFO L130 PetriNetUnfolder]: 1260/2836 cut-off events. [2023-01-28 08:03:27,313 INFO L131 PetriNetUnfolder]: For 20242/20260 co-relation queries the response was YES. [2023-01-28 08:03:27,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14929 conditions, 2836 events. 1260/2836 cut-off events. For 20242/20260 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 21919 event pairs, 230 based on Foata normal form. 8/2703 useless extension candidates. Maximal degree in co-relation 14823. Up to 1825 conditions per place. [2023-01-28 08:03:27,328 INFO L137 encePairwiseOnDemand]: 460/476 looper letters, 181 selfloop transitions, 19 changer transitions 48/254 dead transitions. [2023-01-28 08:03:27,328 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 254 transitions, 2668 flow [2023-01-28 08:03:27,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-28 08:03:27,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-01-28 08:03:27,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2210 transitions. [2023-01-28 08:03:27,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33163265306122447 [2023-01-28 08:03:27,331 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2210 transitions. [2023-01-28 08:03:27,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2210 transitions. [2023-01-28 08:03:27,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:03:27,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2210 transitions. [2023-01-28 08:03:27,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 157.85714285714286) internal successors, (2210), 14 states have internal predecessors, (2210), 0 states have call successors, (0), 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:03:27,336 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:03:27,336 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:03:27,336 INFO L175 Difference]: Start difference. First operand has 210 places, 179 transitions, 1691 flow. Second operand 14 states and 2210 transitions. [2023-01-28 08:03:27,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 254 transitions, 2668 flow [2023-01-28 08:03:27,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 254 transitions, 2503 flow, removed 32 selfloop flow, removed 34 redundant places. [2023-01-28 08:03:27,378 INFO L231 Difference]: Finished difference. Result has 182 places, 180 transitions, 1604 flow [2023-01-28 08:03:27,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1526, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1604, PETRI_PLACES=182, PETRI_TRANSITIONS=180} [2023-01-28 08:03:27,378 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 114 predicate places. [2023-01-28 08:03:27,378 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 180 transitions, 1604 flow [2023-01-28 08:03:27,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 151.5909090909091) internal successors, (3335), 22 states have internal predecessors, (3335), 0 states have call successors, (0), 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:03:27,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:03:27,379 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:03:27,391 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:03:27,583 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:03:27,583 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:03:27,584 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:03:27,584 INFO L85 PathProgramCache]: Analyzing trace with hash -8580036, now seen corresponding path program 7 times [2023-01-28 08:03:27,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:03:27,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334769533] [2023-01-28 08:03:27,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:03:27,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:03:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:03:27,836 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:03:27,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:03:27,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334769533] [2023-01-28 08:03:27,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334769533] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:03:27,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279283479] [2023-01-28 08:03:27,837 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-28 08:03:27,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:03:27,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:03:27,838 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:03:27,840 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:03:27,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:03:27,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 36 conjunts are in the unsatisfiable core [2023-01-28 08:03:27,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:03:27,991 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:03:28,038 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:03:28,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:03:28,053 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:03:28,071 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:03:28,091 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 13 treesize of output 9 [2023-01-28 08:03:28,132 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:03:28,132 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 19 treesize of output 11 [2023-01-28 08:03:28,186 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 18 treesize of output 13 [2023-01-28 08:03:28,210 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 16 treesize of output 18 [2023-01-28 08:03:28,237 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:03:28,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:03:28,317 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 15 treesize of output 13 [2023-01-28 08:03:28,328 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 12 treesize of output 8 [2023-01-28 08:03:28,332 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1467 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_85| Int) (v_ArrVal_1465 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_81| Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_81| v_ArrVal_1465)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1467) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_85|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_81| |v_t_funThread2of2ForFork0_~p~0#1.offset_85|))) is different from false [2023-01-28 08:03:28,359 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1467 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_85| Int) (v_ArrVal_1465 Int) (v_ArrVal_1462 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_81| Int)) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1462))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_81| v_ArrVal_1465))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1467) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_85|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_81| |v_t_funThread2of2ForFork0_~p~0#1.offset_85|))) is different from false [2023-01-28 08:03:28,461 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:03:28,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279283479] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:03:28,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:03:28,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 17 [2023-01-28 08:03:28,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848171089] [2023-01-28 08:03:28,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:03:28,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-01-28 08:03:28,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:03:28,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-01-28 08:03:28,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=8, NotChecked=62, Total=342 [2023-01-28 08:03:28,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 476 [2023-01-28 08:03:28,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 180 transitions, 1604 flow. Second operand has 19 states, 19 states have (on average 154.68421052631578) internal successors, (2939), 19 states have internal predecessors, (2939), 0 states have call successors, (0), 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:03:28,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:03:28,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 476 [2023-01-28 08:03:28,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:03:29,037 INFO L130 PetriNetUnfolder]: 1159/2610 cut-off events. [2023-01-28 08:03:29,037 INFO L131 PetriNetUnfolder]: For 19800/19818 co-relation queries the response was YES. [2023-01-28 08:03:29,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14536 conditions, 2610 events. 1159/2610 cut-off events. For 19800/19818 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 19688 event pairs, 253 based on Foata normal form. 5/2501 useless extension candidates. Maximal degree in co-relation 14445. Up to 1616 conditions per place. [2023-01-28 08:03:29,052 INFO L137 encePairwiseOnDemand]: 467/476 looper letters, 164 selfloop transitions, 11 changer transitions 55/236 dead transitions. [2023-01-28 08:03:29,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 236 transitions, 2613 flow [2023-01-28 08:03:29,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 08:03:29,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 08:03:29,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1463 transitions. [2023-01-28 08:03:29,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3415032679738562 [2023-01-28 08:03:29,054 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1463 transitions. [2023-01-28 08:03:29,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1463 transitions. [2023-01-28 08:03:29,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:03:29,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1463 transitions. [2023-01-28 08:03:29,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 162.55555555555554) internal successors, (1463), 9 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 08:03:29,057 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:03:29,058 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:03:29,058 INFO L175 Difference]: Start difference. First operand has 182 places, 180 transitions, 1604 flow. Second operand 9 states and 1463 transitions. [2023-01-28 08:03:29,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 236 transitions, 2613 flow [2023-01-28 08:03:29,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 236 transitions, 2554 flow, removed 16 selfloop flow, removed 10 redundant places. [2023-01-28 08:03:29,091 INFO L231 Difference]: Finished difference. Result has 179 places, 167 transitions, 1443 flow [2023-01-28 08:03:29,091 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1545, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1443, PETRI_PLACES=179, PETRI_TRANSITIONS=167} [2023-01-28 08:03:29,092 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 111 predicate places. [2023-01-28 08:03:29,092 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 167 transitions, 1443 flow [2023-01-28 08:03:29,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 154.68421052631578) internal successors, (2939), 19 states have internal predecessors, (2939), 0 states have call successors, (0), 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:03:29,092 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:03:29,092 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:03:29,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-01-28 08:03:29,297 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:03:29,297 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:03:29,297 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:03:29,297 INFO L85 PathProgramCache]: Analyzing trace with hash 181724028, now seen corresponding path program 5 times [2023-01-28 08:03:29,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:03:29,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299603147] [2023-01-28 08:03:29,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:03:29,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:03:29,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:03:29,634 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:03:29,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:03:29,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299603147] [2023-01-28 08:03:29,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299603147] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:03:29,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234091697] [2023-01-28 08:03:29,634 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-28 08:03:29,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:03:29,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:03:29,635 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:03:29,638 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:03:30,003 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-01-28 08:03:30,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:03:30,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 36 conjunts are in the unsatisfiable core [2023-01-28 08:03:30,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:03:30,011 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:03:30,062 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:03:30,062 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:03:30,080 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:03:30,096 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:03:30,118 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 13 treesize of output 9 [2023-01-28 08:03:30,151 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:03:30,151 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 19 treesize of output 11 [2023-01-28 08:03:30,200 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 18 treesize of output 13 [2023-01-28 08:03:30,234 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 16 treesize of output 18 [2023-01-28 08:03:30,251 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:03:30,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:03:30,337 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 15 treesize of output 13 [2023-01-28 08:03:30,340 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 12 treesize of output 8 [2023-01-28 08:03:30,345 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1557 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_87| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_83| Int) (v_ArrVal_1556 Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_83| |v_t_funThread2of2ForFork0_~p~0#1.offset_87|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_87| v_ArrVal_1556)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1557) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_83|) 0))) is different from false [2023-01-28 08:03:30,361 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1557 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_87| Int) (v_ArrVal_1552 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_83| Int) (v_ArrVal_1556 Int)) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1552))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_87| v_ArrVal_1556))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1557) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_83|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_83| |v_t_funThread2of2ForFork0_~p~0#1.offset_87|))) is different from false [2023-01-28 08:03:30,469 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:03:30,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234091697] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:03:30,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:03:30,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 19 [2023-01-28 08:03:30,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339577351] [2023-01-28 08:03:30,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:03:30,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-01-28 08:03:30,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:03:30,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-01-28 08:03:30,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=272, Unknown=7, NotChecked=70, Total=420 [2023-01-28 08:03:30,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 476 [2023-01-28 08:03:30,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 167 transitions, 1443 flow. Second operand has 21 states, 21 states have (on average 153.61904761904762) internal successors, (3226), 21 states have internal predecessors, (3226), 0 states have call successors, (0), 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:03:30,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:03:30,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 476 [2023-01-28 08:03:30,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:03:31,384 INFO L130 PetriNetUnfolder]: 1032/2372 cut-off events. [2023-01-28 08:03:31,384 INFO L131 PetriNetUnfolder]: For 16756/16770 co-relation queries the response was YES. [2023-01-28 08:03:31,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12665 conditions, 2372 events. 1032/2372 cut-off events. For 16756/16770 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 17744 event pairs, 271 based on Foata normal form. 8/2253 useless extension candidates. Maximal degree in co-relation 12575. Up to 1225 conditions per place. [2023-01-28 08:03:31,395 INFO L137 encePairwiseOnDemand]: 466/476 looper letters, 150 selfloop transitions, 15 changer transitions 66/237 dead transitions. [2023-01-28 08:03:31,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 237 transitions, 2469 flow [2023-01-28 08:03:31,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-01-28 08:03:31,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-01-28 08:03:31,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2086 transitions. [2023-01-28 08:03:31,398 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33710407239819007 [2023-01-28 08:03:31,398 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2086 transitions. [2023-01-28 08:03:31,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2086 transitions. [2023-01-28 08:03:31,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:03:31,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2086 transitions. [2023-01-28 08:03:31,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 160.46153846153845) internal successors, (2086), 13 states have internal predecessors, (2086), 0 states have call successors, (0), 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:03:31,406 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:03:31,407 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:03:31,407 INFO L175 Difference]: Start difference. First operand has 179 places, 167 transitions, 1443 flow. Second operand 13 states and 2086 transitions. [2023-01-28 08:03:31,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 237 transitions, 2469 flow [2023-01-28 08:03:31,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 237 transitions, 2423 flow, removed 12 selfloop flow, removed 10 redundant places. [2023-01-28 08:03:31,434 INFO L231 Difference]: Finished difference. Result has 178 places, 155 transitions, 1342 flow [2023-01-28 08:03:31,434 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1397, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1342, PETRI_PLACES=178, PETRI_TRANSITIONS=155} [2023-01-28 08:03:31,437 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 110 predicate places. [2023-01-28 08:03:31,437 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 155 transitions, 1342 flow [2023-01-28 08:03:31,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 153.61904761904762) internal successors, (3226), 21 states have internal predecessors, (3226), 0 states have call successors, (0), 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:03:31,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:03:31,437 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:03:31,443 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:03:31,643 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:03:31,643 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:03:31,643 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:03:31,643 INFO L85 PathProgramCache]: Analyzing trace with hash -858990792, now seen corresponding path program 6 times [2023-01-28 08:03:31,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:03:31,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119143216] [2023-01-28 08:03:31,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:03:31,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:03:31,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:03:31,894 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:03:31,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:03:31,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119143216] [2023-01-28 08:03:31,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119143216] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:03:31,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851517274] [2023-01-28 08:03:31,894 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-28 08:03:31,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:03:31,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:03:31,895 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:03:31,898 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:03:32,200 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-01-28 08:03:32,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:03:32,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 45 conjunts are in the unsatisfiable core [2023-01-28 08:03:32,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:03:32,207 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:03:32,345 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-01-28 08:03:32,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2023-01-28 08:03:32,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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:03:32,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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:03:32,464 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 13 treesize of output 9 [2023-01-28 08:03:32,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:03:32,535 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 16 treesize of output 18 [2023-01-28 08:03:32,573 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 18 treesize of output 13 [2023-01-28 08:03:32,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:03:32,611 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 16 treesize of output 18 [2023-01-28 08:03:32,656 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:03:32,656 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 19 treesize of output 11 [2023-01-28 08:03:32,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-28 08:03:32,730 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:03:32,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:03:32,780 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1648 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_85| Int) (v_ArrVal_1649 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1649) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_85|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1648) |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_85| 4)) 0)))) is different from false [2023-01-28 08:03:32,834 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:03:32,834 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 23 treesize of output 24 [2023-01-28 08:03:32,840 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:03:32,841 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 39 treesize of output 35 [2023-01-28 08:03:32,844 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 22 treesize of output 18 [2023-01-28 08:03:32,988 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_89| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_85| Int) (v_ArrVal_1647 Int) (v_ArrVal_1649 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_85| |v_t_funThread2of2ForFork0_~p~0#1.offset_89|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_89| v_ArrVal_1647)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1649) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_85|) 0))) (or (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_89| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_85| Int) (v_ArrVal_1647 Int) (v_ArrVal_1649 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_89| v_ArrVal_1647)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1649) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_85|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))))) is different from false [2023-01-28 08:03:33,020 WARN L839 $PredicateComparison]: unable to prove that (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_89| Int) (v_ArrVal_1642 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_85| Int) (v_ArrVal_1647 Int) (v_ArrVal_1649 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1642))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_89| v_ArrVal_1647))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1649) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_85|) 0))) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_89| Int) (v_ArrVal_1642 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_85| Int) (v_ArrVal_1647 Int) (v_ArrVal_1649 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_85| |v_t_funThread2of2ForFork0_~p~0#1.offset_89|) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1642))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_89| v_ArrVal_1647))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1649) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_85|) 0)))) is different from false [2023-01-28 08:03:41,131 WARN L222 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:03:41,328 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:03:41,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851517274] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:03:41,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:03:41,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 21 [2023-01-28 08:03:41,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983558010] [2023-01-28 08:03:41,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:03:41,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-01-28 08:03:41,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:03:41,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-01-28 08:03:41,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=299, Unknown=11, NotChecked=114, Total=506 [2023-01-28 08:03:41,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 476 [2023-01-28 08:03:41,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 155 transitions, 1342 flow. Second operand has 23 states, 23 states have (on average 152.3913043478261) internal successors, (3505), 23 states have internal predecessors, (3505), 0 states have call successors, (0), 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:03:41,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:03:41,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 476 [2023-01-28 08:03:41,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:03:44,175 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:44,466 INFO L130 PetriNetUnfolder]: 779/1818 cut-off events. [2023-01-28 08:03:44,466 INFO L131 PetriNetUnfolder]: For 14252/14252 co-relation queries the response was YES. [2023-01-28 08:03:44,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10167 conditions, 1818 events. 779/1818 cut-off events. For 14252/14252 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 12909 event pairs, 157 based on Foata normal form. 10/1764 useless extension candidates. Maximal degree in co-relation 10081. Up to 1046 conditions per place. [2023-01-28 08:03:44,475 INFO L137 encePairwiseOnDemand]: 466/476 looper letters, 156 selfloop transitions, 20 changer transitions 32/214 dead transitions. [2023-01-28 08:03:44,475 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 214 transitions, 2261 flow [2023-01-28 08:03:44,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-28 08:03:44,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-01-28 08:03:44,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1906 transitions. [2023-01-28 08:03:44,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3336834733893557 [2023-01-28 08:03:44,477 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1906 transitions. [2023-01-28 08:03:44,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1906 transitions. [2023-01-28 08:03:44,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:03:44,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1906 transitions. [2023-01-28 08:03:44,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 158.83333333333334) internal successors, (1906), 12 states have internal predecessors, (1906), 0 states have call successors, (0), 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:03:44,481 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:03:44,481 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:03:44,481 INFO L175 Difference]: Start difference. First operand has 178 places, 155 transitions, 1342 flow. Second operand 12 states and 1906 transitions. [2023-01-28 08:03:44,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 214 transitions, 2261 flow [2023-01-28 08:03:44,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 214 transitions, 2203 flow, removed 14 selfloop flow, removed 14 redundant places. [2023-01-28 08:03:44,500 INFO L231 Difference]: Finished difference. Result has 169 places, 159 transitions, 1397 flow [2023-01-28 08:03:44,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1290, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1397, PETRI_PLACES=169, PETRI_TRANSITIONS=159} [2023-01-28 08:03:44,501 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 101 predicate places. [2023-01-28 08:03:44,501 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 159 transitions, 1397 flow [2023-01-28 08:03:44,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 152.3913043478261) internal successors, (3505), 23 states have internal predecessors, (3505), 0 states have call successors, (0), 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:03:44,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:03:44,502 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:03:44,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2023-01-28 08:03:44,706 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:03:44,707 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:03:44,707 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:03:44,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1958020811, now seen corresponding path program 1 times [2023-01-28 08:03:44,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:03:44,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737273070] [2023-01-28 08:03:44,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:03:44,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:03:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:03:44,981 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 08:03:44,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:03:44,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737273070] [2023-01-28 08:03:44,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737273070] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:03:44,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276051866] [2023-01-28 08:03:44,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:03:44,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:03:44,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:03:44,983 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:03:44,984 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:03:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:03:45,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 43 conjunts are in the unsatisfiable core [2023-01-28 08:03:45,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:03:45,152 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:03:45,202 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:03:45,203 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:03:45,224 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:03:45,288 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:03:45,329 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 24 treesize of output 17 [2023-01-28 08:03:45,377 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:03:45,426 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 08:03:45,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:03:59,651 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:03:59,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276051866] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:03:59,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:03:59,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 22 [2023-01-28 08:03:59,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433721395] [2023-01-28 08:03:59,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:03:59,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-01-28 08:03:59,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:03:59,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-01-28 08:03:59,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=461, Unknown=3, NotChecked=0, Total=552 [2023-01-28 08:03:59,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 476 [2023-01-28 08:03:59,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 159 transitions, 1397 flow. Second operand has 24 states, 24 states have (on average 168.41666666666666) internal successors, (4042), 24 states have internal predecessors, (4042), 0 states have call successors, (0), 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:03:59,655 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:03:59,655 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 476 [2023-01-28 08:03:59,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:04:00,475 INFO L130 PetriNetUnfolder]: 743/1758 cut-off events. [2023-01-28 08:04:00,476 INFO L131 PetriNetUnfolder]: For 14705/14719 co-relation queries the response was YES. [2023-01-28 08:04:00,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10102 conditions, 1758 events. 743/1758 cut-off events. For 14705/14719 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 12667 event pairs, 161 based on Foata normal form. 11/1706 useless extension candidates. Maximal degree in co-relation 10015. Up to 820 conditions per place. [2023-01-28 08:04:00,484 INFO L137 encePairwiseOnDemand]: 464/476 looper letters, 153 selfloop transitions, 47 changer transitions 19/228 dead transitions. [2023-01-28 08:04:00,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 228 transitions, 2583 flow [2023-01-28 08:04:00,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-01-28 08:04:00,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-01-28 08:04:00,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2603 transitions. [2023-01-28 08:04:00,496 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3645658263305322 [2023-01-28 08:04:00,496 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2603 transitions. [2023-01-28 08:04:00,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2603 transitions. [2023-01-28 08:04:00,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:04:00,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2603 transitions. [2023-01-28 08:04:00,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 173.53333333333333) internal successors, (2603), 15 states have internal predecessors, (2603), 0 states have call successors, (0), 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:04:00,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 476.0) internal successors, (7616), 16 states have internal predecessors, (7616), 0 states have call successors, (0), 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:04:00,501 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 476.0) internal successors, (7616), 16 states have internal predecessors, (7616), 0 states have call successors, (0), 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:04:00,501 INFO L175 Difference]: Start difference. First operand has 169 places, 159 transitions, 1397 flow. Second operand 15 states and 2603 transitions. [2023-01-28 08:04:00,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 228 transitions, 2583 flow [2023-01-28 08:04:00,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 228 transitions, 2526 flow, removed 16 selfloop flow, removed 9 redundant places. [2023-01-28 08:04:00,528 INFO L231 Difference]: Finished difference. Result has 175 places, 164 transitions, 1527 flow [2023-01-28 08:04:00,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1344, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1527, PETRI_PLACES=175, PETRI_TRANSITIONS=164} [2023-01-28 08:04:00,535 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 107 predicate places. [2023-01-28 08:04:00,536 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 164 transitions, 1527 flow [2023-01-28 08:04:00,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 168.41666666666666) internal successors, (4042), 24 states have internal predecessors, (4042), 0 states have call successors, (0), 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:04:00,536 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:04:00,536 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:04:00,545 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:04:00,741 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:04:00,742 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:04:00,752 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:04:00,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1353163813, now seen corresponding path program 2 times [2023-01-28 08:04:00,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:04:00,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389561644] [2023-01-28 08:04:00,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:04:00,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:04:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:04:01,028 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:04:01,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:04:01,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389561644] [2023-01-28 08:04:01,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389561644] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:04:01,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075395222] [2023-01-28 08:04:01,029 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 08:04:01,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:04:01,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:04:01,030 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:04:01,032 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:04:01,166 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 08:04:01,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:04:01,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 43 conjunts are in the unsatisfiable core [2023-01-28 08:04:01,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:04:01,171 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:04:01,217 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:04:01,217 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:04:01,224 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:04:01,302 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 24 treesize of output 17 [2023-01-28 08:04:01,361 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:04:01,374 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:04:01,413 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:04:01,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:04:17,463 WARN L861 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1843 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1843) |c_~#a~0.base|))) (select .cse0 (@diff .cse0 ((as const (Array Int Int)) 0)))) 0)) is different from true [2023-01-28 08:04:17,472 WARN L861 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1843 (Array Int Int))) (= (let ((.cse0 (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) |c_t_funThread1of2ForFork0_#t~post39#1|))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1843) |c_~#a~0.base|))) (select .cse0 (@diff .cse0 ((as const (Array Int Int)) 0)))) 0)) is different from true [2023-01-28 08:04:17,738 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2023-01-28 08:04:17,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075395222] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:04:17,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:04:17,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2023-01-28 08:04:17,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615754260] [2023-01-28 08:04:17,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:04:17,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-01-28 08:04:17,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:04:17,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-01-28 08:04:17,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=335, Unknown=13, NotChecked=78, Total=506 [2023-01-28 08:04:17,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 476 [2023-01-28 08:04:17,742 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 164 transitions, 1527 flow. Second operand has 23 states, 23 states have (on average 168.43478260869566) internal successors, (3874), 23 states have internal predecessors, (3874), 0 states have call successors, (0), 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:04:17,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:04:17,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 476 [2023-01-28 08:04:17,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:04:18,157 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse1 ((as const (Array Int Int)) 0))) (and (forall ((v_ArrVal_1843 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1843) |c_~#a~0.base|))) (select .cse0 (@diff .cse0 .cse1))) 0)) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= 4 |c_t_funThread1of2ForFork0_~p~0#1.base|) (= .cse1 (select |c_#memory_int| 4)) (= |c_~#a~0.base| 4))) is different from true [2023-01-28 08:04:18,754 INFO L130 PetriNetUnfolder]: 1035/2441 cut-off events. [2023-01-28 08:04:18,754 INFO L131 PetriNetUnfolder]: For 25649/25666 co-relation queries the response was YES. [2023-01-28 08:04:18,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14791 conditions, 2441 events. 1035/2441 cut-off events. For 25649/25666 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 19436 event pairs, 144 based on Foata normal form. 36/2411 useless extension candidates. Maximal degree in co-relation 14704. Up to 774 conditions per place. [2023-01-28 08:04:18,766 INFO L137 encePairwiseOnDemand]: 457/476 looper letters, 155 selfloop transitions, 50 changer transitions 74/288 dead transitions. [2023-01-28 08:04:18,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 288 transitions, 3544 flow [2023-01-28 08:04:18,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-01-28 08:04:18,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-01-28 08:04:18,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3468 transitions. [2023-01-28 08:04:18,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36428571428571427 [2023-01-28 08:04:18,769 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3468 transitions. [2023-01-28 08:04:18,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3468 transitions. [2023-01-28 08:04:18,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:04:18,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3468 transitions. [2023-01-28 08:04:18,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 173.4) internal successors, (3468), 20 states have internal predecessors, (3468), 0 states have call successors, (0), 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:04:18,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 476.0) internal successors, (9996), 21 states have internal predecessors, (9996), 0 states have call successors, (0), 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:04:18,776 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 476.0) internal successors, (9996), 21 states have internal predecessors, (9996), 0 states have call successors, (0), 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:04:18,776 INFO L175 Difference]: Start difference. First operand has 175 places, 164 transitions, 1527 flow. Second operand 20 states and 3468 transitions. [2023-01-28 08:04:18,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 288 transitions, 3544 flow [2023-01-28 08:04:18,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 288 transitions, 3343 flow, removed 69 selfloop flow, removed 11 redundant places. [2023-01-28 08:04:18,820 INFO L231 Difference]: Finished difference. Result has 189 places, 163 transitions, 1672 flow [2023-01-28 08:04:18,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1428, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1672, PETRI_PLACES=189, PETRI_TRANSITIONS=163} [2023-01-28 08:04:18,898 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 121 predicate places. [2023-01-28 08:04:18,898 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 163 transitions, 1672 flow [2023-01-28 08:04:18,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 168.43478260869566) internal successors, (3874), 23 states have internal predecessors, (3874), 0 states have call successors, (0), 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:04:18,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:04:18,899 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:04:18,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2023-01-28 08:04:19,104 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:04:19,104 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:04:19,105 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:04:19,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1223032185, now seen corresponding path program 3 times [2023-01-28 08:04:19,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:04:19,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758477517] [2023-01-28 08:04:19,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:04:19,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:04:19,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:04:19,359 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:04:19,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:04:19,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758477517] [2023-01-28 08:04:19,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758477517] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:04:19,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672051534] [2023-01-28 08:04:19,359 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 08:04:19,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:04:19,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:04:19,361 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:04:19,362 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:04:19,500 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-28 08:04:19,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:04:19,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 43 conjunts are in the unsatisfiable core [2023-01-28 08:04:19,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:04:19,506 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:04:19,549 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:04:19,549 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:04:19,568 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:04:19,639 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 24 treesize of output 17 [2023-01-28 08:04:19,661 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 21 treesize of output 23 [2023-01-28 08:04:19,757 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:04:19,777 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:04:19,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:04:37,829 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) |c_t_funThread1of2ForFork0_#t~post39#1|))) |c_t_funThread2of2ForFork0_~p~0#1.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:04:39,835 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) |c_t_funThread2of2ForFork0_~p~0#1.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:04:41,859 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:04:41,872 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_1938 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1938))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base| (let ((.cse1 (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base|))) (store .cse1 |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) (select .cse1 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))))) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:04:41,878 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_1938 (Array Int Int))) (= 0 (select (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ |c_t_funThread1of2ForFork0_#t~mem35#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1938))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base| (let ((.cse1 (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base|))) (store .cse1 |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) (select .cse1 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))))) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|))) is different from false [2023-01-28 08:04:41,888 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_1938 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (let ((.cse2 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (store .cse2 |t_funThread1of2ForFork0_~p~0#1.offset| (+ (select .cse2 |t_funThread1of2ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1938))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base| (let ((.cse1 (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base|))) (store .cse1 |t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) (select .cse1 |t_funThread1of2ForFork0_~p~0#1.offset|)))))) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:04:41,982 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:04:41,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672051534] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:04:41,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:04:41,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2023-01-28 08:04:41,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281816319] [2023-01-28 08:04:41,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:04:41,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-01-28 08:04:41,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:04:41,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-01-28 08:04:41,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=354, Unknown=14, NotChecked=258, Total=702 [2023-01-28 08:04:41,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 476 [2023-01-28 08:04:41,986 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 163 transitions, 1672 flow. Second operand has 27 states, 27 states have (on average 168.1851851851852) internal successors, (4541), 27 states have internal predecessors, (4541), 0 states have call successors, (0), 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:04:41,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:04:41,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 476 [2023-01-28 08:04:41,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:04:48,151 WARN L222 SmtUtils]: Spent 6.05s on a formula simplification. DAG size of input: 39 DAG size of output: 35 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:04:56,630 WARN L222 SmtUtils]: Spent 8.03s on a formula simplification. DAG size of input: 34 DAG size of output: 31 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:04:56,972 INFO L130 PetriNetUnfolder]: 833/2037 cut-off events. [2023-01-28 08:04:56,972 INFO L131 PetriNetUnfolder]: For 23705/23724 co-relation queries the response was YES. [2023-01-28 08:04:56,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13430 conditions, 2037 events. 833/2037 cut-off events. For 23705/23724 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 15675 event pairs, 166 based on Foata normal form. 18/1989 useless extension candidates. Maximal degree in co-relation 13369. Up to 896 conditions per place. [2023-01-28 08:04:56,983 INFO L137 encePairwiseOnDemand]: 460/476 looper letters, 132 selfloop transitions, 19 changer transitions 83/243 dead transitions. [2023-01-28 08:04:56,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 243 transitions, 3181 flow [2023-01-28 08:04:56,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-01-28 08:04:56,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-01-28 08:04:56,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2766 transitions. [2023-01-28 08:04:56,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3631827731092437 [2023-01-28 08:04:56,988 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2766 transitions. [2023-01-28 08:04:56,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2766 transitions. [2023-01-28 08:04:56,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:04:56,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2766 transitions. [2023-01-28 08:04:56,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 172.875) internal successors, (2766), 16 states have internal predecessors, (2766), 0 states have call successors, (0), 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:04:56,994 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:04:56,995 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:04:56,995 INFO L175 Difference]: Start difference. First operand has 189 places, 163 transitions, 1672 flow. Second operand 16 states and 2766 transitions. [2023-01-28 08:04:56,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 243 transitions, 3181 flow [2023-01-28 08:04:57,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 243 transitions, 2890 flow, removed 109 selfloop flow, removed 13 redundant places. [2023-01-28 08:04:57,041 INFO L231 Difference]: Finished difference. Result has 188 places, 142 transitions, 1306 flow [2023-01-28 08:04:57,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1464, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1306, PETRI_PLACES=188, PETRI_TRANSITIONS=142} [2023-01-28 08:04:57,042 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 120 predicate places. [2023-01-28 08:04:57,042 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 142 transitions, 1306 flow [2023-01-28 08:04:57,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 168.1851851851852) internal successors, (4541), 27 states have internal predecessors, (4541), 0 states have call successors, (0), 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:04:57,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:04:57,043 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:04:57,050 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:04:57,248 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:04:57,248 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:04:57,249 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:04:57,249 INFO L85 PathProgramCache]: Analyzing trace with hash 2004497753, now seen corresponding path program 4 times [2023-01-28 08:04:57,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:04:57,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120019198] [2023-01-28 08:04:57,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:04:57,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:04:57,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:04:57,623 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:04:57,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:04:57,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120019198] [2023-01-28 08:04:57,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120019198] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:04:57,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045338296] [2023-01-28 08:04:57,623 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-28 08:04:57,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:04:57,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:04:57,624 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:04:57,629 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:04:57,772 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-28 08:04:57,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:04:57,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 41 conjunts are in the unsatisfiable core [2023-01-28 08:04:57,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:04:57,778 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:04:57,853 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:04:57,853 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:04:57,872 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:04:57,898 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 13 treesize of output 9 [2023-01-28 08:04:57,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:04:57,945 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 16 treesize of output 18 [2023-01-28 08:04:57,987 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 18 treesize of output 13 [2023-01-28 08:04:58,024 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 16 treesize of output 18 [2023-01-28 08:04:58,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:04:58,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 16 treesize of output 18 [2023-01-28 08:04:58,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:04:58,073 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 16 treesize of output 18 [2023-01-28 08:04:58,103 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:04:58,103 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 19 treesize of output 11 [2023-01-28 08:04:58,128 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 21 treesize of output 16 [2023-01-28 08:04:58,170 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:04:58,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:04:58,226 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2041 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_97| Int) (v_ArrVal_2040 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_2041)) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_97|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2040) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_97|)) 0)))) is different from false [2023-01-28 08:04:58,240 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2041 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_97| Int) (v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2040 (Array Int Int))) (or (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2038))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_2041))) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_97|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2040) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_97|)) 0)))) is different from false [2023-01-28 08:04:58,247 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2041 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_97| Int) (v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2037 Int) (v_ArrVal_2040 (Array Int Int))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2040) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_97|)) 0)) (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_2037)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2038))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_2041))) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_97|) 0))) is different from false [2023-01-28 08:04:58,283 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:04:58,283 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 23 treesize of output 24 [2023-01-28 08:04:58,289 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:04:58,289 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 39 treesize of output 35 [2023-01-28 08:04:58,292 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 22 treesize of output 18 [2023-01-28 08:04:58,310 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (or (forall ((v_ArrVal_2041 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_97| Int) (v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2037 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_93| Int)) (= (select (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_93| v_ArrVal_2037)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2038) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_93| v_ArrVal_2041) |v_t_funThread2of2ForFork0_~p~0#1.offset_97|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((v_ArrVal_2041 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_97| Int) (v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2037 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_93| Int)) (or (= (select (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_93| v_ArrVal_2037)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2038) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_93| v_ArrVal_2041) |v_t_funThread2of2ForFork0_~p~0#1.offset_97|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_93| |v_t_funThread2of2ForFork0_~p~0#1.offset_97|))))) is different from false [2023-01-28 08:04:58,350 WARN L839 $PredicateComparison]: unable to prove that (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((v_ArrVal_2041 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_97| Int) (v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2037 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_93| Int) (v_ArrVal_2032 (Array Int Int))) (= (select (store (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2032))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_93| v_ArrVal_2037))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2038) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_93| v_ArrVal_2041) |v_t_funThread2of2ForFork0_~p~0#1.offset_97|) 0))) (forall ((v_ArrVal_2041 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_97| Int) (v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2037 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_93| Int) (v_ArrVal_2032 (Array Int Int))) (or (= (select (store (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2032))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_93| v_ArrVal_2037))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2038) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_93| v_ArrVal_2041) |v_t_funThread2of2ForFork0_~p~0#1.offset_97|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_93| |v_t_funThread2of2ForFork0_~p~0#1.offset_97|)))) is different from false [2023-01-28 08:05:06,439 WARN L222 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:05:06,583 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:05:06,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045338296] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:05:06,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:05:06,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 9] total 23 [2023-01-28 08:05:06,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354822677] [2023-01-28 08:05:06,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:05:06,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-01-28 08:05:06,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:05:06,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-01-28 08:05:06,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=314, Unknown=5, NotChecked=200, Total=600 [2023-01-28 08:05:06,586 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 476 [2023-01-28 08:05:06,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 142 transitions, 1306 flow. Second operand has 25 states, 25 states have (on average 153.52) internal successors, (3838), 25 states have internal predecessors, (3838), 0 states have call successors, (0), 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:06,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:05:06,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 476 [2023-01-28 08:05:06,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:05:07,239 INFO L130 PetriNetUnfolder]: 651/1597 cut-off events. [2023-01-28 08:05:07,240 INFO L131 PetriNetUnfolder]: For 18661/18667 co-relation queries the response was YES. [2023-01-28 08:05:07,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10169 conditions, 1597 events. 651/1597 cut-off events. For 18661/18667 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 11252 event pairs, 91 based on Foata normal form. 15/1558 useless extension candidates. Maximal degree in co-relation 10105. Up to 614 conditions per place. [2023-01-28 08:05:07,248 INFO L137 encePairwiseOnDemand]: 467/476 looper letters, 140 selfloop transitions, 26 changer transitions 36/208 dead transitions. [2023-01-28 08:05:07,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 208 transitions, 2496 flow [2023-01-28 08:05:07,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-28 08:05:07,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-01-28 08:05:07,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1599 transitions. [2023-01-28 08:05:07,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33592436974789913 [2023-01-28 08:05:07,250 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1599 transitions. [2023-01-28 08:05:07,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1599 transitions. [2023-01-28 08:05:07,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:05:07,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1599 transitions. [2023-01-28 08:05:07,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 159.9) internal successors, (1599), 10 states have internal predecessors, (1599), 0 states have call successors, (0), 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:07,253 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:05:07,254 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:05:07,254 INFO L175 Difference]: Start difference. First operand has 188 places, 142 transitions, 1306 flow. Second operand 10 states and 1599 transitions. [2023-01-28 08:05:07,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 208 transitions, 2496 flow [2023-01-28 08:05:07,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 208 transitions, 2180 flow, removed 137 selfloop flow, removed 24 redundant places. [2023-01-28 08:05:07,283 INFO L231 Difference]: Finished difference. Result has 157 places, 147 transitions, 1287 flow [2023-01-28 08:05:07,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1144, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1287, PETRI_PLACES=157, PETRI_TRANSITIONS=147} [2023-01-28 08:05:07,283 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 89 predicate places. [2023-01-28 08:05:07,283 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 147 transitions, 1287 flow [2023-01-28 08:05:07,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 153.52) internal successors, (3838), 25 states have internal predecessors, (3838), 0 states have call successors, (0), 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:07,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:05:07,284 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:05:07,292 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:05:07,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:05:07,489 INFO L420 AbstractCegarLoop]: === Iteration 26 === 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:07,489 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:05:07,489 INFO L85 PathProgramCache]: Analyzing trace with hash -228203810, now seen corresponding path program 1 times [2023-01-28 08:05:07,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:05:07,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070888811] [2023-01-28 08:05:07,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:05:07,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:05:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:05:07,730 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:05:07,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:05:07,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070888811] [2023-01-28 08:05:07,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070888811] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:05:07,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450961199] [2023-01-28 08:05:07,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:05:07,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:05:07,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:05:07,731 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:05:07,753 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:05:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:05:07,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 40 conjunts are in the unsatisfiable core [2023-01-28 08:05:07,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:05:07,912 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:05:07,997 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:05:07,999 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:05:08,020 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:05:08,048 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:05:08,074 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 13 treesize of output 9 [2023-01-28 08:05:08,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:05:08,115 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 16 treesize of output 18 [2023-01-28 08:05:08,136 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 18 treesize of output 13 [2023-01-28 08:05:08,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:05:08,163 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 16 treesize of output 18 [2023-01-28 08:05:08,195 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:05:08,196 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 19 treesize of output 11 [2023-01-28 08:05:08,253 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 21 treesize of output 16 [2023-01-28 08:05:08,289 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:05:08,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:05:08,360 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2143 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_95| Int) (v_ArrVal_2141 (Array Int Int))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2141) |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_95| 4)) 0)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_2143)) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_95|) 0))) is different from false [2023-01-28 08:05:08,389 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:05:08,389 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 23 treesize of output 24 [2023-01-28 08:05:08,395 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:05:08,395 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 39 treesize of output 35 [2023-01-28 08:05:08,398 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 22 treesize of output 18 [2023-01-28 08:05:12,434 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2135 (Array Int Int))) (= ((as const (Array Int Int)) 0) (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2135) |c_~#a~0.base|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-01-28 08:05:14,552 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:05:14,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450961199] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:05:14,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:05:14,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 20 [2023-01-28 08:05:14,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516276061] [2023-01-28 08:05:14,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:05:14,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-01-28 08:05:14,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:05:14,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-01-28 08:05:14,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=312, Unknown=2, NotChecked=74, Total=462 [2023-01-28 08:05:14,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 476 [2023-01-28 08:05:14,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 147 transitions, 1287 flow. Second operand has 22 states, 22 states have (on average 153.8181818181818) internal successors, (3384), 22 states have internal predecessors, (3384), 0 states have call successors, (0), 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:14,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:05:14,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 476 [2023-01-28 08:05:14,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:05:22,624 WARN L222 SmtUtils]: Spent 8.05s on a formula simplification. DAG size of input: 26 DAG size of output: 22 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:05:23,219 INFO L130 PetriNetUnfolder]: 631/1604 cut-off events. [2023-01-28 08:05:23,219 INFO L131 PetriNetUnfolder]: For 10152/10158 co-relation queries the response was YES. [2023-01-28 08:05:23,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8923 conditions, 1604 events. 631/1604 cut-off events. For 10152/10158 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 11700 event pairs, 177 based on Foata normal form. 9/1489 useless extension candidates. Maximal degree in co-relation 8869. Up to 945 conditions per place. [2023-01-28 08:05:23,227 INFO L137 encePairwiseOnDemand]: 462/476 looper letters, 149 selfloop transitions, 32 changer transitions 20/207 dead transitions. [2023-01-28 08:05:23,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 207 transitions, 2194 flow [2023-01-28 08:05:23,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-28 08:05:23,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-01-28 08:05:23,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1917 transitions. [2023-01-28 08:05:23,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33560924369747897 [2023-01-28 08:05:23,229 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1917 transitions. [2023-01-28 08:05:23,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1917 transitions. [2023-01-28 08:05:23,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:05:23,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1917 transitions. [2023-01-28 08:05:23,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 159.75) internal successors, (1917), 12 states have internal predecessors, (1917), 0 states have call successors, (0), 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:23,233 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:05:23,233 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:05:23,233 INFO L175 Difference]: Start difference. First operand has 157 places, 147 transitions, 1287 flow. Second operand 12 states and 1917 transitions. [2023-01-28 08:05:23,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 207 transitions, 2194 flow [2023-01-28 08:05:23,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 207 transitions, 2100 flow, removed 34 selfloop flow, removed 10 redundant places. [2023-01-28 08:05:23,251 INFO L231 Difference]: Finished difference. Result has 162 places, 161 transitions, 1477 flow [2023-01-28 08:05:23,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1229, 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=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1477, PETRI_PLACES=162, PETRI_TRANSITIONS=161} [2023-01-28 08:05:23,251 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 94 predicate places. [2023-01-28 08:05:23,251 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 161 transitions, 1477 flow [2023-01-28 08:05:23,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 153.8181818181818) internal successors, (3384), 22 states have internal predecessors, (3384), 0 states have call successors, (0), 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:23,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:05:23,252 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:05:23,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2023-01-28 08:05:23,454 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,SelfDestructingSolverStorable34 [2023-01-28 08:05:23,455 INFO L420 AbstractCegarLoop]: === Iteration 27 === 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:23,455 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:05:23,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1135934898, now seen corresponding path program 1 times [2023-01-28 08:05:23,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:05:23,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725726193] [2023-01-28 08:05:23,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:05:23,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:05:23,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:05:23,834 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:05:23,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:05:23,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725726193] [2023-01-28 08:05:23,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725726193] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:05:23,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577736196] [2023-01-28 08:05:23,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:05:23,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:05:23,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:05:23,836 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:05:23,840 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:05:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:05:23,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 43 conjunts are in the unsatisfiable core [2023-01-28 08:05:23,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:05:23,992 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:05:24,049 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:05:24,050 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:05:24,069 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:05:24,142 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 24 treesize of output 17 [2023-01-28 08:05:24,199 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:05:24,224 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:05:24,261 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:05:24,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:05:50,321 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2244 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2244) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:05:50,886 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2244 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) |c_t_funThread1of2ForFork0_#t~post39#1|))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2244) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:05:50,891 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2244 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2244) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:05:50,900 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2244 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| |c_t_funThread1of2ForFork0_#t~mem35#1|)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2244) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:05:52,904 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2244 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (store .cse0 |t_funThread1of2ForFork0_~p~0#1.offset| (select .cse0 |t_funThread1of2ForFork0_~p~0#1.offset|)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2244) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:05:52,914 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2244 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (store .cse0 |t_funThread1of2ForFork0_~p~0#1.offset| (select .cse0 |t_funThread1of2ForFork0_~p~0#1.offset|)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2244) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:05:52,923 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2239 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2244 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2239))) (store .cse0 |c_~#a~0.base| (let ((.cse1 (select .cse0 |c_~#a~0.base|))) (store .cse1 |t_funThread1of2ForFork0_~p~0#1.offset| (select .cse1 |t_funThread1of2ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2244) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:05:52,987 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:05:52,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577736196] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:05:52,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:05:52,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 10] total 27 [2023-01-28 08:05:52,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457987957] [2023-01-28 08:05:52,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:05:52,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-01-28 08:05:52,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:05:52,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-01-28 08:05:52,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=373, Unknown=18, NotChecked=322, Total=812 [2023-01-28 08:05:52,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 476 [2023-01-28 08:05:52,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 161 transitions, 1477 flow. Second operand has 29 states, 29 states have (on average 149.3793103448276) internal successors, (4332), 29 states have internal predecessors, (4332), 0 states have call successors, (0), 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:52,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:05:52,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 476 [2023-01-28 08:05:52,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:06:01,152 WARN L222 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 33 DAG size of output: 30 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:06:11,783 WARN L222 SmtUtils]: Spent 6.40s on a formula simplification. DAG size of input: 40 DAG size of output: 28 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:06:17,868 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:20,985 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:21,923 INFO L130 PetriNetUnfolder]: 633/1643 cut-off events. [2023-01-28 08:06:21,923 INFO L131 PetriNetUnfolder]: For 9934/9942 co-relation queries the response was YES. [2023-01-28 08:06:21,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9079 conditions, 1643 events. 633/1643 cut-off events. For 9934/9942 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 12196 event pairs, 140 based on Foata normal form. 4/1524 useless extension candidates. Maximal degree in co-relation 9025. Up to 609 conditions per place. [2023-01-28 08:06:21,930 INFO L137 encePairwiseOnDemand]: 462/476 looper letters, 102 selfloop transitions, 19 changer transitions 97/224 dead transitions. [2023-01-28 08:06:21,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 224 transitions, 2583 flow [2023-01-28 08:06:21,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-01-28 08:06:21,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-01-28 08:06:21,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2311 transitions. [2023-01-28 08:06:21,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32366946778711486 [2023-01-28 08:06:21,932 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2311 transitions. [2023-01-28 08:06:21,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2311 transitions. [2023-01-28 08:06:21,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:06:21,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2311 transitions. [2023-01-28 08:06:21,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 154.06666666666666) internal successors, (2311), 15 states have internal predecessors, (2311), 0 states have call successors, (0), 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:21,937 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 476.0) internal successors, (7616), 16 states have internal predecessors, (7616), 0 states have call successors, (0), 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:21,937 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 476.0) internal successors, (7616), 16 states have internal predecessors, (7616), 0 states have call successors, (0), 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:21,937 INFO L175 Difference]: Start difference. First operand has 162 places, 161 transitions, 1477 flow. Second operand 15 states and 2311 transitions. [2023-01-28 08:06:21,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 224 transitions, 2583 flow [2023-01-28 08:06:21,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 224 transitions, 2521 flow, removed 21 selfloop flow, removed 6 redundant places. [2023-01-28 08:06:21,954 INFO L231 Difference]: Finished difference. Result has 172 places, 110 transitions, 1001 flow [2023-01-28 08:06:21,954 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1415, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1001, PETRI_PLACES=172, PETRI_TRANSITIONS=110} [2023-01-28 08:06:21,954 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 104 predicate places. [2023-01-28 08:06:21,954 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 110 transitions, 1001 flow [2023-01-28 08:06:21,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 149.3793103448276) internal successors, (4332), 29 states have internal predecessors, (4332), 0 states have call successors, (0), 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:21,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:06:21,955 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:06:21,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2023-01-28 08:06:22,160 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,SelfDestructingSolverStorable35 [2023-01-28 08:06:22,160 INFO L420 AbstractCegarLoop]: === Iteration 28 === 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:22,160 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:06:22,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1293684274, now seen corresponding path program 1 times [2023-01-28 08:06:22,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:06:22,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911331031] [2023-01-28 08:06:22,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:06:22,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:06:22,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:06:22,393 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:06:22,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:06:22,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911331031] [2023-01-28 08:06:22,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911331031] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:06:22,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351810006] [2023-01-28 08:06:22,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:06:22,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:06:22,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:06:22,394 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:06:22,396 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:06:22,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:06:22,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 43 conjunts are in the unsatisfiable core [2023-01-28 08:06:22,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:06:22,554 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:22,596 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:06:22,596 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:22,613 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:22,631 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:22,694 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 24 treesize of output 17 [2023-01-28 08:06:22,742 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:06:22,781 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:06:22,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:06:38,871 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2341 (Array Int Int))) (= ((as const (Array Int Int)) 0) (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2341) |c_~#a~0.base|))) is different from false [2023-01-28 08:06:38,927 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:06:38,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351810006] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:06:38,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:06:38,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 21 [2023-01-28 08:06:38,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759247670] [2023-01-28 08:06:38,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:06:38,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-01-28 08:06:38,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:06:38,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-01-28 08:06:38,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=383, Unknown=7, NotChecked=40, Total=506 [2023-01-28 08:06:38,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 476 [2023-01-28 08:06:38,931 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 110 transitions, 1001 flow. Second operand has 23 states, 23 states have (on average 168.6086956521739) internal successors, (3878), 23 states have internal predecessors, (3878), 0 states have call successors, (0), 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,931 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:06:38,931 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 476 [2023-01-28 08:06:38,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:06:39,510 INFO L130 PetriNetUnfolder]: 344/960 cut-off events. [2023-01-28 08:06:39,510 INFO L131 PetriNetUnfolder]: For 6386/6404 co-relation queries the response was YES. [2023-01-28 08:06:39,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5211 conditions, 960 events. 344/960 cut-off events. For 6386/6404 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 6303 event pairs, 67 based on Foata normal form. 4/859 useless extension candidates. Maximal degree in co-relation 5154. Up to 319 conditions per place. [2023-01-28 08:06:39,514 INFO L137 encePairwiseOnDemand]: 463/476 looper letters, 98 selfloop transitions, 40 changer transitions 21/168 dead transitions. [2023-01-28 08:06:39,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 168 transitions, 1887 flow [2023-01-28 08:06:39,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-01-28 08:06:39,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-01-28 08:06:39,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2591 transitions. [2023-01-28 08:06:39,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36288515406162464 [2023-01-28 08:06:39,516 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2591 transitions. [2023-01-28 08:06:39,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2591 transitions. [2023-01-28 08:06:39,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:06:39,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2591 transitions. [2023-01-28 08:06:39,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 172.73333333333332) internal successors, (2591), 15 states have internal predecessors, (2591), 0 states have call successors, (0), 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,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 476.0) internal successors, (7616), 16 states have internal predecessors, (7616), 0 states have call successors, (0), 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,522 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 476.0) internal successors, (7616), 16 states have internal predecessors, (7616), 0 states have call successors, (0), 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,522 INFO L175 Difference]: Start difference. First operand has 172 places, 110 transitions, 1001 flow. Second operand 15 states and 2591 transitions. [2023-01-28 08:06:39,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 168 transitions, 1887 flow [2023-01-28 08:06:39,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 168 transitions, 1742 flow, removed 41 selfloop flow, removed 25 redundant places. [2023-01-28 08:06:39,532 INFO L231 Difference]: Finished difference. Result has 155 places, 117 transitions, 1049 flow [2023-01-28 08:06:39,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1049, PETRI_PLACES=155, PETRI_TRANSITIONS=117} [2023-01-28 08:06:39,532 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 87 predicate places. [2023-01-28 08:06:39,532 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 117 transitions, 1049 flow [2023-01-28 08:06:39,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 168.6086956521739) internal successors, (3878), 23 states have internal predecessors, (3878), 0 states have call successors, (0), 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,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:06:39,533 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:06:39,539 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:06:39,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:06:39,738 INFO L420 AbstractCegarLoop]: === Iteration 29 === 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:39,738 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:06:39,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1442627808, now seen corresponding path program 2 times [2023-01-28 08:06:39,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:06:39,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880142777] [2023-01-28 08:06:39,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:06:39,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:06:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:06:40,063 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:40,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:06:40,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880142777] [2023-01-28 08:06:40,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880142777] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:06:40,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236782813] [2023-01-28 08:06:40,064 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 08:06:40,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:06:40,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:06:40,065 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:06:40,067 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:06:40,243 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 08:06:40,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:06:40,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 38 conjunts are in the unsatisfiable core [2023-01-28 08:06:40,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:06:40,248 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:40,330 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:06:40,330 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:40,358 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:40,375 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:40,383 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 13 treesize of output 9 [2023-01-28 08:06:40,447 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:06:40,447 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 19 treesize of output 11 [2023-01-28 08:06:40,502 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 18 treesize of output 13 [2023-01-28 08:06:40,557 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 16 treesize of output 18 [2023-01-28 08:06:40,589 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 21 treesize of output 16 [2023-01-28 08:06:40,616 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:40,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:06:44,468 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 15 treesize of output 13 [2023-01-28 08:06:44,471 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 12 treesize of output 8 [2023-01-28 08:06:44,476 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_101| Int) (v_ArrVal_2447 (Array Int Int)) (v_ArrVal_2446 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_105| Int) (v_ArrVal_2449 Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_101| |v_t_funThread2of2ForFork0_~p~0#1.offset_105|) (= (select (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_105| v_ArrVal_2446)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2447) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_105| v_ArrVal_2449) |v_t_funThread1of2ForFork0_~p~0#1.offset_101|) 0))) is different from false [2023-01-28 08:06:44,483 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_101| Int) (v_ArrVal_2447 (Array Int Int)) (v_ArrVal_2442 (Array Int Int)) (v_ArrVal_2446 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_105| Int) (v_ArrVal_2449 Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_101| |v_t_funThread2of2ForFork0_~p~0#1.offset_105|) (= 0 (select (store (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2442))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_105| v_ArrVal_2446))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2447) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_105| v_ArrVal_2449) |v_t_funThread1of2ForFork0_~p~0#1.offset_101|)))) is different from false [2023-01-28 08:06:44,604 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:06:44,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236782813] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:06:44,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:06:44,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 20 [2023-01-28 08:06:44,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006675664] [2023-01-28 08:06:44,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:06:44,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-01-28 08:06:44,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:06:44,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-01-28 08:06:44,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=288, Unknown=17, NotChecked=74, Total=462 [2023-01-28 08:06:44,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 476 [2023-01-28 08:06:44,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 117 transitions, 1049 flow. Second operand has 22 states, 22 states have (on average 154.04545454545453) internal successors, (3389), 22 states have internal predecessors, (3389), 0 states have call successors, (0), 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:44,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:06:44,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 476 [2023-01-28 08:06:44,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:06:45,052 INFO L130 PetriNetUnfolder]: 366/1022 cut-off events. [2023-01-28 08:06:45,052 INFO L131 PetriNetUnfolder]: For 6258/6278 co-relation queries the response was YES. [2023-01-28 08:06:45,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5507 conditions, 1022 events. 366/1022 cut-off events. For 6258/6278 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6799 event pairs, 125 based on Foata normal form. 3/926 useless extension candidates. Maximal degree in co-relation 5455. Up to 542 conditions per place. [2023-01-28 08:06:45,057 INFO L137 encePairwiseOnDemand]: 468/476 looper letters, 95 selfloop transitions, 6 changer transitions 45/152 dead transitions. [2023-01-28 08:06:45,057 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 152 transitions, 1631 flow [2023-01-28 08:06:45,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 08:06:45,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 08:06:45,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1287 transitions. [2023-01-28 08:06:45,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3379726890756303 [2023-01-28 08:06:45,058 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1287 transitions. [2023-01-28 08:06:45,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1287 transitions. [2023-01-28 08:06:45,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:06:45,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1287 transitions. [2023-01-28 08:06:45,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 160.875) internal successors, (1287), 8 states have internal predecessors, (1287), 0 states have call successors, (0), 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:45,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 476.0) internal successors, (4284), 9 states have internal predecessors, (4284), 0 states have call successors, (0), 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:45,061 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 476.0) internal successors, (4284), 9 states have internal predecessors, (4284), 0 states have call successors, (0), 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:45,061 INFO L175 Difference]: Start difference. First operand has 155 places, 117 transitions, 1049 flow. Second operand 8 states and 1287 transitions. [2023-01-28 08:06:45,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 152 transitions, 1631 flow [2023-01-28 08:06:45,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 152 transitions, 1507 flow, removed 32 selfloop flow, removed 12 redundant places. [2023-01-28 08:06:45,071 INFO L231 Difference]: Finished difference. Result has 151 places, 104 transitions, 796 flow [2023-01-28 08:06:45,071 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=929, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=796, PETRI_PLACES=151, PETRI_TRANSITIONS=104} [2023-01-28 08:06:45,071 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 83 predicate places. [2023-01-28 08:06:45,071 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 104 transitions, 796 flow [2023-01-28 08:06:45,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 154.04545454545453) internal successors, (3389), 22 states have internal predecessors, (3389), 0 states have call successors, (0), 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:45,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:06:45,072 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:06:45,077 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:06:45,277 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,SelfDestructingSolverStorable37 [2023-01-28 08:06:45,277 INFO L420 AbstractCegarLoop]: === Iteration 30 === 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:45,277 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:06:45,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1389070090, now seen corresponding path program 3 times [2023-01-28 08:06:45,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:06:45,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600794104] [2023-01-28 08:06:45,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:06:45,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:06:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:06:45,757 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:06:45,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:06:45,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600794104] [2023-01-28 08:06:45,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600794104] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:06:45,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11103877] [2023-01-28 08:06:45,757 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 08:06:45,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:06:45,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:06:45,773 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:06:45,774 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:06:46,005 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-01-28 08:06:46,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:06:46,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 42 conjunts are in the unsatisfiable core [2023-01-28 08:06:46,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:06:46,015 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:46,097 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:06:46,098 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:46,121 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:46,148 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:46,174 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 13 treesize of output 9 [2023-01-28 08:06:46,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:06:46,233 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 16 treesize of output 18 [2023-01-28 08:06:46,263 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 18 treesize of output 13 [2023-01-28 08:06:46,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:06:46,304 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 16 treesize of output 18 [2023-01-28 08:06:46,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:06:46,319 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 16 treesize of output 18 [2023-01-28 08:06:46,371 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:06:46,371 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 19 treesize of output 11 [2023-01-28 08:06:46,422 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 21 treesize of output 16 [2023-01-28 08:06:46,470 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 16 treesize of output 18 [2023-01-28 08:06:46,496 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:06:46,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:06:46,602 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2556 (Array Int Int)) (v_ArrVal_2555 Int) (v_ArrVal_2553 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_103| Int)) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_2555)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2556) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_103|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2553) |c_~#a~0.base|) (+ 4 |v_t_funThread1of2ForFork0_~p~0#1.offset_103|)) 0)))) is different from false [2023-01-28 08:06:46,635 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:06:46,635 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 23 treesize of output 24 [2023-01-28 08:06:46,641 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:06:46,641 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 39 treesize of output 35 [2023-01-28 08:06:46,645 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 22 treesize of output 18 [2023-01-28 08:06:46,961 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (or (forall ((v_ArrVal_2556 (Array Int Int)) (v_ArrVal_2555 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_107| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_103| Int)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_107| v_ArrVal_2555)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2556) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_103|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((v_ArrVal_2556 (Array Int Int)) (v_ArrVal_2555 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_107| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_103| Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_103| |v_t_funThread2of2ForFork0_~p~0#1.offset_107|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_107| v_ArrVal_2555)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2556) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_103|) 0))))) is different from false [2023-01-28 08:06:46,994 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2546 (Array Int Int)) (v_ArrVal_2556 (Array Int Int)) (v_ArrVal_2555 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_107| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_103| Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_103| |v_t_funThread2of2ForFork0_~p~0#1.offset_107|) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2546))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_107| v_ArrVal_2555))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2556) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_103|) 0))) (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((v_ArrVal_2546 (Array Int Int)) (v_ArrVal_2556 (Array Int Int)) (v_ArrVal_2555 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_107| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_103| Int)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2546))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_107| v_ArrVal_2555))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2556) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_103|) 0)))) is different from false [2023-01-28 08:06:55,089 WARN L222 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:06:55,300 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:06:55,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11103877] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:06:55,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:06:55,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 25 [2023-01-28 08:06:55,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899349060] [2023-01-28 08:06:55,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:06:55,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-01-28 08:06:55,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:06:55,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-01-28 08:06:55,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=467, Unknown=21, NotChecked=138, Total=702 [2023-01-28 08:06:55,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 476 [2023-01-28 08:06:55,305 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 104 transitions, 796 flow. Second operand has 27 states, 27 states have (on average 149.4814814814815) internal successors, (4036), 27 states have internal predecessors, (4036), 0 states have call successors, (0), 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,305 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:06:55,305 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 476 [2023-01-28 08:06:55,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:06:56,716 INFO L130 PetriNetUnfolder]: 301/921 cut-off events. [2023-01-28 08:06:56,716 INFO L131 PetriNetUnfolder]: For 5270/5276 co-relation queries the response was YES. [2023-01-28 08:06:56,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4601 conditions, 921 events. 301/921 cut-off events. For 5270/5276 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6537 event pairs, 74 based on Foata normal form. 9/852 useless extension candidates. Maximal degree in co-relation 4551. Up to 275 conditions per place. [2023-01-28 08:06:56,720 INFO L137 encePairwiseOnDemand]: 464/476 looper letters, 78 selfloop transitions, 12 changer transitions 93/189 dead transitions. [2023-01-28 08:06:56,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 189 transitions, 1919 flow [2023-01-28 08:06:56,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-28 08:06:56,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-01-28 08:06:56,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2771 transitions. [2023-01-28 08:06:56,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32341269841269843 [2023-01-28 08:06:56,739 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2771 transitions. [2023-01-28 08:06:56,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2771 transitions. [2023-01-28 08:06:56,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:06:56,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2771 transitions. [2023-01-28 08:06:56,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 153.94444444444446) internal successors, (2771), 18 states have internal predecessors, (2771), 0 states have call successors, (0), 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:56,761 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:06:56,762 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:06:56,762 INFO L175 Difference]: Start difference. First operand has 151 places, 104 transitions, 796 flow. Second operand 18 states and 2771 transitions. [2023-01-28 08:06:56,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 189 transitions, 1919 flow [2023-01-28 08:06:56,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 189 transitions, 1878 flow, removed 11 selfloop flow, removed 11 redundant places. [2023-01-28 08:06:56,770 INFO L231 Difference]: Finished difference. Result has 157 places, 89 transitions, 679 flow [2023-01-28 08:06:56,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=757, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=679, PETRI_PLACES=157, PETRI_TRANSITIONS=89} [2023-01-28 08:06:56,771 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 89 predicate places. [2023-01-28 08:06:56,771 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 89 transitions, 679 flow [2023-01-28 08:06:56,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 149.4814814814815) internal successors, (4036), 27 states have internal predecessors, (4036), 0 states have call successors, (0), 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:56,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:06:56,772 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, 1, 1] [2023-01-28 08:06:56,796 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:06:56,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2023-01-28 08:06:56,972 INFO L420 AbstractCegarLoop]: === Iteration 31 === 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:56,973 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:06:56,973 INFO L85 PathProgramCache]: Analyzing trace with hash 611434698, now seen corresponding path program 2 times [2023-01-28 08:06:56,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:06:56,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433424189] [2023-01-28 08:06:56,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:06:56,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:06:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:06:57,266 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:57,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:06:57,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433424189] [2023-01-28 08:06:57,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433424189] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:06:57,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767784876] [2023-01-28 08:06:57,267 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 08:06:57,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:06:57,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:06:57,268 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:06:57,270 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:06:57,448 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 08:06:57,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:06:57,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 44 conjunts are in the unsatisfiable core [2023-01-28 08:06:57,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:06:57,454 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:57,494 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:06:57,494 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:57,513 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:57,593 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 24 treesize of output 17 [2023-01-28 08:06:57,614 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 21 treesize of output 23 [2023-01-28 08:06:57,713 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:06:57,747 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:57,763 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:57,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:07:09,793 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2662 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2662) |c_t_funThread2of2ForFork0_~p~0#1.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:07:11,803 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2662 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) |c_t_funThread1of2ForFork0_#t~post39#1|))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2662) |c_t_funThread2of2ForFork0_~p~0#1.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:07:11,812 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2662 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) |c_t_funThread1of2ForFork0_#t~post39#1|))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2662) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:07:13,818 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2662 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2662) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:07:15,833 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2659 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2662 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2659))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base| (let ((.cse1 (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base|))) (store .cse1 |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) (select .cse1 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2662) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:07:17,839 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2659 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2662 (Array Int Int))) (= (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ |c_t_funThread1of2ForFork0_#t~mem35#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2659))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base| (let ((.cse1 (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base|))) (store .cse1 |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) (select .cse1 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2662) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:07:20,098 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2659 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2662 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (let ((.cse2 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (store .cse2 |t_funThread1of2ForFork0_~p~0#1.offset| (+ (select .cse2 |t_funThread1of2ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2659))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base| (let ((.cse1 (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base|))) (store .cse1 |t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) (select .cse1 |t_funThread1of2ForFork0_~p~0#1.offset|)))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2662) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:07:22,224 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2659 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2662 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse2 (select |c_#memory_int| |c_~#a~0.base|))) (store .cse2 |t_funThread1of2ForFork0_~p~0#1.offset| (+ (select .cse2 |t_funThread1of2ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2659))) (store .cse0 |c_~#a~0.base| (let ((.cse1 (select .cse0 |c_~#a~0.base|))) (store .cse1 |t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) (select .cse1 |t_funThread1of2ForFork0_~p~0#1.offset|)))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2662) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:07:24,321 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2659 (Array Int Int)) (v_ArrVal_2656 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2662 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store (let ((.cse0 (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2656))) (store .cse2 |c_~#a~0.base| (let ((.cse3 (select .cse2 |c_~#a~0.base|))) (store .cse3 |t_funThread1of2ForFork0_~p~0#1.offset| (+ (select .cse3 |t_funThread1of2ForFork0_~p~0#1.offset|) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2659))) (store .cse0 |c_~#a~0.base| (let ((.cse1 (select .cse0 |c_~#a~0.base|))) (store .cse1 |t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) (select .cse1 |t_funThread1of2ForFork0_~p~0#1.offset|)))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2662) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:07:24,605 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 6 not checked. [2023-01-28 08:07:24,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767784876] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:07:24,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:07:24,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 29 [2023-01-28 08:07:24,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379837571] [2023-01-28 08:07:24,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:07:24,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-01-28 08:07:24,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:07:24,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-01-28 08:07:24,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=396, Unknown=15, NotChecked=432, Total=930 [2023-01-28 08:07:24,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 476 [2023-01-28 08:07:24,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 89 transitions, 679 flow. Second operand has 31 states, 31 states have (on average 168.25806451612902) internal successors, (5216), 31 states have internal predecessors, (5216), 0 states have call successors, (0), 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:24,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:07:24,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 476 [2023-01-28 08:07:24,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:07:38,458 WARN L222 SmtUtils]: Spent 8.22s on a formula simplification. DAG size of input: 41 DAG size of output: 37 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:08:05,189 WARN L222 SmtUtils]: Spent 22.19s on a formula simplification. DAG size of input: 42 DAG size of output: 21 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:08:07,310 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:09,316 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:11,322 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:13,346 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:15,348 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:17,370 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:19,400 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:21,462 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:23,464 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:25,513 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:27,558 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:29,613 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:47,850 WARN L222 SmtUtils]: Spent 18.18s on a formula simplification. DAG size of input: 34 DAG size of output: 18 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:08:49,911 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:51,934 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,954 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:55,959 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:58,049 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:00,058 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:02,102 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:04,138 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:06,141 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:08,232 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:10,239 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:12,269 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:14,270 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:16,273 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:18,320 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:20,356 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:22,464 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:24,767 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:27,087 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:29,110 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:31,151 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:33,188 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:33,243 INFO L130 PetriNetUnfolder]: 99/389 cut-off events. [2023-01-28 08:09:33,243 INFO L131 PetriNetUnfolder]: For 2110/2122 co-relation queries the response was YES. [2023-01-28 08:09:33,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2034 conditions, 389 events. 99/389 cut-off events. For 2110/2122 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2116 event pairs, 20 based on Foata normal form. 4/365 useless extension candidates. Maximal degree in co-relation 1981. Up to 126 conditions per place. [2023-01-28 08:09:33,245 INFO L137 encePairwiseOnDemand]: 463/476 looper letters, 47 selfloop transitions, 4 changer transitions 59/116 dead transitions. [2023-01-28 08:09:33,245 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 116 transitions, 1194 flow [2023-01-28 08:09:33,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-28 08:09:33,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-01-28 08:09:33,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2391 transitions. [2023-01-28 08:09:33,247 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3587935174069628 [2023-01-28 08:09:33,247 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2391 transitions. [2023-01-28 08:09:33,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2391 transitions. [2023-01-28 08:09:33,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:09:33,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2391 transitions. [2023-01-28 08:09:33,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 170.78571428571428) internal successors, (2391), 14 states have internal predecessors, (2391), 0 states have call successors, (0), 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:33,251 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:33,252 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:33,252 INFO L175 Difference]: Start difference. First operand has 157 places, 89 transitions, 679 flow. Second operand 14 states and 2391 transitions. [2023-01-28 08:09:33,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 116 transitions, 1194 flow [2023-01-28 08:09:33,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 116 transitions, 1101 flow, removed 18 selfloop flow, removed 26 redundant places. [2023-01-28 08:09:33,256 INFO L231 Difference]: Finished difference. Result has 131 places, 55 transitions, 359 flow [2023-01-28 08:09:33,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=579, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=359, PETRI_PLACES=131, PETRI_TRANSITIONS=55} [2023-01-28 08:09:33,258 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 63 predicate places. [2023-01-28 08:09:33,258 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 55 transitions, 359 flow [2023-01-28 08:09:33,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 168.25806451612902) internal successors, (5216), 31 states have internal predecessors, (5216), 0 states have call successors, (0), 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:33,258 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:09:33,258 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, 1, 1] [2023-01-28 08:09:33,264 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:09:33,463 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,SelfDestructingSolverStorable39 [2023-01-28 08:09:33,463 INFO L420 AbstractCegarLoop]: === Iteration 32 === 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:33,464 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:09:33,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1595959620, now seen corresponding path program 2 times [2023-01-28 08:09:33,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:09:33,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576552644] [2023-01-28 08:09:33,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:09:33,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:09:33,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:09:34,693 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:09:34,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:09:34,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576552644] [2023-01-28 08:09:34,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576552644] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:09:34,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280440817] [2023-01-28 08:09:34,693 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 08:09:34,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:09:34,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:09:34,695 INFO L229 MonitoredProcess]: Starting monitored process 37 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:34,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2023-01-28 08:09:34,870 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 08:09:34,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:09:34,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 44 conjunts are in the unsatisfiable core [2023-01-28 08:09:34,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:09:34,885 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:35,229 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:09:35,229 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:35,268 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:35,389 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:35,946 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 24 treesize of output 17 [2023-01-28 08:09:36,362 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:36,722 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:36,847 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:09:36,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:09:45,009 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2768 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2768) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:09:45,052 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2768 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2768) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:09:47,096 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2768 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (- 1) |c_t_funThread2of2ForFork0_#t~mem38#1|))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2768) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:09:49,115 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2768 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (- 1) (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2768) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:09:49,159 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2768 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= 0 (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread2of2ForFork0_#t~mem35#1|)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2768) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|))) is different from false [2023-01-28 08:09:51,177 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2768 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (store .cse0 |t_funThread2of2ForFork0_~p~0#1.offset| (select .cse0 |t_funThread2of2ForFork0_~p~0#1.offset|)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2768) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:09:53,225 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2768 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= 0 (select (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (store .cse0 |t_funThread2of2ForFork0_~p~0#1.offset| (select .cse0 |t_funThread2of2ForFork0_~p~0#1.offset|)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2768) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|))) is different from false [2023-01-28 08:09:55,272 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2768 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2763 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2763))) (store .cse0 |c_~#a~0.base| (let ((.cse1 (select .cse0 |c_~#a~0.base|))) (store .cse1 |t_funThread2of2ForFork0_~p~0#1.offset| (select .cse1 |t_funThread2of2ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2768) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:09:55,676 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:09:55,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280440817] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:09:55,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:09:55,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 10] total 25 [2023-01-28 08:09:55,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588117507] [2023-01-28 08:09:55,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:09:55,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-01-28 08:09:55,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:09:55,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-01-28 08:09:55,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=287, Unknown=11, NotChecked=328, Total=702 [2023-01-28 08:09:55,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 476 [2023-01-28 08:09:55,680 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 55 transitions, 359 flow. Second operand has 27 states, 27 states have (on average 168.14814814814815) internal successors, (4540), 27 states have internal predecessors, (4540), 0 states have call successors, (0), 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:55,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:09:55,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 476 [2023-01-28 08:09:55,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:09:57,915 INFO L130 PetriNetUnfolder]: 24/114 cut-off events. [2023-01-28 08:09:57,915 INFO L131 PetriNetUnfolder]: For 713/713 co-relation queries the response was YES. [2023-01-28 08:09:57,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 593 conditions, 114 events. 24/114 cut-off events. For 713/713 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 279 event pairs, 2 based on Foata normal form. 1/115 useless extension candidates. Maximal degree in co-relation 555. Up to 25 conditions per place. [2023-01-28 08:09:57,916 INFO L137 encePairwiseOnDemand]: 466/476 looper letters, 0 selfloop transitions, 0 changer transitions 61/61 dead transitions. [2023-01-28 08:09:57,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 61 transitions, 603 flow [2023-01-28 08:09:57,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-01-28 08:09:57,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-01-28 08:09:57,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1858 transitions. [2023-01-28 08:09:57,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35485103132161955 [2023-01-28 08:09:57,917 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1858 transitions. [2023-01-28 08:09:57,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1858 transitions. [2023-01-28 08:09:57,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:09:57,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1858 transitions. [2023-01-28 08:09:57,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 168.9090909090909) internal successors, (1858), 11 states have internal predecessors, (1858), 0 states have call successors, (0), 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:57,921 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 476.0) internal successors, (5712), 12 states have internal predecessors, (5712), 0 states have call successors, (0), 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:57,921 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 476.0) internal successors, (5712), 12 states have internal predecessors, (5712), 0 states have call successors, (0), 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:57,921 INFO L175 Difference]: Start difference. First operand has 131 places, 55 transitions, 359 flow. Second operand 11 states and 1858 transitions. [2023-01-28 08:09:57,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 61 transitions, 603 flow [2023-01-28 08:09:57,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 61 transitions, 482 flow, removed 35 selfloop flow, removed 19 redundant places. [2023-01-28 08:09:57,923 INFO L231 Difference]: Finished difference. Result has 87 places, 0 transitions, 0 flow [2023-01-28 08:09:57,923 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=0, PETRI_PLACES=87, PETRI_TRANSITIONS=0} [2023-01-28 08:09:57,923 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 19 predicate places. [2023-01-28 08:09:57,923 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 0 transitions, 0 flow [2023-01-28 08:09:57,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 168.14814814814815) internal successors, (4540), 27 states have internal predecessors, (4540), 0 states have call successors, (0), 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:57,923 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-01-28 08:09:57,924 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-01-28 08:09:57,924 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-01-28 08:09:57,924 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-01-28 08:09:57,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2023-01-28 08:09:58,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:09:58,124 INFO L445 BasicCegarLoop]: Path program histogram: [7, 6, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2023-01-28 08:09:58,125 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE (1/2) [2023-01-28 08:09:58,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 260 transitions, 538 flow [2023-01-28 08:09:58,167 INFO L130 PetriNetUnfolder]: 75/424 cut-off events. [2023-01-28 08:09:58,167 INFO L131 PetriNetUnfolder]: For 6/8 co-relation queries the response was YES. [2023-01-28 08:09:58,169 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:09:58,169 INFO L82 GeneralOperation]: Start removeDead. Operand has 220 places, 260 transitions, 538 flow [2023-01-28 08:09:58,171 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 220 places, 260 transitions, 538 flow [2023-01-28 08:09:58,171 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 08:09:58,171 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 220 places, 260 transitions, 538 flow [2023-01-28 08:09:58,171 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 220 places, 260 transitions, 538 flow [2023-01-28 08:09:58,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 260 transitions, 538 flow [2023-01-28 08:09:58,197 INFO L130 PetriNetUnfolder]: 75/424 cut-off events. [2023-01-28 08:09:58,197 INFO L131 PetriNetUnfolder]: For 6/8 co-relation queries the response was YES. [2023-01-28 08:09:58,199 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:09:58,204 INFO L119 LiptonReduction]: Number of co-enabled transitions 31416 [2023-01-28 08:10:19,202 INFO L134 LiptonReduction]: Checked pairs total: 54189 [2023-01-28 08:10:19,202 INFO L136 LiptonReduction]: Total number of compositions: 212 [2023-01-28 08:10:19,203 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-01-28 08:10:19,203 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;@7791dfe8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 08:10:19,203 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-28 08:10:19,207 INFO L130 PetriNetUnfolder]: 35/109 cut-off events. [2023-01-28 08:10:19,207 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-28 08:10:19,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:10:19,207 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2023-01-28 08:10:19,207 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 08:10:19,207 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:10:19,208 INFO L85 PathProgramCache]: Analyzing trace with hash -2023237836, now seen corresponding path program 1 times [2023-01-28 08:10:19,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:10:19,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356308160] [2023-01-28 08:10:19,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:10:19,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:10:19,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:10:19,242 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:19,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:10:19,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356308160] [2023-01-28 08:10:19,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356308160] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:10:19,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 08:10:19,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 08:10:19,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99735799] [2023-01-28 08:10:19,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:10:19,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 08:10:19,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:10:19,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 08:10:19,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 08:10:19,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 472 [2023-01-28 08:10:19,244 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:19,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:10:19,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 472 [2023-01-28 08:10:19,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:10:20,430 INFO L130 PetriNetUnfolder]: 9849/15756 cut-off events. [2023-01-28 08:10:20,430 INFO L131 PetriNetUnfolder]: For 109/109 co-relation queries the response was YES. [2023-01-28 08:10:20,446 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:20,459 INFO L137 encePairwiseOnDemand]: 438/472 looper letters, 36 selfloop transitions, 2 changer transitions 23/70 dead transitions. [2023-01-28 08:10:20,459 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 70 transitions, 272 flow [2023-01-28 08:10:20,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 08:10:20,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 08:10:20,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 710 transitions. [2023-01-28 08:10:20,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.501412429378531 [2023-01-28 08:10:20,460 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 710 transitions. [2023-01-28 08:10:20,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 710 transitions. [2023-01-28 08:10:20,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:10:20,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 710 transitions. [2023-01-28 08:10:20,461 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:20,462 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:20,462 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:20,462 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:20,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 70 transitions, 272 flow [2023-01-28 08:10:20,463 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:20,463 INFO L231 Difference]: Finished difference. Result has 71 places, 47 transitions, 116 flow [2023-01-28 08:10:20,463 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:20,464 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2023-01-28 08:10:20,464 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 47 transitions, 116 flow [2023-01-28 08:10:20,464 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:20,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:10:20,464 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-01-28 08:10:20,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-01-28 08:10:20,465 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 08:10:20,465 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:10:20,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1786261897, now seen corresponding path program 1 times [2023-01-28 08:10:20,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:10:20,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103028910] [2023-01-28 08:10:20,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:10:20,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:10:20,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:10:20,543 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:20,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:10:20,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103028910] [2023-01-28 08:10:20,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103028910] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:10:20,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949295442] [2023-01-28 08:10:20,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:10:20,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:10:20,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:10:20,545 INFO L229 MonitoredProcess]: Starting monitored process 38 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,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2023-01-28 08:10:20,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:10:20,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 3 conjunts are in the unsatisfiable core [2023-01-28 08:10:20,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:10:20,789 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:20,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:10:20,863 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:20,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949295442] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:10:20,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:10:20,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-01-28 08:10:20,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228077532] [2023-01-28 08:10:20,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:10:20,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 08:10:20,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:10:20,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 08:10:20,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-01-28 08:10:20,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 472 [2023-01-28 08:10:20,865 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:20,865 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:10:20,865 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 472 [2023-01-28 08:10:20,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:10:21,638 INFO L130 PetriNetUnfolder]: 1738/2923 cut-off events. [2023-01-28 08:10:21,639 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2023-01-28 08:10:21,641 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:21,645 INFO L137 encePairwiseOnDemand]: 469/472 looper letters, 36 selfloop transitions, 5 changer transitions 0/50 dead transitions. [2023-01-28 08:10:21,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 50 transitions, 210 flow [2023-01-28 08:10:21,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 08:10:21,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 08:10:21,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1286 transitions. [2023-01-28 08:10:21,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4540960451977401 [2023-01-28 08:10:21,646 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1286 transitions. [2023-01-28 08:10:21,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1286 transitions. [2023-01-28 08:10:21,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:10:21,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1286 transitions. [2023-01-28 08:10:21,647 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:21,648 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:21,648 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:21,648 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:21,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 50 transitions, 210 flow [2023-01-28 08:10:21,649 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:21,649 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 146 flow [2023-01-28 08:10:21,649 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:21,650 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -10 predicate places. [2023-01-28 08:10:21,650 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 146 flow [2023-01-28 08:10:21,650 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:21,650 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:10:21,650 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1] [2023-01-28 08:10:21,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2023-01-28 08:10:21,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:10:21,851 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 08:10:21,851 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:10:21,851 INFO L85 PathProgramCache]: Analyzing trace with hash -170507148, now seen corresponding path program 2 times [2023-01-28 08:10:21,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:10:21,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512462969] [2023-01-28 08:10:21,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:10:21,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:10:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:10:22,036 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:22,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:10:22,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512462969] [2023-01-28 08:10:22,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512462969] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:10:22,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782684037] [2023-01-28 08:10:22,037 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 08:10:22,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:10:22,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:10:22,038 INFO L229 MonitoredProcess]: Starting monitored process 39 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:22,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2023-01-28 08:10:22,191 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 08:10:22,191 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:10:22,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjunts are in the unsatisfiable core [2023-01-28 08:10:22,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:10:22,262 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:22,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:10:22,547 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:22,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782684037] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:10:22,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:10:22,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-01-28 08:10:22,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119117522] [2023-01-28 08:10:22,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:10:22,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-01-28 08:10:22,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:10:22,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-01-28 08:10:22,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-01-28 08:10:22,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 472 [2023-01-28 08:10:22,550 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:22,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:10:22,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 472 [2023-01-28 08:10:22,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:10:23,022 INFO L130 PetriNetUnfolder]: 1738/2929 cut-off events. [2023-01-28 08:10:23,022 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2023-01-28 08:10:23,025 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:23,028 INFO L137 encePairwiseOnDemand]: 469/472 looper letters, 36 selfloop transitions, 11 changer transitions 0/56 dead transitions. [2023-01-28 08:10:23,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 56 transitions, 276 flow [2023-01-28 08:10:23,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-28 08:10:23,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-01-28 08:10:23,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2537 transitions. [2023-01-28 08:10:23,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4479166666666667 [2023-01-28 08:10:23,030 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2537 transitions. [2023-01-28 08:10:23,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2537 transitions. [2023-01-28 08:10:23,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:10:23,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2537 transitions. [2023-01-28 08:10:23,032 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:23,034 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:23,034 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:23,034 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:23,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 56 transitions, 276 flow [2023-01-28 08:10:23,035 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:23,035 INFO L231 Difference]: Finished difference. Result has 74 places, 56 transitions, 216 flow [2023-01-28 08:10:23,036 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:23,036 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 6 predicate places. [2023-01-28 08:10:23,036 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 56 transitions, 216 flow [2023-01-28 08:10:23,036 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:23,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:10:23,036 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1] [2023-01-28 08:10:23,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2023-01-28 08:10:23,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2023-01-28 08:10:23,241 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 08:10:23,241 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:10:23,241 INFO L85 PathProgramCache]: Analyzing trace with hash 447921236, now seen corresponding path program 3 times [2023-01-28 08:10:23,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:10:23,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680779468] [2023-01-28 08:10:23,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:10:23,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:10:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 08:10:23,250 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 08:10:23,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 08:10:23,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 08:10:23,260 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 08:10:23,260 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-01-28 08:10:23,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2023-01-28 08:10:23,260 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-01-28 08:10:23,261 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-01-28 08:10:23,261 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-01-28 08:10:23,261 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-01-28 08:10:23,276 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-01-28 08:10:23,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 278 places, 330 transitions, 690 flow [2023-01-28 08:10:23,318 INFO L130 PetriNetUnfolder]: 110/619 cut-off events. [2023-01-28 08:10:23,318 INFO L131 PetriNetUnfolder]: For 19/22 co-relation queries the response was YES. [2023-01-28 08:10:23,322 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:23,322 INFO L82 GeneralOperation]: Start removeDead. Operand has 278 places, 330 transitions, 690 flow [2023-01-28 08:10:23,325 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 278 places, 330 transitions, 690 flow [2023-01-28 08:10:23,325 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 08:10:23,325 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 278 places, 330 transitions, 690 flow [2023-01-28 08:10:23,326 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 278 places, 330 transitions, 690 flow [2023-01-28 08:10:23,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 278 places, 330 transitions, 690 flow [2023-01-28 08:10:23,366 INFO L130 PetriNetUnfolder]: 110/619 cut-off events. [2023-01-28 08:10:23,367 INFO L131 PetriNetUnfolder]: For 19/22 co-relation queries the response was YES. [2023-01-28 08:10:23,371 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:23,385 INFO L119 LiptonReduction]: Number of co-enabled transitions 61608 [2023-01-28 08:10:49,685 INFO L134 LiptonReduction]: Checked pairs total: 111186 [2023-01-28 08:10:49,686 INFO L136 LiptonReduction]: Total number of compositions: 274 [2023-01-28 08:10:49,687 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 08:10:49,687 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;@7791dfe8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 08:10:49,687 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-01-28 08:10:49,688 INFO L130 PetriNetUnfolder]: 8/30 cut-off events. [2023-01-28 08:10:49,688 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 08:10:49,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:10:49,688 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-01-28 08:10:49,688 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:49,689 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:10:49,689 INFO L85 PathProgramCache]: Analyzing trace with hash 258191094, now seen corresponding path program 1 times [2023-01-28 08:10:49,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:10:49,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460510967] [2023-01-28 08:10:49,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:10:49,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:10:49,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:10:49,724 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:49,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:10:49,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460510967] [2023-01-28 08:10:49,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460510967] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:10:49,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 08:10:49,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 08:10:49,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878069020] [2023-01-28 08:10:49,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:10:49,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 08:10:49,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:10:49,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 08:10:49,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 08:10:49,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 604 [2023-01-28 08:10:49,727 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:49,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:10:49,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 604 [2023-01-28 08:10:49,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:11:08,714 INFO L130 PetriNetUnfolder]: 252661/348965 cut-off events. [2023-01-28 08:11:08,714 INFO L131 PetriNetUnfolder]: For 3589/3589 co-relation queries the response was YES. [2023-01-28 08:11:09,198 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:11:10,367 INFO L137 encePairwiseOnDemand]: 559/604 looper letters, 73 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2023-01-28 08:11:10,367 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 90 transitions, 360 flow [2023-01-28 08:11:10,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 08:11:10,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 08:11:10,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 904 transitions. [2023-01-28 08:11:10,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4988962472406181 [2023-01-28 08:11:10,369 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 904 transitions. [2023-01-28 08:11:10,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 904 transitions. [2023-01-28 08:11:10,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:11:10,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 904 transitions. [2023-01-28 08:11:10,369 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:11:10,370 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:10,370 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:10,370 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:11:10,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 90 transitions, 360 flow [2023-01-28 08:11:10,372 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:11:10,373 INFO L231 Difference]: Finished difference. Result has 91 places, 90 transitions, 220 flow [2023-01-28 08:11:10,373 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:11:10,373 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 3 predicate places. [2023-01-28 08:11:10,373 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 90 transitions, 220 flow [2023-01-28 08:11:10,373 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:11:10,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:11:10,374 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:11:10,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2023-01-28 08:11:10,374 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:11:10,374 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:11:10,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1517144130, now seen corresponding path program 1 times [2023-01-28 08:11:10,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:11:10,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48535572] [2023-01-28 08:11:10,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:11:10,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:11:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:11:10,442 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:10,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:11:10,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48535572] [2023-01-28 08:11:10,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48535572] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:11:10,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784588016] [2023-01-28 08:11:10,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:11:10,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:11:10,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:11:10,444 INFO L229 MonitoredProcess]: Starting monitored process 40 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:10,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2023-01-28 08:11:10,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:11:10,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjunts are in the unsatisfiable core [2023-01-28 08:11:10,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:11:10,649 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:11:10,649 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 08:11:10,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784588016] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:11:10,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 08:11:10,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-01-28 08:11:10,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841477285] [2023-01-28 08:11:10,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:11:10,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 08:11:10,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:11:10,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 08:11:10,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 08:11:10,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 604 [2023-01-28 08:11:10,651 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:11:10,651 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:11:10,651 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 604 [2023-01-28 08:11:10,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:11:28,550 INFO L130 PetriNetUnfolder]: 252584/348596 cut-off events. [2023-01-28 08:11:28,551 INFO L131 PetriNetUnfolder]: For 3555/3555 co-relation queries the response was YES. [2023-01-28 08:11:29,041 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:30,128 INFO L137 encePairwiseOnDemand]: 601/604 looper letters, 90 selfloop transitions, 2 changer transitions 0/107 dead transitions. [2023-01-28 08:11:30,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 107 transitions, 438 flow [2023-01-28 08:11:30,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 08:11:30,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 08:11:30,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 878 transitions. [2023-01-28 08:11:30,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4845474613686534 [2023-01-28 08:11:30,129 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 878 transitions. [2023-01-28 08:11:30,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 878 transitions. [2023-01-28 08:11:30,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:11:30,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 878 transitions. [2023-01-28 08:11:30,130 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:30,131 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:30,131 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:30,131 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:30,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 107 transitions, 438 flow [2023-01-28 08:11:30,132 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:30,133 INFO L231 Difference]: Finished difference. Result has 93 places, 91 transitions, 228 flow [2023-01-28 08:11:30,133 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:30,136 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 5 predicate places. [2023-01-28 08:11:30,137 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 91 transitions, 228 flow [2023-01-28 08:11:30,137 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:30,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:11:30,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:11:30,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2023-01-28 08:11:30,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2023-01-28 08:11:30,342 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:30,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:11:30,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1905250772, now seen corresponding path program 1 times [2023-01-28 08:11:30,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:11:30,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856965145] [2023-01-28 08:11:30,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:11:30,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:11:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:11:30,423 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:30,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:11:30,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856965145] [2023-01-28 08:11:30,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856965145] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:11:30,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103284795] [2023-01-28 08:11:30,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:11:30,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:11:30,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:11:30,425 INFO L229 MonitoredProcess]: Starting monitored process 41 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:30,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2023-01-28 08:11:30,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:11:30,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 3 conjunts are in the unsatisfiable core [2023-01-28 08:11:30,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:11:30,632 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:30,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:11:30,708 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:30,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103284795] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:11:30,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:11:30,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-01-28 08:11:30,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936420857] [2023-01-28 08:11:30,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:11:30,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 08:11:30,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:11:30,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 08:11:30,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-01-28 08:11:30,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 604 [2023-01-28 08:11:30,711 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:30,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:11:30,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 604 [2023-01-28 08:11:30,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:11:50,692 INFO L130 PetriNetUnfolder]: 254329/349484 cut-off events. [2023-01-28 08:11:50,693 INFO L131 PetriNetUnfolder]: For 12214/12214 co-relation queries the response was YES. [2023-01-28 08:11:51,258 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:52,314 INFO L137 encePairwiseOnDemand]: 601/604 looper letters, 74 selfloop transitions, 5 changer transitions 0/94 dead transitions. [2023-01-28 08:11:52,315 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 94 transitions, 398 flow [2023-01-28 08:11:52,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 08:11:52,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 08:11:52,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1653 transitions. [2023-01-28 08:11:52,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45612582781456956 [2023-01-28 08:11:52,316 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1653 transitions. [2023-01-28 08:11:52,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1653 transitions. [2023-01-28 08:11:52,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:11:52,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1653 transitions. [2023-01-28 08:11:52,317 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:52,319 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:52,319 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:52,319 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:52,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 94 transitions, 398 flow [2023-01-28 08:11:52,327 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:52,328 INFO L231 Difference]: Finished difference. Result has 100 places, 94 transitions, 262 flow [2023-01-28 08:11:52,328 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:52,328 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 12 predicate places. [2023-01-28 08:11:52,328 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 94 transitions, 262 flow [2023-01-28 08:11:52,328 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:52,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:11:52,329 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:11:52,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2023-01-28 08:11:52,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2023-01-28 08:11:52,534 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:52,536 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:11:52,536 INFO L85 PathProgramCache]: Analyzing trace with hash 409718028, now seen corresponding path program 2 times [2023-01-28 08:11:52,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:11:52,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757776507] [2023-01-28 08:11:52,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:11:52,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:11:52,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:11:52,758 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:52,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:11:52,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757776507] [2023-01-28 08:11:52,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757776507] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:11:52,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064233149] [2023-01-28 08:11:52,758 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 08:11:52,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:11:52,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:11:52,759 INFO L229 MonitoredProcess]: Starting monitored process 42 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:52,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2023-01-28 08:11:52,941 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-01-28 08:11:52,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:11:52,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 24 conjunts are in the unsatisfiable core [2023-01-28 08:11:52,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:11:52,954 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:53,258 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:11:53,259 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:53,401 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:53,681 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:53,682 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 08:11:53,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064233149] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:11:53,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 08:11:53,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-01-28 08:11:53,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889334841] [2023-01-28 08:11:53,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:11:53,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 08:11:53,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:11:53,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 08:11:53,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-01-28 08:11:53,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 604 [2023-01-28 08:11:53,684 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:53,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:11:53,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 604 [2023-01-28 08:11:53,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:12:17,567 INFO L130 PetriNetUnfolder]: 279006/382945 cut-off events. [2023-01-28 08:12:17,567 INFO L131 PetriNetUnfolder]: For 13211/13211 co-relation queries the response was YES. [2023-01-28 08:12:18,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 763388 conditions, 382945 events. 279006/382945 cut-off events. For 13211/13211 co-relation queries the response was YES. Maximal size of possible extension queue 9905. Compared 2907654 event pairs, 71861 based on Foata normal form. 0/334174 useless extension candidates. Maximal degree in co-relation 763351. Up to 317050 conditions per place. [2023-01-28 08:12:19,172 INFO L137 encePairwiseOnDemand]: 594/604 looper letters, 201 selfloop transitions, 18 changer transitions 0/233 dead transitions. [2023-01-28 08:12:19,172 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 233 transitions, 1029 flow [2023-01-28 08:12:19,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 08:12:19,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 08:12:19,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1542 transitions. [2023-01-28 08:12:19,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42549668874172186 [2023-01-28 08:12:19,174 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1542 transitions. [2023-01-28 08:12:19,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1542 transitions. [2023-01-28 08:12:19,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:12:19,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1542 transitions. [2023-01-28 08:12:19,175 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:19,177 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:19,177 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:19,177 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:19,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 233 transitions, 1029 flow [2023-01-28 08:12:19,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 233 transitions, 1015 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-01-28 08:12:19,181 INFO L231 Difference]: Finished difference. Result has 107 places, 110 transitions, 353 flow [2023-01-28 08:12:19,182 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=353, PETRI_PLACES=107, PETRI_TRANSITIONS=110} [2023-01-28 08:12:19,182 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 19 predicate places. [2023-01-28 08:12:19,182 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 110 transitions, 353 flow [2023-01-28 08:12:19,182 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:19,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:12:19,182 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:12:19,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2023-01-28 08:12:19,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2023-01-28 08:12:19,384 INFO L420 AbstractCegarLoop]: === Iteration 5 === 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:19,385 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:12:19,385 INFO L85 PathProgramCache]: Analyzing trace with hash 390203361, now seen corresponding path program 1 times [2023-01-28 08:12:19,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:12:19,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107866327] [2023-01-28 08:12:19,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:12:19,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:12:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:12:19,623 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 08:12:19,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:12:19,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107866327] [2023-01-28 08:12:19,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107866327] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:12:19,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894029039] [2023-01-28 08:12:19,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:12:19,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:12:19,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:12:19,625 INFO L229 MonitoredProcess]: Starting monitored process 43 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:19,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2023-01-28 08:12:19,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:12:19,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 6 conjunts are in the unsatisfiable core [2023-01-28 08:12:19,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:12:19,930 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 08:12:19,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:12:20,250 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 08:12:20,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894029039] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:12:20,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:12:20,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-01-28 08:12:20,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681744210] [2023-01-28 08:12:20,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:12:20,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-01-28 08:12:20,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:12:20,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-01-28 08:12:20,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-01-28 08:12:20,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 604 [2023-01-28 08:12:20,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 110 transitions, 353 flow. Second operand has 13 states, 13 states have (on average 263.61538461538464) internal successors, (3427), 13 states have internal predecessors, (3427), 0 states have call successors, (0), 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:20,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:12:20,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 604 [2023-01-28 08:12:20,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:12:44,556 INFO L130 PetriNetUnfolder]: 265123/367720 cut-off events. [2023-01-28 08:12:44,556 INFO L131 PetriNetUnfolder]: For 66603/66608 co-relation queries the response was YES. [2023-01-28 08:12:45,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 788026 conditions, 367720 events. 265123/367720 cut-off events. For 66603/66608 co-relation queries the response was YES. Maximal size of possible extension queue 9620. Compared 2836509 event pairs, 236455 based on Foata normal form. 6/333257 useless extension candidates. Maximal degree in co-relation 787967. Up to 351257 conditions per place. [2023-01-28 08:12:46,509 INFO L137 encePairwiseOnDemand]: 601/604 looper letters, 90 selfloop transitions, 11 changer transitions 0/116 dead transitions. [2023-01-28 08:12:46,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 116 transitions, 591 flow [2023-01-28 08:12:46,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-28 08:12:46,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-01-28 08:12:46,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3234 transitions. [2023-01-28 08:12:46,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4461920529801324 [2023-01-28 08:12:46,511 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 3234 transitions. [2023-01-28 08:12:46,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 3234 transitions. [2023-01-28 08:12:46,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:12:46,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 3234 transitions. [2023-01-28 08:12:46,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 269.5) internal successors, (3234), 12 states have internal predecessors, (3234), 0 states have call successors, (0), 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:46,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 604.0) internal successors, (7852), 13 states have internal predecessors, (7852), 0 states have call successors, (0), 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:46,516 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 604.0) internal successors, (7852), 13 states have internal predecessors, (7852), 0 states have call successors, (0), 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:46,516 INFO L175 Difference]: Start difference. First operand has 107 places, 110 transitions, 353 flow. Second operand 12 states and 3234 transitions. [2023-01-28 08:12:46,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 116 transitions, 591 flow [2023-01-28 08:12:46,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 116 transitions, 591 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 08:12:46,550 INFO L231 Difference]: Finished difference. Result has 124 places, 116 transitions, 437 flow [2023-01-28 08:12:46,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=604, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=437, PETRI_PLACES=124, PETRI_TRANSITIONS=116} [2023-01-28 08:12:46,550 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 36 predicate places. [2023-01-28 08:12:46,550 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 116 transitions, 437 flow [2023-01-28 08:12:46,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 263.61538461538464) internal successors, (3427), 13 states have internal predecessors, (3427), 0 states have call successors, (0), 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:46,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:12:46,551 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:12:46,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2023-01-28 08:12:46,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2023-01-28 08:12:46,756 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:46,757 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:12:46,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1923928801, now seen corresponding path program 2 times [2023-01-28 08:12:46,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:12:46,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132057308] [2023-01-28 08:12:46,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:12:46,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:12:46,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:12:47,082 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:47,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:12:47,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132057308] [2023-01-28 08:12:47,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132057308] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:12:47,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552466471] [2023-01-28 08:12:47,083 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 08:12:47,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:12:47,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:12:47,084 INFO L229 MonitoredProcess]: Starting monitored process 44 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:47,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2023-01-28 08:12:47,264 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 08:12:47,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:12:47,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 25 conjunts are in the unsatisfiable core [2023-01-28 08:12:47,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:12:47,295 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:47,600 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:12:47,600 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:47,703 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:47,816 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:48,022 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:48,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:12:56,178 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3048 (Array Int Int))) (= ((as const (Array Int Int)) 0) (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3048) |c_~#a~0.base|))) is different from false [2023-01-28 08:12:56,508 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:12:56,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552466471] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:12:56,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:12:56,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2023-01-28 08:12:56,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357288843] [2023-01-28 08:12:56,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:12:56,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-01-28 08:12:56,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:12:56,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-01-28 08:12:56,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=4, NotChecked=18, Total=132 [2023-01-28 08:12:56,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 604 [2023-01-28 08:12:56,511 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 116 transitions, 437 flow. Second operand has 12 states, 12 states have (on average 223.5) internal successors, (2682), 12 states have internal predecessors, (2682), 0 states have call successors, (0), 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:56,511 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:12:56,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 604 [2023-01-28 08:12:56,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:13:04,766 WARN L222 SmtUtils]: Spent 8.18s on a formula simplification. DAG size of input: 21 DAG size of output: 19 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-01-28 08:13:07,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 08:13:07,354 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-01-28 08:13:07,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2023-01-28 08:13:07,373 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-28 08:13:07,374 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:07,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50 [2023-01-28 08:13:07,555 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (12states, 221/604 universal loopers) in iteration 6,while PetriNetUnfolder was constructing finite prefix that currently has 3367 conditions, 1387 events (806/1386 cut-off events. For 825/825 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 9209 event pairs, 158 based on Foata normal form. 0/1513 useless extension candidates. Maximal degree in co-relation 3324. Up to 735 conditions per place.). [2023-01-28 08:13:07,555 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-01-28 08:13:07,555 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-01-28 08:13:07,555 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-01-28 08:13:07,555 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-01-28 08:13:07,555 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2023-01-28 08:13:07,556 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/2) [2023-01-28 08:13:07,556 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2023-01-28 08:13:07,556 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 08:13:07,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 08:13:07 BasicIcfg [2023-01-28 08:13:07,561 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 08:13:07,561 INFO L158 Benchmark]: Toolchain (without parser) took 824316.18ms. Allocated memory was 666.9MB in the beginning and 16.0GB in the end (delta: 15.3GB). Free memory was 612.4MB in the beginning and 10.4GB in the end (delta: -9.8GB). Peak memory consumption was 5.6GB. Max. memory is 16.0GB. [2023-01-28 08:13:07,561 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 350.2MB. Free memory was 299.0MB in the beginning and 298.9MB in the end (delta: 132.8kB). There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 08:13:07,561 INFO L158 Benchmark]: CACSL2BoogieTranslator took 422.62ms. Allocated memory is still 666.9MB. Free memory was 612.4MB in the beginning and 583.1MB in the end (delta: 29.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-01-28 08:13:07,562 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.28ms. Allocated memory is still 666.9MB. Free memory was 582.6MB in the beginning and 580.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 08:13:07,562 INFO L158 Benchmark]: Boogie Preprocessor took 22.26ms. Allocated memory is still 666.9MB. Free memory was 580.0MB in the beginning and 577.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 08:13:07,562 INFO L158 Benchmark]: RCFGBuilder took 435.66ms. Allocated memory is still 666.9MB. Free memory was 577.9MB in the beginning and 559.5MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-01-28 08:13:07,562 INFO L158 Benchmark]: TraceAbstraction took 823399.46ms. Allocated memory was 666.9MB in the beginning and 16.0GB in the end (delta: 15.3GB). Free memory was 559.0MB in the beginning and 10.4GB in the end (delta: -9.8GB). Peak memory consumption was 5.5GB. Max. memory is 16.0GB. [2023-01-28 08:13:07,562 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.16ms. Allocated memory is still 350.2MB. Free memory was 299.0MB in the beginning and 298.9MB in the end (delta: 132.8kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 422.62ms. Allocated memory is still 666.9MB. Free memory was 612.4MB in the beginning and 583.1MB in the end (delta: 29.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 32.28ms. Allocated memory is still 666.9MB. Free memory was 582.6MB in the beginning and 580.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 22.26ms. Allocated memory is still 666.9MB. Free memory was 580.0MB in the beginning and 577.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 435.66ms. Allocated memory is still 666.9MB. Free memory was 577.9MB in the beginning and 559.5MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 823399.46ms. Allocated memory was 666.9MB in the beginning and 16.0GB in the end (delta: 15.3GB). Free memory was 559.0MB in the beginning and 10.4GB in the end (delta: -9.8GB). Peak memory consumption was 5.5GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.3s, 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: 2.0s, 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.8s, 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: 21.0s, 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: 26.4s, 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 (12states, 221/604 universal loopers) in iteration 6,while PetriNetUnfolder was constructing finite prefix that currently has 3367 conditions, 1387 events (806/1386 cut-off events. For 825/825 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 9209 event pairs, 158 based on Foata normal form. 0/1513 useless extension candidates. Maximal degree in co-relation 3324. Up to 735 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 (12states, 221/604 universal loopers) in iteration 6,while PetriNetUnfolder was constructing finite prefix that currently has 3367 conditions, 1387 events (806/1386 cut-off events. For 825/825 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 9209 event pairs, 158 based on Foata normal form. 0/1513 useless extension candidates. Maximal degree in co-relation 3324. Up to 735 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: 5.2s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 127 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 127 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.6s InterpolantComputationTime, 100 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 117 ConstructedInterpolants, 0 QuantifiedInterpolants, 303 SizeOfPredicates, 5 NumberOfNonLiveVariables, 530 ConjunctsInSsa, 35 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: 625.3s, OverallIterations: 32, TraceHistogramMax: 10, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 311.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 651 mSolverCounterUnknown, 4154 SdHoareTripleChecker+Valid, 147.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4154 mSDsluCounter, 275 SdHoareTripleChecker+Invalid, 145.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 7688 IncrementalHoareTripleChecker+Unchecked, 254 mSDsCounter, 876 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16842 IncrementalHoareTripleChecker+Invalid, 26057 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 876 mSolverCounterUnsat, 21 mSDtfsCounter, 16842 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 651 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2248 GetRequests, 1378 SyntacticMatches, 74 SemanticMatches, 796 ConstructedPredicates, 75 IntricatePredicates, 8 DeprecatedPredicates, 4801 ImplicationChecksByTransitivity, 427.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1691occurred in iteration=17, InterpolantAutomatonStates: 402, 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.4s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 299.7s InterpolantComputationTime, 1774 NumberOfCodeBlocks, 1736 NumberOfCodeBlocksAsserted, 95 NumberOfCheckSat, 2535 ConstructedInterpolants, 790 QuantifiedInterpolants, 54113 SizeOfPredicates, 244 NumberOfNonLiveVariables, 7091 ConjunctsInSsa, 1016 ConjunctsInUnsatCore, 90 InterpolantComputations, 4 PerfectInterpolantSequences, 4355/4681 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: 164.3s, OverallIterations: 6, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 124.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 26.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 393 SdHoareTripleChecker+Valid, 8.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 393 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 8.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 116 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1745 IncrementalHoareTripleChecker+Invalid, 1874 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 0 mSDtfsCounter, 1745 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 18.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=437occurred in iteration=5, InterpolantAutomatonStates: 30, 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, 11.4s InterpolantComputationTime, 138 NumberOfCodeBlocks, 134 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 171 ConstructedInterpolants, 19 QuantifiedInterpolants, 1118 SizeOfPredicates, 11 NumberOfNonLiveVariables, 725 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 14 InterpolantComputations, 3 PerfectInterpolantSequences, 185/232 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: 3.4s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.1s, 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.1s 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.1s SatisfiabilityAnalysisTime, 0.2s 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: 25.1s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 21.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.5s 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.5s 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.8s 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