/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-NoLbe-Before.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_75-tricky_address2_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 06:12:35,259 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 06:12:35,269 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 06:12:35,315 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 06:12:35,315 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 06:12:35,318 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 06:12:35,320 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 06:12:35,323 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 06:12:35,325 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 06:12:35,329 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 06:12:35,330 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 06:12:35,331 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 06:12:35,331 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 06:12:35,332 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 06:12:35,334 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 06:12:35,336 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 06:12:35,337 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 06:12:35,337 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 06:12:35,339 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 06:12:35,344 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 06:12:35,345 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 06:12:35,346 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 06:12:35,347 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 06:12:35,348 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 06:12:35,354 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 06:12:35,354 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 06:12:35,354 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 06:12:35,355 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 06:12:35,356 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 06:12:35,356 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 06:12:35,357 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 06:12:35,357 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 06:12:35,359 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 06:12:35,359 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 06:12:35,360 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 06:12:35,360 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 06:12:35,361 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 06:12:35,361 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 06:12:35,361 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 06:12:35,362 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 06:12:35,362 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 06:12:35,363 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-Before.epf [2022-01-19 06:12:35,390 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 06:12:35,390 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 06:12:35,391 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 06:12:35,391 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 06:12:35,392 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 06:12:35,392 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 06:12:35,392 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 06:12:35,392 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 06:12:35,392 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 06:12:35,393 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 06:12:35,393 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 06:12:35,393 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 06:12:35,393 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 06:12:35,394 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 06:12:35,394 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 06:12:35,394 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 06:12:35,394 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 06:12:35,394 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 06:12:35,394 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 06:12:35,394 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 06:12:35,394 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 06:12:35,394 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 06:12:35,395 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 06:12:35,395 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 06:12:35,395 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 06:12:35,395 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 06:12:35,395 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 06:12:35,396 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 06:12:35,396 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 06:12:35,396 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 06:12:35,396 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 06:12:35,396 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 06:12:35,397 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-19 06:12:35,605 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 06:12:35,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 06:12:35,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 06:12:35,629 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 06:12:35,630 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 06:12:35,631 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_75-tricky_address2_racefree.i [2022-01-19 06:12:35,685 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8484a41e4/6198b03b4bfb4368b36d6880befd555f/FLAGb20fb19b7 [2022-01-19 06:12:36,120 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 06:12:36,120 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_75-tricky_address2_racefree.i [2022-01-19 06:12:36,133 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8484a41e4/6198b03b4bfb4368b36d6880befd555f/FLAGb20fb19b7 [2022-01-19 06:12:36,148 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8484a41e4/6198b03b4bfb4368b36d6880befd555f [2022-01-19 06:12:36,156 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 06:12:36,157 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 06:12:36,158 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 06:12:36,158 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 06:12:36,161 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 06:12:36,161 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 06:12:36" (1/1) ... [2022-01-19 06:12:36,162 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@632b8041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:12:36, skipping insertion in model container [2022-01-19 06:12:36,162 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 06:12:36" (1/1) ... [2022-01-19 06:12:36,167 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 06:12:36,220 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 06:12:36,589 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_75-tricky_address2_racefree.i[41323,41336] [2022-01-19 06:12:36,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 06:12:36,644 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 06:12:36,667 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_75-tricky_address2_racefree.i[41323,41336] [2022-01-19 06:12:36,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 06:12:36,723 INFO L208 MainTranslator]: Completed translation [2022-01-19 06:12:36,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:12:36 WrapperNode [2022-01-19 06:12:36,724 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 06:12:36,725 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 06:12:36,725 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 06:12:36,725 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 06:12:36,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:12:36" (1/1) ... [2022-01-19 06:12:36,757 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:12:36" (1/1) ... [2022-01-19 06:12:36,783 INFO L137 Inliner]: procedures = 270, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 186 [2022-01-19 06:12:36,784 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 06:12:36,786 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 06:12:36,786 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 06:12:36,786 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 06:12:36,793 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:12:36" (1/1) ... [2022-01-19 06:12:36,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:12:36" (1/1) ... [2022-01-19 06:12:36,797 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:12:36" (1/1) ... [2022-01-19 06:12:36,797 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:12:36" (1/1) ... [2022-01-19 06:12:36,805 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:12:36" (1/1) ... [2022-01-19 06:12:36,811 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:12:36" (1/1) ... [2022-01-19 06:12:36,813 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:12:36" (1/1) ... [2022-01-19 06:12:36,816 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 06:12:36,817 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 06:12:36,817 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 06:12:36,817 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 06:12:36,818 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:12:36" (1/1) ... [2022-01-19 06:12:36,824 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 06:12:36,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:12:36,847 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-19 06:12:36,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-19 06:12:36,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 06:12:36,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 06:12:36,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 06:12:36,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 06:12:36,886 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-01-19 06:12:36,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 06:12:36,886 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-01-19 06:12:36,887 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-01-19 06:12:36,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 06:12:36,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 06:12:36,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 06:12:36,893 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 06:12:36,988 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 06:12:36,989 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 06:12:37,220 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 06:12:37,227 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 06:12:37,228 INFO L299 CfgBuilder]: Removed 23 assume(true) statements. [2022-01-19 06:12:37,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 06:12:37 BoogieIcfgContainer [2022-01-19 06:12:37,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 06:12:37,231 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 06:12:37,231 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 06:12:37,233 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 06:12:37,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 06:12:36" (1/3) ... [2022-01-19 06:12:37,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b8c104a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 06:12:37, skipping insertion in model container [2022-01-19 06:12:37,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:12:36" (2/3) ... [2022-01-19 06:12:37,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b8c104a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 06:12:37, skipping insertion in model container [2022-01-19 06:12:37,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 06:12:37" (3/3) ... [2022-01-19 06:12:37,236 INFO L111 eAbstractionObserver]: Analyzing ICFG 28-race_reach_75-tricky_address2_racefree.i [2022-01-19 06:12:37,240 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 06:12:37,240 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-19 06:12:37,240 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 06:12:37,281 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,281 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,281 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,281 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,282 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,282 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,282 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,282 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,282 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,283 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,283 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,283 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,284 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,284 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,284 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,284 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,284 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,284 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,285 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,285 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,285 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,286 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,286 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,286 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,286 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,286 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,286 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,287 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,287 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,287 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,287 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,287 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,288 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,288 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,288 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,288 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,289 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,289 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,289 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,289 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,290 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,290 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,290 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,290 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,290 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,291 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,291 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,292 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,292 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,292 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,292 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,292 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,293 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,293 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,293 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,293 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,294 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,294 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,294 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,294 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,294 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,294 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,295 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,295 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,295 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,295 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,296 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,296 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,296 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,296 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,296 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,297 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,297 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,297 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,297 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,297 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,298 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,298 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,298 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,298 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,299 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,299 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,299 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,299 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,299 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,299 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,300 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,300 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,300 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,300 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,301 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,301 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,301 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,301 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,301 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,301 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,302 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,302 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,302 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,302 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,303 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,303 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,303 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,303 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,303 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,303 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,303 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,304 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,304 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,304 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,304 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,305 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,305 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,305 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,305 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,305 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,305 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,306 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,306 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,306 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,306 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,306 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,306 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,307 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,307 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,307 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,310 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,310 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,311 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,311 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,311 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,311 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,311 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,311 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,312 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,312 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,312 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,312 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,312 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,313 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,313 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,313 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,313 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,313 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,314 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,314 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,314 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,314 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:37,321 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-01-19 06:12:37,358 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 06:12:37,363 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=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, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 06:12:37,363 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-19 06:12:37,377 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 169 places, 197 transitions, 402 flow [2022-01-19 06:12:37,465 INFO L129 PetriNetUnfolder]: 45/269 cut-off events. [2022-01-19 06:12:37,465 INFO L130 PetriNetUnfolder]: For 1/2 co-relation queries the response was YES. [2022-01-19 06:12:37,478 INFO L84 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 269 events. 45/269 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 860 event pairs, 0 based on Foata normal form. 0/218 useless extension candidates. Maximal degree in co-relation 147. Up to 8 conditions per place. [2022-01-19 06:12:37,478 INFO L82 GeneralOperation]: Start removeDead. Operand has 169 places, 197 transitions, 402 flow [2022-01-19 06:12:37,484 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 165 places, 192 transitions, 389 flow [2022-01-19 06:12:37,501 INFO L129 PetriNetUnfolder]: 12/127 cut-off events. [2022-01-19 06:12:37,502 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 06:12:37,502 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:12:37,502 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:12:37,503 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:12:37,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:12:37,507 INFO L85 PathProgramCache]: Analyzing trace with hash -706001553, now seen corresponding path program 1 times [2022-01-19 06:12:37,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:12:37,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817882955] [2022-01-19 06:12:37,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:12:37,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:12:37,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:12:37,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:12:37,661 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:12:37,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817882955] [2022-01-19 06:12:37,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817882955] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:12:37,661 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:12:37,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 06:12:37,663 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447850064] [2022-01-19 06:12:37,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:12:37,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 06:12:37,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:12:37,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 06:12:37,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 06:12:37,697 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 197 [2022-01-19 06:12:37,700 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 192 transitions, 389 flow. Second operand has 2 states, 2 states have (on average 167.0) internal successors, (334), 2 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:37,700 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:12:37,700 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 197 [2022-01-19 06:12:37,701 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:12:37,745 INFO L129 PetriNetUnfolder]: 4/221 cut-off events. [2022-01-19 06:12:37,745 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 06:12:37,747 INFO L84 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 221 events. 4/221 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 641 event pairs, 0 based on Foata normal form. 40/248 useless extension candidates. Maximal degree in co-relation 122. Up to 4 conditions per place. [2022-01-19 06:12:37,748 INFO L132 encePairwiseOnDemand]: 170/197 looper letters, 1 selfloop transitions, 0 changer transitions 1/163 dead transitions. [2022-01-19 06:12:37,748 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 163 transitions, 333 flow [2022-01-19 06:12:37,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 06:12:37,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 06:12:37,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 360 transitions. [2022-01-19 06:12:37,762 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9137055837563451 [2022-01-19 06:12:37,762 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 360 transitions. [2022-01-19 06:12:37,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 360 transitions. [2022-01-19 06:12:37,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:12:37,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 360 transitions. [2022-01-19 06:12:37,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 180.0) internal successors, (360), 2 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:37,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:37,775 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:37,777 INFO L186 Difference]: Start difference. First operand has 165 places, 192 transitions, 389 flow. Second operand 2 states and 360 transitions. [2022-01-19 06:12:37,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 163 transitions, 333 flow [2022-01-19 06:12:37,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 163 transitions, 333 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 06:12:37,784 INFO L242 Difference]: Finished difference. Result has 164 places, 162 transitions, 329 flow [2022-01-19 06:12:37,786 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=329, PETRI_PLACES=164, PETRI_TRANSITIONS=162} [2022-01-19 06:12:37,789 INFO L334 CegarLoopForPetriNet]: 165 programPoint places, -1 predicate places. [2022-01-19 06:12:37,789 INFO L470 AbstractCegarLoop]: Abstraction has has 164 places, 162 transitions, 329 flow [2022-01-19 06:12:37,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 167.0) internal successors, (334), 2 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:37,790 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:12:37,790 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:12:37,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 06:12:37,791 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:12:37,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:12:37,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1763164273, now seen corresponding path program 1 times [2022-01-19 06:12:37,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:12:37,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645755869] [2022-01-19 06:12:37,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:12:37,792 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:12:37,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:12:37,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:12:37,901 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:12:37,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645755869] [2022-01-19 06:12:37,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645755869] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:12:37,901 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:12:37,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 06:12:37,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077323931] [2022-01-19 06:12:37,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:12:37,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 06:12:37,903 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:12:37,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 06:12:37,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 06:12:37,906 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 197 [2022-01-19 06:12:37,907 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 162 transitions, 329 flow. Second operand has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:37,907 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:12:37,907 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 197 [2022-01-19 06:12:37,907 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:12:37,961 INFO L129 PetriNetUnfolder]: 4/224 cut-off events. [2022-01-19 06:12:37,962 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 06:12:37,965 INFO L84 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 224 events. 4/224 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 638 event pairs, 0 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 239. Up to 9 conditions per place. [2022-01-19 06:12:37,967 INFO L132 encePairwiseOnDemand]: 194/197 looper letters, 10 selfloop transitions, 2 changer transitions 0/166 dead transitions. [2022-01-19 06:12:37,967 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 166 transitions, 361 flow [2022-01-19 06:12:37,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 06:12:37,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 06:12:37,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 490 transitions. [2022-01-19 06:12:37,975 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8291032148900169 [2022-01-19 06:12:37,975 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 490 transitions. [2022-01-19 06:12:37,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 490 transitions. [2022-01-19 06:12:37,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:12:37,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 490 transitions. [2022-01-19 06:12:37,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:37,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:37,981 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:37,981 INFO L186 Difference]: Start difference. First operand has 164 places, 162 transitions, 329 flow. Second operand 3 states and 490 transitions. [2022-01-19 06:12:37,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 166 transitions, 361 flow [2022-01-19 06:12:37,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 166 transitions, 361 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 06:12:38,002 INFO L242 Difference]: Finished difference. Result has 166 places, 163 transitions, 341 flow [2022-01-19 06:12:38,003 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=341, PETRI_PLACES=166, PETRI_TRANSITIONS=163} [2022-01-19 06:12:38,004 INFO L334 CegarLoopForPetriNet]: 165 programPoint places, 1 predicate places. [2022-01-19 06:12:38,004 INFO L470 AbstractCegarLoop]: Abstraction has has 166 places, 163 transitions, 341 flow [2022-01-19 06:12:38,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:38,004 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:12:38,004 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:12:38,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 06:12:38,005 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:12:38,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:12:38,006 INFO L85 PathProgramCache]: Analyzing trace with hash -2008438335, now seen corresponding path program 1 times [2022-01-19 06:12:38,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:12:38,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035325992] [2022-01-19 06:12:38,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:12:38,006 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:12:38,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:12:38,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:12:38,108 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:12:38,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035325992] [2022-01-19 06:12:38,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035325992] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:12:38,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251857017] [2022-01-19 06:12:38,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:12:38,109 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:12:38,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:12:38,115 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:12:38,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-19 06:12:38,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:12:38,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-19 06:12:38,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:12:38,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:12:38,360 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 06:12:38,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251857017] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:12:38,360 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 06:12:38,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-01-19 06:12:38,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551535467] [2022-01-19 06:12:38,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:12:38,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 06:12:38,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:12:38,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 06:12:38,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-19 06:12:38,370 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 197 [2022-01-19 06:12:38,370 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 163 transitions, 341 flow. Second operand has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:38,371 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:12:38,371 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 197 [2022-01-19 06:12:38,371 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:12:38,403 INFO L129 PetriNetUnfolder]: 3/170 cut-off events. [2022-01-19 06:12:38,403 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 06:12:38,404 INFO L84 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 170 events. 3/170 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 322 event pairs, 0 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 188. Up to 6 conditions per place. [2022-01-19 06:12:38,405 INFO L132 encePairwiseOnDemand]: 194/197 looper letters, 8 selfloop transitions, 2 changer transitions 0/165 dead transitions. [2022-01-19 06:12:38,405 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 165 transitions, 365 flow [2022-01-19 06:12:38,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 06:12:38,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 06:12:38,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 488 transitions. [2022-01-19 06:12:38,407 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8257191201353637 [2022-01-19 06:12:38,407 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 488 transitions. [2022-01-19 06:12:38,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 488 transitions. [2022-01-19 06:12:38,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:12:38,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 488 transitions. [2022-01-19 06:12:38,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:38,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:38,411 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:38,411 INFO L186 Difference]: Start difference. First operand has 166 places, 163 transitions, 341 flow. Second operand 3 states and 488 transitions. [2022-01-19 06:12:38,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 165 transitions, 365 flow [2022-01-19 06:12:38,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 165 transitions, 363 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 06:12:38,417 INFO L242 Difference]: Finished difference. Result has 168 places, 163 transitions, 347 flow [2022-01-19 06:12:38,417 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=347, PETRI_PLACES=168, PETRI_TRANSITIONS=163} [2022-01-19 06:12:38,419 INFO L334 CegarLoopForPetriNet]: 165 programPoint places, 3 predicate places. [2022-01-19 06:12:38,420 INFO L470 AbstractCegarLoop]: Abstraction has has 168 places, 163 transitions, 347 flow [2022-01-19 06:12:38,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:38,421 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:12:38,421 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:12:38,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-19 06:12:38,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:12:38,644 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:12:38,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:12:38,645 INFO L85 PathProgramCache]: Analyzing trace with hash -478841000, now seen corresponding path program 1 times [2022-01-19 06:12:38,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:12:38,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404755179] [2022-01-19 06:12:38,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:12:38,645 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:12:38,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:12:38,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:12:38,702 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:12:38,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404755179] [2022-01-19 06:12:38,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404755179] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:12:38,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136047122] [2022-01-19 06:12:38,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:12:38,703 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:12:38,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:12:38,704 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:12:38,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-19 06:12:38,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:12:38,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-19 06:12:38,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:12:38,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:12:38,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:12:39,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:12:39,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136047122] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:12:39,069 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:12:39,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-19 06:12:39,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221556838] [2022-01-19 06:12:39,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:12:39,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 06:12:39,072 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:12:39,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 06:12:39,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-01-19 06:12:39,075 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 197 [2022-01-19 06:12:39,077 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 163 transitions, 347 flow. Second operand has 10 states, 10 states have (on average 160.1) internal successors, (1601), 10 states have internal predecessors, (1601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:39,077 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:12:39,077 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 197 [2022-01-19 06:12:39,077 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:12:39,166 INFO L129 PetriNetUnfolder]: 3/177 cut-off events. [2022-01-19 06:12:39,166 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 06:12:39,167 INFO L84 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 177 events. 3/177 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 317 event pairs, 0 based on Foata normal form. 2/173 useless extension candidates. Maximal degree in co-relation 209. Up to 6 conditions per place. [2022-01-19 06:12:39,168 INFO L132 encePairwiseOnDemand]: 191/197 looper letters, 11 selfloop transitions, 9 changer transitions 0/173 dead transitions. [2022-01-19 06:12:39,168 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 173 transitions, 409 flow [2022-01-19 06:12:39,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 06:12:39,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 06:12:39,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1444 transitions. [2022-01-19 06:12:39,172 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.81443880428652 [2022-01-19 06:12:39,172 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1444 transitions. [2022-01-19 06:12:39,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1444 transitions. [2022-01-19 06:12:39,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:12:39,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1444 transitions. [2022-01-19 06:12:39,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 160.44444444444446) internal successors, (1444), 9 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:39,180 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 197.0) internal successors, (1970), 10 states have internal predecessors, (1970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:39,181 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 197.0) internal successors, (1970), 10 states have internal predecessors, (1970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:39,181 INFO L186 Difference]: Start difference. First operand has 168 places, 163 transitions, 347 flow. Second operand 9 states and 1444 transitions. [2022-01-19 06:12:39,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 173 transitions, 409 flow [2022-01-19 06:12:39,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 173 transitions, 405 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 06:12:39,185 INFO L242 Difference]: Finished difference. Result has 177 places, 169 transitions, 393 flow [2022-01-19 06:12:39,185 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=393, PETRI_PLACES=177, PETRI_TRANSITIONS=169} [2022-01-19 06:12:39,186 INFO L334 CegarLoopForPetriNet]: 165 programPoint places, 12 predicate places. [2022-01-19 06:12:39,186 INFO L470 AbstractCegarLoop]: Abstraction has has 177 places, 169 transitions, 393 flow [2022-01-19 06:12:39,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 160.1) internal successors, (1601), 10 states have internal predecessors, (1601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:39,187 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:12:39,187 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:12:39,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-19 06:12:39,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-01-19 06:12:39,404 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:12:39,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:12:39,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1620698456, now seen corresponding path program 2 times [2022-01-19 06:12:39,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:12:39,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432050662] [2022-01-19 06:12:39,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:12:39,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:12:39,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:12:39,512 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-19 06:12:39,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:12:39,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432050662] [2022-01-19 06:12:39,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432050662] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:12:39,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462392660] [2022-01-19 06:12:39,513 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 06:12:39,513 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:12:39,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:12:39,515 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:12:39,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-19 06:12:39,605 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 06:12:39,605 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:12:39,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-19 06:12:39,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:12:39,798 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:12:39,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:12:40,006 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:12:40,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462392660] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:12:40,007 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:12:40,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2022-01-19 06:12:40,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213127451] [2022-01-19 06:12:40,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:12:40,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 06:12:40,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:12:40,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 06:12:40,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-01-19 06:12:40,013 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 197 [2022-01-19 06:12:40,017 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 169 transitions, 393 flow. Second operand has 19 states, 19 states have (on average 154.05263157894737) internal successors, (2927), 19 states have internal predecessors, (2927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:40,017 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:12:40,017 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 197 [2022-01-19 06:12:40,017 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:12:40,242 INFO L129 PetriNetUnfolder]: 2/143 cut-off events. [2022-01-19 06:12:40,243 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-01-19 06:12:40,243 INFO L84 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 143 events. 2/143 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 5/145 useless extension candidates. Maximal degree in co-relation 248. Up to 11 conditions per place. [2022-01-19 06:12:40,243 INFO L132 encePairwiseOnDemand]: 186/197 looper letters, 23 selfloop transitions, 25 changer transitions 32/141 dead transitions. [2022-01-19 06:12:40,244 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 141 transitions, 491 flow [2022-01-19 06:12:40,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-19 06:12:40,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-01-19 06:12:40,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 3828 transitions. [2022-01-19 06:12:40,251 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7772588832487309 [2022-01-19 06:12:40,251 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 3828 transitions. [2022-01-19 06:12:40,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 3828 transitions. [2022-01-19 06:12:40,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:12:40,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 3828 transitions. [2022-01-19 06:12:40,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 153.12) internal successors, (3828), 25 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:40,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 197.0) internal successors, (5122), 26 states have internal predecessors, (5122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:40,301 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 197.0) internal successors, (5122), 26 states have internal predecessors, (5122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:40,302 INFO L186 Difference]: Start difference. First operand has 177 places, 169 transitions, 393 flow. Second operand 25 states and 3828 transitions. [2022-01-19 06:12:40,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 141 transitions, 491 flow [2022-01-19 06:12:40,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 141 transitions, 475 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-01-19 06:12:40,306 INFO L242 Difference]: Finished difference. Result has 151 places, 96 transitions, 350 flow [2022-01-19 06:12:40,306 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=350, PETRI_PLACES=151, PETRI_TRANSITIONS=96} [2022-01-19 06:12:40,306 INFO L334 CegarLoopForPetriNet]: 165 programPoint places, -14 predicate places. [2022-01-19 06:12:40,307 INFO L470 AbstractCegarLoop]: Abstraction has has 151 places, 96 transitions, 350 flow [2022-01-19 06:12:40,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 154.05263157894737) internal successors, (2927), 19 states have internal predecessors, (2927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:40,308 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:12:40,308 INFO L254 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:12:40,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-19 06:12:40,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:12:40,532 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:12:40,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:12:40,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1862165553, now seen corresponding path program 1 times [2022-01-19 06:12:40,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:12:40,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358685520] [2022-01-19 06:12:40,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:12:40,532 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:12:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:12:40,727 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:12:40,728 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:12:40,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358685520] [2022-01-19 06:12:40,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358685520] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:12:40,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138929622] [2022-01-19 06:12:40,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:12:40,728 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:12:40,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:12:40,730 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:12:40,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-19 06:12:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:12:40,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-19 06:12:40,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:12:41,010 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:12:41,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:12:41,219 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:12:41,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138929622] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:12:41,219 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:12:41,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-01-19 06:12:41,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541780024] [2022-01-19 06:12:41,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:12:41,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-19 06:12:41,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:12:41,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-19 06:12:41,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-01-19 06:12:41,225 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 197 [2022-01-19 06:12:41,228 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 96 transitions, 350 flow. Second operand has 23 states, 23 states have (on average 160.43478260869566) internal successors, (3690), 23 states have internal predecessors, (3690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:41,228 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:12:41,228 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 197 [2022-01-19 06:12:41,228 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:12:41,507 INFO L129 PetriNetUnfolder]: 1/126 cut-off events. [2022-01-19 06:12:41,507 INFO L130 PetriNetUnfolder]: For 110/110 co-relation queries the response was YES. [2022-01-19 06:12:41,508 INFO L84 FinitePrefix]: Finished finitePrefix Result has 321 conditions, 126 events. 1/126 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 20 event pairs, 0 based on Foata normal form. 3/129 useless extension candidates. Maximal degree in co-relation 308. Up to 17 conditions per place. [2022-01-19 06:12:41,508 INFO L132 encePairwiseOnDemand]: 191/197 looper letters, 25 selfloop transitions, 30 changer transitions 0/122 dead transitions. [2022-01-19 06:12:41,508 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 122 transitions, 606 flow [2022-01-19 06:12:41,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-19 06:12:41,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-01-19 06:12:41,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 4798 transitions. [2022-01-19 06:12:41,518 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.811844331641286 [2022-01-19 06:12:41,518 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 4798 transitions. [2022-01-19 06:12:41,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 4798 transitions. [2022-01-19 06:12:41,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:12:41,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 4798 transitions. [2022-01-19 06:12:41,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 159.93333333333334) internal successors, (4798), 30 states have internal predecessors, (4798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:41,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 197.0) internal successors, (6107), 31 states have internal predecessors, (6107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:41,542 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 197.0) internal successors, (6107), 31 states have internal predecessors, (6107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:41,542 INFO L186 Difference]: Start difference. First operand has 151 places, 96 transitions, 350 flow. Second operand 30 states and 4798 transitions. [2022-01-19 06:12:41,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 122 transitions, 606 flow [2022-01-19 06:12:41,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 122 transitions, 570 flow, removed 9 selfloop flow, removed 9 redundant places. [2022-01-19 06:12:41,548 INFO L242 Difference]: Finished difference. Result has 144 places, 106 transitions, 472 flow [2022-01-19 06:12:41,548 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=472, PETRI_PLACES=144, PETRI_TRANSITIONS=106} [2022-01-19 06:12:41,548 INFO L334 CegarLoopForPetriNet]: 165 programPoint places, -21 predicate places. [2022-01-19 06:12:41,549 INFO L470 AbstractCegarLoop]: Abstraction has has 144 places, 106 transitions, 472 flow [2022-01-19 06:12:41,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 160.43478260869566) internal successors, (3690), 23 states have internal predecessors, (3690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:41,550 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:12:41,551 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:12:41,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-19 06:12:41,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:12:41,774 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:12:41,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:12:41,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1793341567, now seen corresponding path program 2 times [2022-01-19 06:12:41,775 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:12:41,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599353187] [2022-01-19 06:12:41,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:12:41,775 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:12:41,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:12:42,066 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:12:42,067 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:12:42,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599353187] [2022-01-19 06:12:42,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599353187] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:12:42,067 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:12:42,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-19 06:12:42,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875968415] [2022-01-19 06:12:42,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:12:42,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-19 06:12:42,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:12:42,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-19 06:12:42,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-01-19 06:12:42,069 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 197 [2022-01-19 06:12:42,070 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 106 transitions, 472 flow. Second operand has 13 states, 13 states have (on average 113.23076923076923) internal successors, (1472), 13 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:42,070 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:12:42,071 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 197 [2022-01-19 06:12:42,071 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:12:42,186 INFO L129 PetriNetUnfolder]: 9/153 cut-off events. [2022-01-19 06:12:42,186 INFO L130 PetriNetUnfolder]: For 118/118 co-relation queries the response was YES. [2022-01-19 06:12:42,187 INFO L84 FinitePrefix]: Finished finitePrefix Result has 376 conditions, 153 events. 9/153 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 171 event pairs, 4 based on Foata normal form. 2/153 useless extension candidates. Maximal degree in co-relation 359. Up to 16 conditions per place. [2022-01-19 06:12:42,187 INFO L132 encePairwiseOnDemand]: 188/197 looper letters, 0 selfloop transitions, 0 changer transitions 107/107 dead transitions. [2022-01-19 06:12:42,187 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 107 transitions, 536 flow [2022-01-19 06:12:42,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 06:12:42,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 06:12:42,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1142 transitions. [2022-01-19 06:12:42,190 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5796954314720812 [2022-01-19 06:12:42,190 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1142 transitions. [2022-01-19 06:12:42,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1142 transitions. [2022-01-19 06:12:42,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:12:42,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1142 transitions. [2022-01-19 06:12:42,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 114.2) internal successors, (1142), 10 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:42,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 197.0) internal successors, (2167), 11 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:42,196 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 197.0) internal successors, (2167), 11 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:42,196 INFO L186 Difference]: Start difference. First operand has 144 places, 106 transitions, 472 flow. Second operand 10 states and 1142 transitions. [2022-01-19 06:12:42,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 107 transitions, 536 flow [2022-01-19 06:12:42,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 107 transitions, 492 flow, removed 4 selfloop flow, removed 18 redundant places. [2022-01-19 06:12:42,199 INFO L242 Difference]: Finished difference. Result has 133 places, 0 transitions, 0 flow [2022-01-19 06:12:42,200 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=0, PETRI_PLACES=133, PETRI_TRANSITIONS=0} [2022-01-19 06:12:42,200 INFO L334 CegarLoopForPetriNet]: 165 programPoint places, -32 predicate places. [2022-01-19 06:12:42,200 INFO L470 AbstractCegarLoop]: Abstraction has has 133 places, 0 transitions, 0 flow [2022-01-19 06:12:42,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 113.23076923076923) internal successors, (1472), 13 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:42,203 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-01-19 06:12:42,203 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2022-01-19 06:12:42,204 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2022-01-19 06:12:42,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 06:12:42,207 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2022-01-19 06:12:42,208 INFO L309 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2022-01-19 06:12:42,211 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2022-01-19 06:12:42,211 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=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, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 06:12:42,211 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-19 06:12:42,213 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 169 places, 197 transitions, 402 flow [2022-01-19 06:12:42,230 INFO L129 PetriNetUnfolder]: 45/269 cut-off events. [2022-01-19 06:12:42,230 INFO L130 PetriNetUnfolder]: For 1/2 co-relation queries the response was YES. [2022-01-19 06:12:42,231 INFO L84 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 269 events. 45/269 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 860 event pairs, 0 based on Foata normal form. 0/218 useless extension candidates. Maximal degree in co-relation 147. Up to 8 conditions per place. [2022-01-19 06:12:42,231 INFO L82 GeneralOperation]: Start removeDead. Operand has 169 places, 197 transitions, 402 flow [2022-01-19 06:12:42,233 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 165 places, 192 transitions, 389 flow [2022-01-19 06:12:42,240 INFO L129 PetriNetUnfolder]: 12/130 cut-off events. [2022-01-19 06:12:42,240 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 06:12:42,240 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:12:42,240 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:12:42,240 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-19 06:12:42,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:12:42,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1893756395, now seen corresponding path program 1 times [2022-01-19 06:12:42,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:12:42,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38543074] [2022-01-19 06:12:42,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:12:42,241 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:12:42,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:12:42,255 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 06:12:42,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:12:42,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38543074] [2022-01-19 06:12:42,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38543074] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:12:42,255 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:12:42,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 06:12:42,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765519992] [2022-01-19 06:12:42,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:12:42,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 06:12:42,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:12:42,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 06:12:42,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 06:12:42,257 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 197 [2022-01-19 06:12:42,257 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 192 transitions, 389 flow. Second operand has 2 states, 2 states have (on average 167.0) internal successors, (334), 2 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:42,257 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:12:42,257 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 197 [2022-01-19 06:12:42,257 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:12:42,276 INFO L129 PetriNetUnfolder]: 4/221 cut-off events. [2022-01-19 06:12:42,277 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 06:12:42,277 INFO L84 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 221 events. 4/221 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 641 event pairs, 0 based on Foata normal form. 40/248 useless extension candidates. Maximal degree in co-relation 122. Up to 4 conditions per place. [2022-01-19 06:12:42,278 INFO L132 encePairwiseOnDemand]: 170/197 looper letters, 1 selfloop transitions, 0 changer transitions 1/163 dead transitions. [2022-01-19 06:12:42,278 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 163 transitions, 333 flow [2022-01-19 06:12:42,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 06:12:42,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 06:12:42,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 360 transitions. [2022-01-19 06:12:42,279 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9137055837563451 [2022-01-19 06:12:42,280 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 360 transitions. [2022-01-19 06:12:42,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 360 transitions. [2022-01-19 06:12:42,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:12:42,280 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 360 transitions. [2022-01-19 06:12:42,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 180.0) internal successors, (360), 2 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:42,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:42,282 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:42,282 INFO L186 Difference]: Start difference. First operand has 165 places, 192 transitions, 389 flow. Second operand 2 states and 360 transitions. [2022-01-19 06:12:42,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 163 transitions, 333 flow [2022-01-19 06:12:42,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 163 transitions, 333 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 06:12:42,285 INFO L242 Difference]: Finished difference. Result has 164 places, 162 transitions, 329 flow [2022-01-19 06:12:42,286 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=329, PETRI_PLACES=164, PETRI_TRANSITIONS=162} [2022-01-19 06:12:42,286 INFO L334 CegarLoopForPetriNet]: 165 programPoint places, -1 predicate places. [2022-01-19 06:12:42,286 INFO L470 AbstractCegarLoop]: Abstraction has has 164 places, 162 transitions, 329 flow [2022-01-19 06:12:42,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 167.0) internal successors, (334), 2 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:42,287 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:12:42,287 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:12:42,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 06:12:42,288 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-19 06:12:42,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:12:42,288 INFO L85 PathProgramCache]: Analyzing trace with hash -932142378, now seen corresponding path program 1 times [2022-01-19 06:12:42,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:12:42,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039337230] [2022-01-19 06:12:42,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:12:42,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:12:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:12:42,306 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 06:12:42,307 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:12:42,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039337230] [2022-01-19 06:12:42,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039337230] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:12:42,307 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:12:42,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 06:12:42,307 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425975475] [2022-01-19 06:12:42,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:12:42,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 06:12:42,308 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:12:42,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 06:12:42,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 06:12:42,309 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 197 [2022-01-19 06:12:42,309 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 162 transitions, 329 flow. Second operand has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:42,309 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:12:42,309 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 197 [2022-01-19 06:12:42,309 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:12:42,338 INFO L129 PetriNetUnfolder]: 4/224 cut-off events. [2022-01-19 06:12:42,339 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 06:12:42,339 INFO L84 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 224 events. 4/224 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 638 event pairs, 0 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 239. Up to 9 conditions per place. [2022-01-19 06:12:42,340 INFO L132 encePairwiseOnDemand]: 194/197 looper letters, 10 selfloop transitions, 2 changer transitions 0/166 dead transitions. [2022-01-19 06:12:42,340 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 166 transitions, 361 flow [2022-01-19 06:12:42,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 06:12:42,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 06:12:42,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 490 transitions. [2022-01-19 06:12:42,342 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8291032148900169 [2022-01-19 06:12:42,342 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 490 transitions. [2022-01-19 06:12:42,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 490 transitions. [2022-01-19 06:12:42,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:12:42,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 490 transitions. [2022-01-19 06:12:42,343 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:42,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:42,344 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:42,344 INFO L186 Difference]: Start difference. First operand has 164 places, 162 transitions, 329 flow. Second operand 3 states and 490 transitions. [2022-01-19 06:12:42,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 166 transitions, 361 flow [2022-01-19 06:12:42,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 166 transitions, 361 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 06:12:42,347 INFO L242 Difference]: Finished difference. Result has 166 places, 163 transitions, 341 flow [2022-01-19 06:12:42,348 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=341, PETRI_PLACES=166, PETRI_TRANSITIONS=163} [2022-01-19 06:12:42,348 INFO L334 CegarLoopForPetriNet]: 165 programPoint places, 1 predicate places. [2022-01-19 06:12:42,348 INFO L470 AbstractCegarLoop]: Abstraction has has 166 places, 163 transitions, 341 flow [2022-01-19 06:12:42,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:42,349 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:12:42,349 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:12:42,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 06:12:42,349 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-19 06:12:42,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:12:42,350 INFO L85 PathProgramCache]: Analyzing trace with hash -408777690, now seen corresponding path program 1 times [2022-01-19 06:12:42,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:12:42,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121918082] [2022-01-19 06:12:42,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:12:42,350 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:12:42,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:12:42,379 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 06:12:42,379 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:12:42,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121918082] [2022-01-19 06:12:42,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121918082] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:12:42,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707555216] [2022-01-19 06:12:42,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:12:42,380 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:12:42,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:12:42,381 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:12:42,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-19 06:12:42,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:12:42,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-19 06:12:42,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:12:42,541 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 06:12:42,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:12:42,623 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 06:12:42,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707555216] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:12:42,623 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:12:42,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-19 06:12:42,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464256506] [2022-01-19 06:12:42,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:12:42,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 06:12:42,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:12:42,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 06:12:42,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-01-19 06:12:42,625 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 197 [2022-01-19 06:12:42,626 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 163 transitions, 341 flow. Second operand has 10 states, 10 states have (on average 160.1) internal successors, (1601), 10 states have internal predecessors, (1601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:42,626 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:12:42,626 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 197 [2022-01-19 06:12:42,627 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:12:42,714 INFO L129 PetriNetUnfolder]: 4/231 cut-off events. [2022-01-19 06:12:42,715 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 06:12:42,715 INFO L84 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 231 events. 4/231 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 633 event pairs, 0 based on Foata normal form. 2/222 useless extension candidates. Maximal degree in co-relation 260. Up to 6 conditions per place. [2022-01-19 06:12:42,716 INFO L132 encePairwiseOnDemand]: 191/197 looper letters, 11 selfloop transitions, 9 changer transitions 0/173 dead transitions. [2022-01-19 06:12:42,716 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 173 transitions, 403 flow [2022-01-19 06:12:42,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 06:12:42,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 06:12:42,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1444 transitions. [2022-01-19 06:12:42,720 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.81443880428652 [2022-01-19 06:12:42,720 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1444 transitions. [2022-01-19 06:12:42,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1444 transitions. [2022-01-19 06:12:42,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:12:42,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1444 transitions. [2022-01-19 06:12:42,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 160.44444444444446) internal successors, (1444), 9 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:42,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 197.0) internal successors, (1970), 10 states have internal predecessors, (1970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:42,726 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 197.0) internal successors, (1970), 10 states have internal predecessors, (1970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:42,726 INFO L186 Difference]: Start difference. First operand has 166 places, 163 transitions, 341 flow. Second operand 9 states and 1444 transitions. [2022-01-19 06:12:42,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 173 transitions, 403 flow [2022-01-19 06:12:42,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 173 transitions, 401 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 06:12:42,729 INFO L242 Difference]: Finished difference. Result has 176 places, 169 transitions, 389 flow [2022-01-19 06:12:42,730 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=389, PETRI_PLACES=176, PETRI_TRANSITIONS=169} [2022-01-19 06:12:42,730 INFO L334 CegarLoopForPetriNet]: 165 programPoint places, 11 predicate places. [2022-01-19 06:12:42,731 INFO L470 AbstractCegarLoop]: Abstraction has has 176 places, 169 transitions, 389 flow [2022-01-19 06:12:42,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 160.1) internal successors, (1601), 10 states have internal predecessors, (1601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:42,731 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:12:42,731 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:12:42,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-19 06:12:42,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-19 06:12:42,951 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-19 06:12:42,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:12:42,952 INFO L85 PathProgramCache]: Analyzing trace with hash 81295910, now seen corresponding path program 2 times [2022-01-19 06:12:42,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:12:42,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969746822] [2022-01-19 06:12:42,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:12:42,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:12:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:12:43,010 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 06:12:43,010 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:12:43,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969746822] [2022-01-19 06:12:43,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969746822] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:12:43,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138727670] [2022-01-19 06:12:43,010 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 06:12:43,010 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:12:43,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:12:43,012 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:12:43,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-19 06:12:43,086 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 06:12:43,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:12:43,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-19 06:12:43,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:12:43,190 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 06:12:43,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:12:43,319 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 06:12:43,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138727670] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:12:43,320 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:12:43,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-01-19 06:12:43,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244520219] [2022-01-19 06:12:43,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:12:43,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-19 06:12:43,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:12:43,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-19 06:12:43,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-01-19 06:12:43,322 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 197 [2022-01-19 06:12:43,324 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 169 transitions, 389 flow. Second operand has 18 states, 18 states have (on average 160.27777777777777) internal successors, (2885), 18 states have internal predecessors, (2885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:43,324 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:12:43,324 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 197 [2022-01-19 06:12:43,324 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:12:43,480 INFO L129 PetriNetUnfolder]: 4/251 cut-off events. [2022-01-19 06:12:43,481 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-01-19 06:12:43,481 INFO L84 FinitePrefix]: Finished finitePrefix Result has 355 conditions, 251 events. 4/251 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 633 event pairs, 0 based on Foata normal form. 4/244 useless extension candidates. Maximal degree in co-relation 347. Up to 11 conditions per place. [2022-01-19 06:12:43,482 INFO L132 encePairwiseOnDemand]: 191/197 looper letters, 19 selfloop transitions, 21 changer transitions 0/193 dead transitions. [2022-01-19 06:12:43,482 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 193 transitions, 577 flow [2022-01-19 06:12:43,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-19 06:12:43,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-01-19 06:12:43,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3362 transitions. [2022-01-19 06:12:43,487 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8126661832245589 [2022-01-19 06:12:43,487 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3362 transitions. [2022-01-19 06:12:43,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3362 transitions. [2022-01-19 06:12:43,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:12:43,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3362 transitions. [2022-01-19 06:12:43,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 160.0952380952381) internal successors, (3362), 21 states have internal predecessors, (3362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:43,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 197.0) internal successors, (4334), 22 states have internal predecessors, (4334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:43,499 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 197.0) internal successors, (4334), 22 states have internal predecessors, (4334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:43,499 INFO L186 Difference]: Start difference. First operand has 176 places, 169 transitions, 389 flow. Second operand 21 states and 3362 transitions. [2022-01-19 06:12:43,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 193 transitions, 577 flow [2022-01-19 06:12:43,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 193 transitions, 563 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-01-19 06:12:43,502 INFO L242 Difference]: Finished difference. Result has 200 places, 182 transitions, 513 flow [2022-01-19 06:12:43,503 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=513, PETRI_PLACES=200, PETRI_TRANSITIONS=182} [2022-01-19 06:12:43,503 INFO L334 CegarLoopForPetriNet]: 165 programPoint places, 35 predicate places. [2022-01-19 06:12:43,503 INFO L470 AbstractCegarLoop]: Abstraction has has 200 places, 182 transitions, 513 flow [2022-01-19 06:12:43,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 160.27777777777777) internal successors, (2885), 18 states have internal predecessors, (2885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:43,504 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:12:43,504 INFO L254 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:12:43,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-19 06:12:43,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:12:43,727 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-19 06:12:43,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:12:43,728 INFO L85 PathProgramCache]: Analyzing trace with hash 653252134, now seen corresponding path program 3 times [2022-01-19 06:12:43,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:12:43,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766528586] [2022-01-19 06:12:43,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:12:43,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:12:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:12:43,881 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 06:12:43,881 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:12:43,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766528586] [2022-01-19 06:12:43,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766528586] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:12:43,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254019115] [2022-01-19 06:12:43,881 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 06:12:43,881 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:12:43,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:12:43,884 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) [2022-01-19 06:12:43,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-19 06:12:43,987 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-01-19 06:12:43,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:12:43,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-19 06:12:43,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:12:44,158 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 06:12:44,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:12:44,348 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 06:12:44,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254019115] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:12:44,348 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:12:44,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-01-19 06:12:44,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433833071] [2022-01-19 06:12:44,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:12:44,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-19 06:12:44,349 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:12:44,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-19 06:12:44,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-01-19 06:12:44,351 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 197 [2022-01-19 06:12:44,353 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 182 transitions, 513 flow. Second operand has 23 states, 23 states have (on average 160.43478260869566) internal successors, (3690), 23 states have internal predecessors, (3690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:44,354 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:12:44,354 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 197 [2022-01-19 06:12:44,354 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:12:44,624 INFO L129 PetriNetUnfolder]: 4/266 cut-off events. [2022-01-19 06:12:44,624 INFO L130 PetriNetUnfolder]: For 110/110 co-relation queries the response was YES. [2022-01-19 06:12:44,625 INFO L84 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 266 events. 4/266 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 633 event pairs, 0 based on Foata normal form. 3/258 useless extension candidates. Maximal degree in co-relation 443. Up to 17 conditions per place. [2022-01-19 06:12:44,626 INFO L132 encePairwiseOnDemand]: 191/197 looper letters, 25 selfloop transitions, 30 changer transitions 0/208 dead transitions. [2022-01-19 06:12:44,626 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 208 transitions, 769 flow [2022-01-19 06:12:44,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-19 06:12:44,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-01-19 06:12:44,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 4798 transitions. [2022-01-19 06:12:44,631 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.811844331641286 [2022-01-19 06:12:44,631 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 4798 transitions. [2022-01-19 06:12:44,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 4798 transitions. [2022-01-19 06:12:44,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:12:44,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 4798 transitions. [2022-01-19 06:12:44,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 159.93333333333334) internal successors, (4798), 30 states have internal predecessors, (4798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:44,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 197.0) internal successors, (6107), 31 states have internal predecessors, (6107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:44,645 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 197.0) internal successors, (6107), 31 states have internal predecessors, (6107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:44,645 INFO L186 Difference]: Start difference. First operand has 200 places, 182 transitions, 513 flow. Second operand 30 states and 4798 transitions. [2022-01-19 06:12:44,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 208 transitions, 769 flow [2022-01-19 06:12:44,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 208 transitions, 739 flow, removed 9 selfloop flow, removed 6 redundant places. [2022-01-19 06:12:44,650 INFO L242 Difference]: Finished difference. Result has 227 places, 192 transitions, 641 flow [2022-01-19 06:12:44,650 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=641, PETRI_PLACES=227, PETRI_TRANSITIONS=192} [2022-01-19 06:12:44,651 INFO L334 CegarLoopForPetriNet]: 165 programPoint places, 62 predicate places. [2022-01-19 06:12:44,651 INFO L470 AbstractCegarLoop]: Abstraction has has 227 places, 192 transitions, 641 flow [2022-01-19 06:12:44,652 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 160.43478260869566) internal successors, (3690), 23 states have internal predecessors, (3690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:44,652 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:12:44,652 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:12:44,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-19 06:12:44,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:12:44,876 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-19 06:12:44,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:12:44,876 INFO L85 PathProgramCache]: Analyzing trace with hash -2059256618, now seen corresponding path program 4 times [2022-01-19 06:12:44,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:12:44,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182772753] [2022-01-19 06:12:44,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:12:44,876 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:12:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 06:12:44,896 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-19 06:12:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 06:12:44,945 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-19 06:12:44,945 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-19 06:12:44,946 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 1 remaining) [2022-01-19 06:12:44,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 06:12:44,947 INFO L732 BasicCegarLoop]: Path program histogram: [4, 1, 1] [2022-01-19 06:12:44,947 INFO L309 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2022-01-19 06:12:44,947 WARN L235 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-01-19 06:12:44,947 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-01-19 06:12:44,971 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,971 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,971 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,971 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,971 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,971 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,971 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,971 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,972 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,972 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,972 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,972 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,972 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,972 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,972 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,972 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,972 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,972 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,973 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,973 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,973 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,973 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,973 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,973 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,973 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,973 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,973 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,973 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,973 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,973 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,973 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,973 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,974 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,974 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,974 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,974 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,974 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,974 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,974 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,974 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,974 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,974 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,974 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,974 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,974 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,975 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,975 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,975 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,975 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,976 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,976 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,976 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,976 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,976 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,976 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,976 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,976 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,976 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,976 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,976 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,976 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,976 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,977 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,977 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,977 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,977 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,977 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,977 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,977 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,977 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,977 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,977 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,977 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,977 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,978 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,978 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,978 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,978 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,978 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,978 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,978 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,978 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,978 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,978 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,978 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,979 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,979 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,979 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,979 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,979 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,979 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,979 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,979 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,979 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,979 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,979 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,979 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,980 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,980 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,980 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,980 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,980 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,980 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,980 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,980 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,980 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,980 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,980 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,980 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,980 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,981 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,981 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,981 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,981 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,981 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,981 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,982 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,982 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,982 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,982 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,982 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,982 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,982 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,982 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,986 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,987 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,987 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,992 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,992 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,992 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,992 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,992 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,992 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,992 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,993 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,993 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,993 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,993 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,993 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,993 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,993 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,993 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,993 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,993 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,993 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,994 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,994 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,994 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,994 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,994 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,994 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,994 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,994 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,994 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,994 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,994 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,994 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,994 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,994 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,995 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,995 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,995 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,995 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,995 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,995 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,995 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,995 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,995 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,995 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,995 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,996 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,996 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,996 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,996 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,996 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,996 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,996 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,996 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,996 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,996 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,996 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,996 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,997 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,997 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,997 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,997 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,997 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,997 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,997 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,997 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,997 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,997 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,997 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,997 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,998 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,998 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,998 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,998 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,998 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,998 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,998 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,998 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,998 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,998 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,999 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,999 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,999 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,999 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,999 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,999 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,999 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,999 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,999 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,999 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,999 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,999 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:44,999 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,000 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,000 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,000 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,000 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,000 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,000 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,000 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,000 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,000 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,000 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,000 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,000 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,000 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,001 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,001 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,001 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,001 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,001 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,001 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,001 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,001 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,001 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,001 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,001 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,001 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,001 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,001 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,002 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,002 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,002 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,002 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,002 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,002 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,002 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,002 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,003 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,003 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,003 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,003 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,003 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,004 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,004 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,004 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,004 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,004 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,004 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,004 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,004 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,004 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,004 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,004 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,004 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,005 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,005 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,005 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,005 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,005 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,005 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,005 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,005 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,005 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,006 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,006 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,006 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,006 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,006 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,006 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,006 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,006 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,006 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,006 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,006 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,006 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,007 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,007 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,007 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,007 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,007 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,007 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:12:45,008 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-01-19 06:12:45,009 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 06:12:45,010 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=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, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 06:12:45,010 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-19 06:12:45,012 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 229 places, 269 transitions, 556 flow [2022-01-19 06:12:45,050 INFO L129 PetriNetUnfolder]: 75/438 cut-off events. [2022-01-19 06:12:45,050 INFO L130 PetriNetUnfolder]: For 6/8 co-relation queries the response was YES. [2022-01-19 06:12:45,053 INFO L84 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 438 events. 75/438 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1740 event pairs, 0 based on Foata normal form. 0/354 useless extension candidates. Maximal degree in co-relation 271. Up to 12 conditions per place. [2022-01-19 06:12:45,053 INFO L82 GeneralOperation]: Start removeDead. Operand has 229 places, 269 transitions, 556 flow [2022-01-19 06:12:45,057 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 229 places, 269 transitions, 556 flow [2022-01-19 06:12:45,064 INFO L129 PetriNetUnfolder]: 15/139 cut-off events. [2022-01-19 06:12:45,064 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 06:12:45,064 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:12:45,065 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:12:45,065 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:12:45,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:12:45,065 INFO L85 PathProgramCache]: Analyzing trace with hash -280318449, now seen corresponding path program 1 times [2022-01-19 06:12:45,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:12:45,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206564083] [2022-01-19 06:12:45,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:12:45,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:12:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:12:45,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:12:45,082 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:12:45,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206564083] [2022-01-19 06:12:45,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206564083] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:12:45,082 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:12:45,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 06:12:45,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626476299] [2022-01-19 06:12:45,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:12:45,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 06:12:45,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:12:45,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 06:12:45,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 06:12:45,084 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 269 [2022-01-19 06:12:45,085 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 269 transitions, 556 flow. Second operand has 2 states, 2 states have (on average 224.0) internal successors, (448), 2 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:45,085 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:12:45,085 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 269 [2022-01-19 06:12:45,085 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:12:45,129 INFO L129 PetriNetUnfolder]: 9/367 cut-off events. [2022-01-19 06:12:45,129 INFO L130 PetriNetUnfolder]: For 18/22 co-relation queries the response was YES. [2022-01-19 06:12:45,131 INFO L84 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 367 events. 9/367 cut-off events. For 18/22 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1433 event pairs, 0 based on Foata normal form. 91/437 useless extension candidates. Maximal degree in co-relation 230. Up to 7 conditions per place. [2022-01-19 06:12:45,133 INFO L132 encePairwiseOnDemand]: 230/269 looper letters, 4 selfloop transitions, 0 changer transitions 1/227 dead transitions. [2022-01-19 06:12:45,133 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 227 transitions, 480 flow [2022-01-19 06:12:45,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 06:12:45,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 06:12:45,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 489 transitions. [2022-01-19 06:12:45,134 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9089219330855018 [2022-01-19 06:12:45,134 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 489 transitions. [2022-01-19 06:12:45,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 489 transitions. [2022-01-19 06:12:45,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:12:45,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 489 transitions. [2022-01-19 06:12:45,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 244.5) internal successors, (489), 2 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:45,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:45,137 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:45,137 INFO L186 Difference]: Start difference. First operand has 229 places, 269 transitions, 556 flow. Second operand 2 states and 489 transitions. [2022-01-19 06:12:45,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 227 transitions, 480 flow [2022-01-19 06:12:45,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 227 transitions, 480 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 06:12:45,141 INFO L242 Difference]: Finished difference. Result has 227 places, 226 transitions, 470 flow [2022-01-19 06:12:45,141 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=470, PETRI_PLACES=227, PETRI_TRANSITIONS=226} [2022-01-19 06:12:45,142 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, -2 predicate places. [2022-01-19 06:12:45,142 INFO L470 AbstractCegarLoop]: Abstraction has has 227 places, 226 transitions, 470 flow [2022-01-19 06:12:45,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 224.0) internal successors, (448), 2 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:45,142 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:12:45,143 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:12:45,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-19 06:12:45,143 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:12:45,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:12:45,143 INFO L85 PathProgramCache]: Analyzing trace with hash -2106119919, now seen corresponding path program 1 times [2022-01-19 06:12:45,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:12:45,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915502988] [2022-01-19 06:12:45,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:12:45,144 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:12:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:12:45,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:12:45,162 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:12:45,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915502988] [2022-01-19 06:12:45,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915502988] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:12:45,162 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:12:45,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 06:12:45,163 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700474458] [2022-01-19 06:12:45,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:12:45,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 06:12:45,163 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:12:45,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 06:12:45,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 06:12:45,164 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 269 [2022-01-19 06:12:45,165 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 226 transitions, 470 flow. Second operand has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:45,165 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:12:45,165 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 269 [2022-01-19 06:12:45,165 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:12:45,238 INFO L129 PetriNetUnfolder]: 9/370 cut-off events. [2022-01-19 06:12:45,238 INFO L130 PetriNetUnfolder]: For 18/22 co-relation queries the response was YES. [2022-01-19 06:12:45,240 INFO L84 FinitePrefix]: Finished finitePrefix Result has 403 conditions, 370 events. 9/370 cut-off events. For 18/22 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1429 event pairs, 0 based on Foata normal form. 0/350 useless extension candidates. Maximal degree in co-relation 398. Up to 14 conditions per place. [2022-01-19 06:12:45,241 INFO L132 encePairwiseOnDemand]: 266/269 looper letters, 13 selfloop transitions, 2 changer transitions 0/230 dead transitions. [2022-01-19 06:12:45,241 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 230 transitions, 508 flow [2022-01-19 06:12:45,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 06:12:45,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 06:12:45,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 664 transitions. [2022-01-19 06:12:45,243 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8228004956629492 [2022-01-19 06:12:45,243 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 664 transitions. [2022-01-19 06:12:45,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 664 transitions. [2022-01-19 06:12:45,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:12:45,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 664 transitions. [2022-01-19 06:12:45,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:45,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:45,245 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:45,245 INFO L186 Difference]: Start difference. First operand has 227 places, 226 transitions, 470 flow. Second operand 3 states and 664 transitions. [2022-01-19 06:12:45,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 230 transitions, 508 flow [2022-01-19 06:12:45,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 230 transitions, 508 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 06:12:45,249 INFO L242 Difference]: Finished difference. Result has 229 places, 227 transitions, 482 flow [2022-01-19 06:12:45,250 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=482, PETRI_PLACES=229, PETRI_TRANSITIONS=227} [2022-01-19 06:12:45,250 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 0 predicate places. [2022-01-19 06:12:45,250 INFO L470 AbstractCegarLoop]: Abstraction has has 229 places, 227 transitions, 482 flow [2022-01-19 06:12:45,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:45,251 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:12:45,251 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:12:45,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-19 06:12:45,251 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:12:45,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:12:45,251 INFO L85 PathProgramCache]: Analyzing trace with hash 178238190, now seen corresponding path program 1 times [2022-01-19 06:12:45,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:12:45,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901179259] [2022-01-19 06:12:45,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:12:45,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:12:45,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:12:45,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:12:45,278 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:12:45,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901179259] [2022-01-19 06:12:45,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901179259] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:12:45,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967850262] [2022-01-19 06:12:45,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:12:45,278 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:12:45,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:12:45,279 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) [2022-01-19 06:12:45,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-19 06:12:45,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:12:45,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-19 06:12:45,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:12:45,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:12:45,426 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 06:12:45,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967850262] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:12:45,427 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 06:12:45,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-01-19 06:12:45,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88434766] [2022-01-19 06:12:45,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:12:45,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 06:12:45,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:12:45,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 06:12:45,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-19 06:12:45,429 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 269 [2022-01-19 06:12:45,430 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 227 transitions, 482 flow. Second operand has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:45,430 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:12:45,430 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 269 [2022-01-19 06:12:45,430 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:12:45,481 INFO L129 PetriNetUnfolder]: 7/325 cut-off events. [2022-01-19 06:12:45,481 INFO L130 PetriNetUnfolder]: For 15/34 co-relation queries the response was YES. [2022-01-19 06:12:45,484 INFO L84 FinitePrefix]: Finished finitePrefix Result has 368 conditions, 325 events. 7/325 cut-off events. For 15/34 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1107 event pairs, 0 based on Foata normal form. 1/310 useless extension candidates. Maximal degree in co-relation 361. Up to 16 conditions per place. [2022-01-19 06:12:45,485 INFO L132 encePairwiseOnDemand]: 266/269 looper letters, 13 selfloop transitions, 2 changer transitions 0/231 dead transitions. [2022-01-19 06:12:45,485 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 231 transitions, 520 flow [2022-01-19 06:12:45,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 06:12:45,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 06:12:45,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 664 transitions. [2022-01-19 06:12:45,487 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8228004956629492 [2022-01-19 06:12:45,487 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 664 transitions. [2022-01-19 06:12:45,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 664 transitions. [2022-01-19 06:12:45,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:12:45,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 664 transitions. [2022-01-19 06:12:45,488 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:45,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:45,489 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:45,489 INFO L186 Difference]: Start difference. First operand has 229 places, 227 transitions, 482 flow. Second operand 3 states and 664 transitions. [2022-01-19 06:12:45,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 231 transitions, 520 flow [2022-01-19 06:12:45,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 231 transitions, 518 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 06:12:45,493 INFO L242 Difference]: Finished difference. Result has 231 places, 228 transitions, 492 flow [2022-01-19 06:12:45,494 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=492, PETRI_PLACES=231, PETRI_TRANSITIONS=228} [2022-01-19 06:12:45,494 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 2 predicate places. [2022-01-19 06:12:45,494 INFO L470 AbstractCegarLoop]: Abstraction has has 231 places, 228 transitions, 492 flow [2022-01-19 06:12:45,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:45,494 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:12:45,495 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:12:45,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-19 06:12:45,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-01-19 06:12:45,710 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:12:45,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:12:45,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1349753429, now seen corresponding path program 1 times [2022-01-19 06:12:45,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:12:45,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234790866] [2022-01-19 06:12:45,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:12:45,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:12:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:12:45,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:12:45,740 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:12:45,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234790866] [2022-01-19 06:12:45,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234790866] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:12:45,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164742471] [2022-01-19 06:12:45,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:12:45,741 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:12:45,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:12:45,742 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) [2022-01-19 06:12:45,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-19 06:12:45,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:12:45,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-19 06:12:45,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:12:45,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:12:45,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:12:46,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:12:46,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164742471] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:12:46,019 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:12:46,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-19 06:12:46,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211251374] [2022-01-19 06:12:46,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:12:46,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 06:12:46,020 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:12:46,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 06:12:46,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-01-19 06:12:46,022 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 269 [2022-01-19 06:12:46,024 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 228 transitions, 492 flow. Second operand has 10 states, 10 states have (on average 217.1) internal successors, (2171), 10 states have internal predecessors, (2171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:46,024 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:12:46,024 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 269 [2022-01-19 06:12:46,024 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:12:46,115 INFO L129 PetriNetUnfolder]: 7/332 cut-off events. [2022-01-19 06:12:46,115 INFO L130 PetriNetUnfolder]: For 19/23 co-relation queries the response was YES. [2022-01-19 06:12:46,118 INFO L84 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 332 events. 7/332 cut-off events. For 19/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1102 event pairs, 0 based on Foata normal form. 2/320 useless extension candidates. Maximal degree in co-relation 379. Up to 11 conditions per place. [2022-01-19 06:12:46,119 INFO L132 encePairwiseOnDemand]: 263/269 looper letters, 14 selfloop transitions, 9 changer transitions 0/238 dead transitions. [2022-01-19 06:12:46,119 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 238 transitions, 560 flow [2022-01-19 06:12:46,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 06:12:46,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 06:12:46,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1960 transitions. [2022-01-19 06:12:46,121 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8095828170177612 [2022-01-19 06:12:46,121 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1960 transitions. [2022-01-19 06:12:46,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1960 transitions. [2022-01-19 06:12:46,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:12:46,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1960 transitions. [2022-01-19 06:12:46,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 217.77777777777777) internal successors, (1960), 9 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:46,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 269.0) internal successors, (2690), 10 states have internal predecessors, (2690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:46,127 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 269.0) internal successors, (2690), 10 states have internal predecessors, (2690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:46,127 INFO L186 Difference]: Start difference. First operand has 231 places, 228 transitions, 492 flow. Second operand 9 states and 1960 transitions. [2022-01-19 06:12:46,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 238 transitions, 560 flow [2022-01-19 06:12:46,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 238 transitions, 558 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 06:12:46,131 INFO L242 Difference]: Finished difference. Result has 241 places, 234 transitions, 540 flow [2022-01-19 06:12:46,132 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=540, PETRI_PLACES=241, PETRI_TRANSITIONS=234} [2022-01-19 06:12:46,132 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 12 predicate places. [2022-01-19 06:12:46,132 INFO L470 AbstractCegarLoop]: Abstraction has has 241 places, 234 transitions, 540 flow [2022-01-19 06:12:46,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 217.1) internal successors, (2171), 10 states have internal predecessors, (2171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:46,133 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:12:46,133 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:12:46,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-19 06:12:46,350 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-01-19 06:12:46,351 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:12:46,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:12:46,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1017331595, now seen corresponding path program 2 times [2022-01-19 06:12:46,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:12:46,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754179041] [2022-01-19 06:12:46,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:12:46,352 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:12:46,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:12:46,383 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-19 06:12:46,383 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:12:46,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754179041] [2022-01-19 06:12:46,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754179041] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:12:46,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799299174] [2022-01-19 06:12:46,383 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 06:12:46,384 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:12:46,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:12:46,385 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) [2022-01-19 06:12:46,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-19 06:12:46,475 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 06:12:46,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:12:46,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-19 06:12:46,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:12:46,634 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:12:46,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:12:46,790 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:12:46,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799299174] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:12:46,790 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:12:46,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2022-01-19 06:12:46,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775908355] [2022-01-19 06:12:46,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:12:46,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 06:12:46,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:12:46,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 06:12:46,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-01-19 06:12:46,793 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 269 [2022-01-19 06:12:46,795 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 234 transitions, 540 flow. Second operand has 19 states, 19 states have (on average 211.05263157894737) internal successors, (4010), 19 states have internal predecessors, (4010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:46,796 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:12:46,796 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 269 [2022-01-19 06:12:46,796 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:12:47,024 INFO L129 PetriNetUnfolder]: 5/307 cut-off events. [2022-01-19 06:12:47,024 INFO L130 PetriNetUnfolder]: For 36/43 co-relation queries the response was YES. [2022-01-19 06:12:47,026 INFO L84 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 307 events. 5/307 cut-off events. For 36/43 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 722 event pairs, 1 based on Foata normal form. 6/301 useless extension candidates. Maximal degree in co-relation 434. Up to 14 conditions per place. [2022-01-19 06:12:47,027 INFO L132 encePairwiseOnDemand]: 258/269 looper letters, 31 selfloop transitions, 26 changer transitions 0/264 dead transitions. [2022-01-19 06:12:47,027 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 264 transitions, 774 flow [2022-01-19 06:12:47,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-19 06:12:47,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-01-19 06:12:47,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 5262 transitions. [2022-01-19 06:12:47,034 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.782453531598513 [2022-01-19 06:12:47,034 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 5262 transitions. [2022-01-19 06:12:47,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 5262 transitions. [2022-01-19 06:12:47,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:12:47,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 5262 transitions. [2022-01-19 06:12:47,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 210.48) internal successors, (5262), 25 states have internal predecessors, (5262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:47,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 269.0) internal successors, (6994), 26 states have internal predecessors, (6994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:47,050 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 269.0) internal successors, (6994), 26 states have internal predecessors, (6994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:47,050 INFO L186 Difference]: Start difference. First operand has 241 places, 234 transitions, 540 flow. Second operand 25 states and 5262 transitions. [2022-01-19 06:12:47,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 264 transitions, 774 flow [2022-01-19 06:12:47,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 264 transitions, 760 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-01-19 06:12:47,056 INFO L242 Difference]: Finished difference. Result has 272 places, 249 transitions, 692 flow [2022-01-19 06:12:47,056 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=692, PETRI_PLACES=272, PETRI_TRANSITIONS=249} [2022-01-19 06:12:47,056 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 43 predicate places. [2022-01-19 06:12:47,056 INFO L470 AbstractCegarLoop]: Abstraction has has 272 places, 249 transitions, 692 flow [2022-01-19 06:12:47,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 211.05263157894737) internal successors, (4010), 19 states have internal predecessors, (4010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:47,057 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:12:47,058 INFO L254 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:12:47,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-19 06:12:47,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-01-19 06:12:47,271 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:12:47,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:12:47,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1468889109, now seen corresponding path program 1 times [2022-01-19 06:12:47,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:12:47,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264971859] [2022-01-19 06:12:47,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:12:47,272 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:12:47,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:12:47,411 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:12:47,411 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:12:47,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264971859] [2022-01-19 06:12:47,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264971859] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:12:47,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262885581] [2022-01-19 06:12:47,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:12:47,412 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:12:47,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:12:47,413 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) [2022-01-19 06:12:47,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-19 06:12:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:12:47,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-19 06:12:47,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:12:47,682 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:12:47,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:12:47,892 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:12:47,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262885581] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:12:47,893 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:12:47,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-01-19 06:12:47,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833504474] [2022-01-19 06:12:47,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:12:47,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-19 06:12:47,893 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:12:47,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-19 06:12:47,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-01-19 06:12:47,896 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 269 [2022-01-19 06:12:47,899 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 249 transitions, 692 flow. Second operand has 23 states, 23 states have (on average 217.43478260869566) internal successors, (5001), 23 states have internal predecessors, (5001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:47,899 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:12:47,899 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 269 [2022-01-19 06:12:47,900 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:12:48,186 INFO L129 PetriNetUnfolder]: 5/322 cut-off events. [2022-01-19 06:12:48,186 INFO L130 PetriNetUnfolder]: For 135/136 co-relation queries the response was YES. [2022-01-19 06:12:48,189 INFO L84 FinitePrefix]: Finished finitePrefix Result has 546 conditions, 322 events. 5/322 cut-off events. For 135/136 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 722 event pairs, 1 based on Foata normal form. 3/313 useless extension candidates. Maximal degree in co-relation 528. Up to 17 conditions per place. [2022-01-19 06:12:48,190 INFO L132 encePairwiseOnDemand]: 263/269 looper letters, 28 selfloop transitions, 30 changer transitions 0/275 dead transitions. [2022-01-19 06:12:48,190 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 275 transitions, 954 flow [2022-01-19 06:12:48,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-19 06:12:48,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-01-19 06:12:48,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 6511 transitions. [2022-01-19 06:12:48,198 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8068153655514251 [2022-01-19 06:12:48,198 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 6511 transitions. [2022-01-19 06:12:48,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 6511 transitions. [2022-01-19 06:12:48,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:12:48,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 6511 transitions. [2022-01-19 06:12:48,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 217.03333333333333) internal successors, (6511), 30 states have internal predecessors, (6511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:48,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 269.0) internal successors, (8339), 31 states have internal predecessors, (8339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:48,217 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 269.0) internal successors, (8339), 31 states have internal predecessors, (8339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:48,217 INFO L186 Difference]: Start difference. First operand has 272 places, 249 transitions, 692 flow. Second operand 30 states and 6511 transitions. [2022-01-19 06:12:48,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 275 transitions, 954 flow [2022-01-19 06:12:48,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 275 transitions, 920 flow, removed 10 selfloop flow, removed 7 redundant places. [2022-01-19 06:12:48,223 INFO L242 Difference]: Finished difference. Result has 298 places, 259 transitions, 816 flow [2022-01-19 06:12:48,223 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=816, PETRI_PLACES=298, PETRI_TRANSITIONS=259} [2022-01-19 06:12:48,223 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 69 predicate places. [2022-01-19 06:12:48,224 INFO L470 AbstractCegarLoop]: Abstraction has has 298 places, 259 transitions, 816 flow [2022-01-19 06:12:48,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 217.43478260869566) internal successors, (5001), 23 states have internal predecessors, (5001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:48,225 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:12:48,225 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:12:48,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-01-19 06:12:48,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:12:48,451 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:12:48,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:12:48,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1471219096, now seen corresponding path program 2 times [2022-01-19 06:12:48,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:12:48,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622240320] [2022-01-19 06:12:48,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:12:48,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:12:48,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:12:48,992 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:12:48,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:12:48,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622240320] [2022-01-19 06:12:48,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622240320] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:12:48,992 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:12:48,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-19 06:12:48,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046714011] [2022-01-19 06:12:48,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:12:48,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-19 06:12:48,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:12:48,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-19 06:12:48,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2022-01-19 06:12:48,995 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 269 [2022-01-19 06:12:48,996 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 259 transitions, 816 flow. Second operand has 16 states, 16 states have (on average 149.125) internal successors, (2386), 16 states have internal predecessors, (2386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:48,996 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:12:48,996 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 269 [2022-01-19 06:12:48,996 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:12:56,183 INFO L129 PetriNetUnfolder]: 17722/46364 cut-off events. [2022-01-19 06:12:56,183 INFO L130 PetriNetUnfolder]: For 3053/3066 co-relation queries the response was YES. [2022-01-19 06:12:56,446 INFO L84 FinitePrefix]: Finished finitePrefix Result has 76644 conditions, 46364 events. 17722/46364 cut-off events. For 3053/3066 co-relation queries the response was YES. Maximal size of possible extension queue 1471. Compared 575570 event pairs, 3759 based on Foata normal form. 13/44831 useless extension candidates. Maximal degree in co-relation 76622. Up to 13724 conditions per place. [2022-01-19 06:12:56,587 INFO L132 encePairwiseOnDemand]: 251/269 looper letters, 412 selfloop transitions, 56 changer transitions 127/772 dead transitions. [2022-01-19 06:12:56,588 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 772 transitions, 3231 flow [2022-01-19 06:12:56,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-19 06:12:56,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-01-19 06:12:56,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 5008 transitions. [2022-01-19 06:12:56,595 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6205700123915737 [2022-01-19 06:12:56,595 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 5008 transitions. [2022-01-19 06:12:56,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 5008 transitions. [2022-01-19 06:12:56,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:12:56,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 5008 transitions. [2022-01-19 06:12:56,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 166.93333333333334) internal successors, (5008), 30 states have internal predecessors, (5008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:56,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 269.0) internal successors, (8339), 31 states have internal predecessors, (8339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:56,615 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 269.0) internal successors, (8339), 31 states have internal predecessors, (8339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:56,615 INFO L186 Difference]: Start difference. First operand has 298 places, 259 transitions, 816 flow. Second operand 30 states and 5008 transitions. [2022-01-19 06:12:56,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 772 transitions, 3231 flow [2022-01-19 06:12:56,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 772 transitions, 3187 flow, removed 4 selfloop flow, removed 18 redundant places. [2022-01-19 06:12:56,642 INFO L242 Difference]: Finished difference. Result has 320 places, 319 transitions, 1145 flow [2022-01-19 06:12:56,643 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1145, PETRI_PLACES=320, PETRI_TRANSITIONS=319} [2022-01-19 06:12:56,643 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 91 predicate places. [2022-01-19 06:12:56,643 INFO L470 AbstractCegarLoop]: Abstraction has has 320 places, 319 transitions, 1145 flow [2022-01-19 06:12:56,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 149.125) internal successors, (2386), 16 states have internal predecessors, (2386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:56,644 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:12:56,646 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:12:56,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-19 06:12:56,646 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:12:56,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:12:56,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1138726636, now seen corresponding path program 1 times [2022-01-19 06:12:56,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:12:56,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006402199] [2022-01-19 06:12:56,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:12:56,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:12:56,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:12:56,711 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:12:56,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:12:56,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006402199] [2022-01-19 06:12:56,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006402199] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:12:56,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798150920] [2022-01-19 06:12:56,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:12:56,712 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:12:56,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:12:56,716 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) [2022-01-19 06:12:56,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-01-19 06:12:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:12:56,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-19 06:12:56,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:12:57,003 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:12:57,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:12:57,186 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:12:57,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798150920] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:12:57,186 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:12:57,186 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-01-19 06:12:57,186 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494980940] [2022-01-19 06:12:57,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:12:57,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-19 06:12:57,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:12:57,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-19 06:12:57,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-01-19 06:12:57,189 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 269 [2022-01-19 06:12:57,191 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 319 transitions, 1145 flow. Second operand has 14 states, 14 states have (on average 217.5) internal successors, (3045), 14 states have internal predecessors, (3045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:57,191 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:12:57,191 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 269 [2022-01-19 06:12:57,191 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:12:57,279 INFO L129 PetriNetUnfolder]: 10/384 cut-off events. [2022-01-19 06:12:57,279 INFO L130 PetriNetUnfolder]: For 207/213 co-relation queries the response was YES. [2022-01-19 06:12:57,280 INFO L84 FinitePrefix]: Finished finitePrefix Result has 656 conditions, 384 events. 10/384 cut-off events. For 207/213 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1177 event pairs, 0 based on Foata normal form. 6/385 useless extension candidates. Maximal degree in co-relation 622. Up to 16 conditions per place. [2022-01-19 06:12:57,281 INFO L132 encePairwiseOnDemand]: 264/269 looper letters, 9 selfloop transitions, 12 changer transitions 17/227 dead transitions. [2022-01-19 06:12:57,281 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 227 transitions, 883 flow [2022-01-19 06:12:57,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 06:12:57,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 06:12:57,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1952 transitions. [2022-01-19 06:12:57,284 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8062783973564642 [2022-01-19 06:12:57,284 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1952 transitions. [2022-01-19 06:12:57,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1952 transitions. [2022-01-19 06:12:57,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:12:57,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1952 transitions. [2022-01-19 06:12:57,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 216.88888888888889) internal successors, (1952), 9 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:57,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 269.0) internal successors, (2690), 10 states have internal predecessors, (2690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:57,289 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 269.0) internal successors, (2690), 10 states have internal predecessors, (2690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:57,289 INFO L186 Difference]: Start difference. First operand has 320 places, 319 transitions, 1145 flow. Second operand 9 states and 1952 transitions. [2022-01-19 06:12:57,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 227 transitions, 883 flow [2022-01-19 06:12:57,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 227 transitions, 840 flow, removed 4 selfloop flow, removed 13 redundant places. [2022-01-19 06:12:57,296 INFO L242 Difference]: Finished difference. Result has 249 places, 206 transitions, 753 flow [2022-01-19 06:12:57,296 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=753, PETRI_PLACES=249, PETRI_TRANSITIONS=206} [2022-01-19 06:12:57,297 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 20 predicate places. [2022-01-19 06:12:57,297 INFO L470 AbstractCegarLoop]: Abstraction has has 249 places, 206 transitions, 753 flow [2022-01-19 06:12:57,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 217.5) internal successors, (3045), 14 states have internal predecessors, (3045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:57,297 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:12:57,298 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:12:57,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-01-19 06:12:57,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-01-19 06:12:57,521 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:12:57,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:12:57,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1699770320, now seen corresponding path program 1 times [2022-01-19 06:12:57,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:12:57,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910468196] [2022-01-19 06:12:57,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:12:57,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:12:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:12:57,758 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-01-19 06:12:57,758 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:12:57,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910468196] [2022-01-19 06:12:57,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910468196] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:12:57,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243810654] [2022-01-19 06:12:57,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:12:57,758 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:12:57,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:12:57,760 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) [2022-01-19 06:12:57,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-01-19 06:12:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:12:57,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-19 06:12:57,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:12:57,942 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-01-19 06:12:58,491 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:12:58,492 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 06:12:58,536 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:12:58,606 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:12:58,694 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 14 [2022-01-19 06:12:58,731 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-01-19 06:12:58,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:12:58,860 WARN L838 $PredicateComparison]: unable to prove that (forall ((|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (v_ArrVal_572 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_572) |c_~#a~0.base|) (+ (* 28 |t_funThread2of2ForFork0_~i~0#1|) |~#a~0.offset|)) 0)) is different from false [2022-01-19 06:12:59,669 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-01-19 06:12:59,698 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:12:59,699 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-19 06:12:59,721 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 1 not checked. [2022-01-19 06:12:59,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243810654] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:12:59,722 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:12:59,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 24 [2022-01-19 06:12:59,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273020226] [2022-01-19 06:12:59,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:12:59,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-19 06:12:59,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:12:59,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-19 06:12:59,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=404, Unknown=1, NotChecked=42, Total=552 [2022-01-19 06:12:59,726 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 269 [2022-01-19 06:12:59,729 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 206 transitions, 753 flow. Second operand has 24 states, 24 states have (on average 158.95833333333334) internal successors, (3815), 24 states have internal predecessors, (3815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:59,729 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:12:59,729 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 269 [2022-01-19 06:12:59,729 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:13:04,662 INFO L129 PetriNetUnfolder]: 811/2803 cut-off events. [2022-01-19 06:13:04,662 INFO L130 PetriNetUnfolder]: For 421/421 co-relation queries the response was YES. [2022-01-19 06:13:04,673 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4908 conditions, 2803 events. 811/2803 cut-off events. For 421/421 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 24246 event pairs, 222 based on Foata normal form. 26/2764 useless extension candidates. Maximal degree in co-relation 4883. Up to 539 conditions per place. [2022-01-19 06:13:04,679 INFO L132 encePairwiseOnDemand]: 257/269 looper letters, 115 selfloop transitions, 24 changer transitions 8/300 dead transitions. [2022-01-19 06:13:04,679 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 300 transitions, 1262 flow [2022-01-19 06:13:04,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 06:13:04,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 06:13:04,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2331 transitions. [2022-01-19 06:13:04,682 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6189591078066915 [2022-01-19 06:13:04,682 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2331 transitions. [2022-01-19 06:13:04,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2331 transitions. [2022-01-19 06:13:04,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:13:04,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2331 transitions. [2022-01-19 06:13:04,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 166.5) internal successors, (2331), 14 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:13:04,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 269.0) internal successors, (4035), 15 states have internal predecessors, (4035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:13:04,689 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 269.0) internal successors, (4035), 15 states have internal predecessors, (4035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:13:04,689 INFO L186 Difference]: Start difference. First operand has 249 places, 206 transitions, 753 flow. Second operand 14 states and 2331 transitions. [2022-01-19 06:13:04,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 300 transitions, 1262 flow [2022-01-19 06:13:04,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 300 transitions, 1210 flow, removed 3 selfloop flow, removed 10 redundant places. [2022-01-19 06:13:04,696 INFO L242 Difference]: Finished difference. Result has 249 places, 223 transitions, 839 flow [2022-01-19 06:13:04,696 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=839, PETRI_PLACES=249, PETRI_TRANSITIONS=223} [2022-01-19 06:13:04,697 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 20 predicate places. [2022-01-19 06:13:04,697 INFO L470 AbstractCegarLoop]: Abstraction has has 249 places, 223 transitions, 839 flow [2022-01-19 06:13:04,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 158.95833333333334) internal successors, (3815), 24 states have internal predecessors, (3815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:13:04,698 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:13:04,698 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:13:04,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-01-19 06:13:04,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-01-19 06:13:04,920 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:13:04,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:13:04,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1258833884, now seen corresponding path program 2 times [2022-01-19 06:13:04,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:13:04,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424893591] [2022-01-19 06:13:04,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:13:04,921 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:13:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:13:05,140 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-01-19 06:13:05,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:13:05,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424893591] [2022-01-19 06:13:05,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424893591] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:13:05,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251414158] [2022-01-19 06:13:05,141 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 06:13:05,141 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:13:05,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:13:05,142 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) [2022-01-19 06:13:05,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-01-19 06:13:05,260 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 06:13:05,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:13:05,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-19 06:13:05,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:13:05,310 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-01-19 06:13:05,739 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:13:05,739 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 06:13:05,788 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:13:05,861 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:13:05,954 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 14 [2022-01-19 06:13:06,001 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-01-19 06:13:06,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:13:06,124 WARN L838 $PredicateComparison]: unable to prove that (forall ((|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (v_ArrVal_641 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_641) |c_~#a~0.base|) (+ (* 28 |t_funThread2of2ForFork0_~i~0#1|) |~#a~0.offset|)) 0)) is different from false [2022-01-19 06:13:06,787 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-01-19 06:13:06,811 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:13:06,812 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-19 06:13:06,830 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 14 not checked. [2022-01-19 06:13:06,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251414158] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:13:06,831 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:13:06,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 23 [2022-01-19 06:13:06,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412284895] [2022-01-19 06:13:06,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:13:06,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-19 06:13:06,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:13:06,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-19 06:13:06,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=375, Unknown=1, NotChecked=40, Total=506 [2022-01-19 06:13:06,835 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 269 [2022-01-19 06:13:06,837 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 223 transitions, 839 flow. Second operand has 23 states, 23 states have (on average 159.08695652173913) internal successors, (3659), 23 states have internal predecessors, (3659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:13:06,837 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:13:06,837 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 269 [2022-01-19 06:13:06,837 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:13:09,613 INFO L129 PetriNetUnfolder]: 881/3138 cut-off events. [2022-01-19 06:13:09,614 INFO L130 PetriNetUnfolder]: For 1240/1254 co-relation queries the response was YES. [2022-01-19 06:13:09,630 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6286 conditions, 3138 events. 881/3138 cut-off events. For 1240/1254 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 27943 event pairs, 192 based on Foata normal form. 21/3094 useless extension candidates. Maximal degree in co-relation 6257. Up to 515 conditions per place. [2022-01-19 06:13:09,640 INFO L132 encePairwiseOnDemand]: 257/269 looper letters, 125 selfloop transitions, 23 changer transitions 29/330 dead transitions. [2022-01-19 06:13:09,640 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 330 transitions, 1505 flow [2022-01-19 06:13:09,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 06:13:09,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 06:13:09,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2823 transitions. [2022-01-19 06:13:09,645 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.617319046577739 [2022-01-19 06:13:09,645 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2823 transitions. [2022-01-19 06:13:09,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2823 transitions. [2022-01-19 06:13:09,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:13:09,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2823 transitions. [2022-01-19 06:13:09,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 166.05882352941177) internal successors, (2823), 17 states have internal predecessors, (2823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:13:09,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 269.0) internal successors, (4842), 18 states have internal predecessors, (4842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:13:09,653 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 269.0) internal successors, (4842), 18 states have internal predecessors, (4842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:13:09,653 INFO L186 Difference]: Start difference. First operand has 249 places, 223 transitions, 839 flow. Second operand 17 states and 2823 transitions. [2022-01-19 06:13:09,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 330 transitions, 1505 flow [2022-01-19 06:13:09,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 330 transitions, 1499 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-19 06:13:09,667 INFO L242 Difference]: Finished difference. Result has 271 places, 222 transitions, 919 flow [2022-01-19 06:13:09,667 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=919, PETRI_PLACES=271, PETRI_TRANSITIONS=222} [2022-01-19 06:13:09,668 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 42 predicate places. [2022-01-19 06:13:09,668 INFO L470 AbstractCegarLoop]: Abstraction has has 271 places, 222 transitions, 919 flow [2022-01-19 06:13:09,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 159.08695652173913) internal successors, (3659), 23 states have internal predecessors, (3659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:13:09,669 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:13:09,669 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:13:09,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-01-19 06:13:09,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:13:09,883 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:13:09,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:13:09,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1760290870, now seen corresponding path program 3 times [2022-01-19 06:13:09,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:13:09,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048502908] [2022-01-19 06:13:09,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:13:09,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:13:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:13:10,146 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2022-01-19 06:13:10,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:13:10,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048502908] [2022-01-19 06:13:10,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048502908] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:13:10,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326208585] [2022-01-19 06:13:10,146 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 06:13:10,146 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:13:10,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:13:10,148 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) [2022-01-19 06:13:10,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-01-19 06:13:10,272 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-19 06:13:10,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:13:10,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-19 06:13:10,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:13:10,323 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-01-19 06:13:10,748 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:13:10,748 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 06:13:10,785 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:13:10,864 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:13:10,980 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 14 [2022-01-19 06:13:11,009 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-01-19 06:13:11,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:13:11,131 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_710 (Array Int Int)) (|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_710) |c_~#a~0.base|) (+ (* 28 |t_funThread2of2ForFork0_~i~0#1|) |~#a~0.offset|)) 0)) is different from false [2022-01-19 06:13:11,796 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-01-19 06:13:11,825 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:13:11,825 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-19 06:13:11,844 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 14 not checked. [2022-01-19 06:13:11,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326208585] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:13:11,845 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:13:11,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 23 [2022-01-19 06:13:11,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360109879] [2022-01-19 06:13:11,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:13:11,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-19 06:13:11,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:13:11,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-19 06:13:11,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=375, Unknown=1, NotChecked=40, Total=506 [2022-01-19 06:13:11,849 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 269 [2022-01-19 06:13:11,852 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 222 transitions, 919 flow. Second operand has 23 states, 23 states have (on average 159.1304347826087) internal successors, (3660), 23 states have internal predecessors, (3660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:13:11,852 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:13:11,852 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 269 [2022-01-19 06:13:11,852 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:13:14,591 INFO L129 PetriNetUnfolder]: 802/2897 cut-off events. [2022-01-19 06:13:14,592 INFO L130 PetriNetUnfolder]: For 3046/3064 co-relation queries the response was YES. [2022-01-19 06:13:14,602 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6321 conditions, 2897 events. 802/2897 cut-off events. For 3046/3064 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 25647 event pairs, 405 based on Foata normal form. 21/2853 useless extension candidates. Maximal degree in co-relation 6282. Up to 930 conditions per place. [2022-01-19 06:13:14,605 INFO L132 encePairwiseOnDemand]: 258/269 looper letters, 52 selfloop transitions, 8 changer transitions 71/271 dead transitions. [2022-01-19 06:13:14,605 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 271 transitions, 1294 flow [2022-01-19 06:13:14,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 06:13:14,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 06:13:14,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2140 transitions. [2022-01-19 06:13:14,608 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6119531026594224 [2022-01-19 06:13:14,608 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2140 transitions. [2022-01-19 06:13:14,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2140 transitions. [2022-01-19 06:13:14,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:13:14,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2140 transitions. [2022-01-19 06:13:14,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 164.6153846153846) internal successors, (2140), 13 states have internal predecessors, (2140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:13:14,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 269.0) internal successors, (3766), 14 states have internal predecessors, (3766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:13:14,614 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 269.0) internal successors, (3766), 14 states have internal predecessors, (3766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:13:14,614 INFO L186 Difference]: Start difference. First operand has 271 places, 222 transitions, 919 flow. Second operand 13 states and 2140 transitions. [2022-01-19 06:13:14,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 271 transitions, 1294 flow [2022-01-19 06:13:14,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 271 transitions, 1207 flow, removed 15 selfloop flow, removed 20 redundant places. [2022-01-19 06:13:14,628 INFO L242 Difference]: Finished difference. Result has 265 places, 193 transitions, 707 flow [2022-01-19 06:13:14,628 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=707, PETRI_PLACES=265, PETRI_TRANSITIONS=193} [2022-01-19 06:13:14,629 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 36 predicate places. [2022-01-19 06:13:14,629 INFO L470 AbstractCegarLoop]: Abstraction has has 265 places, 193 transitions, 707 flow [2022-01-19 06:13:14,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 159.1304347826087) internal successors, (3660), 23 states have internal predecessors, (3660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:13:14,630 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:13:14,630 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:13:14,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-01-19 06:13:14,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:13:14,835 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:13:14,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:13:14,835 INFO L85 PathProgramCache]: Analyzing trace with hash -357319213, now seen corresponding path program 1 times [2022-01-19 06:13:14,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:13:14,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146796810] [2022-01-19 06:13:14,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:13:14,836 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:13:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:13:14,939 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:13:14,940 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:13:14,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146796810] [2022-01-19 06:13:14,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146796810] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:13:14,940 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:13:14,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 06:13:14,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562168162] [2022-01-19 06:13:14,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:13:14,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 06:13:14,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:13:14,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 06:13:14,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-19 06:13:14,942 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 269 [2022-01-19 06:13:14,942 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 193 transitions, 707 flow. Second operand has 7 states, 7 states have (on average 175.85714285714286) internal successors, (1231), 7 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:13:14,942 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:13:14,942 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 269 [2022-01-19 06:13:14,943 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:13:15,197 INFO L129 PetriNetUnfolder]: 129/1222 cut-off events. [2022-01-19 06:13:15,198 INFO L130 PetriNetUnfolder]: For 621/622 co-relation queries the response was YES. [2022-01-19 06:13:15,203 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2119 conditions, 1222 events. 129/1222 cut-off events. For 621/622 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 8908 event pairs, 39 based on Foata normal form. 97/1267 useless extension candidates. Maximal degree in co-relation 2085. Up to 197 conditions per place. [2022-01-19 06:13:15,205 INFO L132 encePairwiseOnDemand]: 254/269 looper letters, 37 selfloop transitions, 17 changer transitions 3/211 dead transitions. [2022-01-19 06:13:15,206 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 211 transitions, 873 flow [2022-01-19 06:13:15,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 06:13:15,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 06:13:15,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1101 transitions. [2022-01-19 06:13:15,207 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6821561338289963 [2022-01-19 06:13:15,207 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1101 transitions. [2022-01-19 06:13:15,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1101 transitions. [2022-01-19 06:13:15,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:13:15,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1101 transitions. [2022-01-19 06:13:15,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 183.5) internal successors, (1101), 6 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:13:15,210 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 269.0) internal successors, (1883), 7 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:13:15,210 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 269.0) internal successors, (1883), 7 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:13:15,210 INFO L186 Difference]: Start difference. First operand has 265 places, 193 transitions, 707 flow. Second operand 6 states and 1101 transitions. [2022-01-19 06:13:15,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 211 transitions, 873 flow [2022-01-19 06:13:15,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 211 transitions, 816 flow, removed 14 selfloop flow, removed 20 redundant places. [2022-01-19 06:13:15,216 INFO L242 Difference]: Finished difference. Result has 225 places, 197 transitions, 715 flow [2022-01-19 06:13:15,217 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=715, PETRI_PLACES=225, PETRI_TRANSITIONS=197} [2022-01-19 06:13:15,217 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, -4 predicate places. [2022-01-19 06:13:15,217 INFO L470 AbstractCegarLoop]: Abstraction has has 225 places, 197 transitions, 715 flow [2022-01-19 06:13:15,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 175.85714285714286) internal successors, (1231), 7 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:13:15,217 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:13:15,218 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:13:15,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-19 06:13:15,218 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:13:15,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:13:15,218 INFO L85 PathProgramCache]: Analyzing trace with hash -238565637, now seen corresponding path program 1 times [2022-01-19 06:13:15,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:13:15,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598336972] [2022-01-19 06:13:15,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:13:15,218 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:13:15,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:14:13,990 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:14:13,990 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:14:13,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598336972] [2022-01-19 06:14:13,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598336972] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:14:13,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643552001] [2022-01-19 06:14:13,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:14:13,991 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:14:13,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:14:13,992 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) [2022-01-19 06:14:13,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-01-19 06:14:14,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:14:14,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 34 conjunts are in the unsatisfiable core [2022-01-19 06:14:14,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:14:14,242 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-01-19 06:14:14,702 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:14:14,702 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 06:14:14,769 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:14:14,999 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:14:15,213 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-01-19 06:14:15,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 06:14:15,333 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-01-19 06:14:15,401 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-01-19 06:14:15,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 06:14:15,515 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-01-19 06:14:15,608 INFO L353 Elim1Store]: treesize reduction 10, result has 44.4 percent of original size [2022-01-19 06:14:15,608 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 15 [2022-01-19 06:14:26,986 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 21 [2022-01-19 06:14:27,106 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:14:27,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:14:27,256 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_832 Int)) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|) v_ArrVal_832) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) 0)) (forall ((v_ArrVal_834 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_834) |c_t_funThread2of2ForFork0_~p~0#1.base|) (+ |c_t_funThread2of2ForFork0_~p~0#1.offset| 4)) 0)))) is different from false [2022-01-19 06:14:27,327 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 06:14:27,328 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-01-19 06:14:27,333 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 06:14:27,334 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 42 [2022-01-19 06:14:27,336 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2022-01-19 06:14:29,006 WARN L838 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~i~0#1| Int)) (or (forall ((v_ArrVal_832 Int)) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|) v_ArrVal_832) (+ |c_~#a~0.offset| (* 28 |t_funThread2of2ForFork0_~i~0#1|))) 0)) (and (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (= (+ |c_~#a~0.offset| (* 28 |t_funThread2of2ForFork0_~i~0#1|)) |c_t_funThread1of2ForFork0_~p~0#1.offset|) (= |c_~#a~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)))) is different from false [2022-01-19 06:14:29,299 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_828 (Array Int Int)) (|t_funThread2of2ForFork0_~i~0#1| Int) (v_ArrVal_832 Int)) (let ((.cse0 (+ |c_~#a~0.offset| (* 28 |t_funThread2of2ForFork0_~i~0#1|)))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_828) |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|) v_ArrVal_832) .cse0) 0) (and (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (= .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset|) (= |c_~#a~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|))))) is different from false [2022-01-19 06:14:29,574 WARN L838 $PredicateComparison]: unable to prove that (forall ((|~#a~0.offset| Int) (v_ArrVal_828 (Array Int Int)) (|t_funThread2of2ForFork0_~i~0#1| Int) (|t_funThread1of2ForFork0_~i~0#1| Int) (v_ArrVal_832 Int)) (let ((.cse0 (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) (.cse1 (+ (* 28 |t_funThread2of2ForFork0_~i~0#1|) |~#a~0.offset|))) (or (and (= .cse0 .cse1) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_828) |c_~#a~0.base|) .cse0 v_ArrVal_832) .cse1) 0)))) is different from false [2022-01-19 06:14:29,850 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_828 (Array Int Int)) (|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (|t_funThread1of2ForFork0_~i~0#1| Int) (v_ArrVal_832 Int)) (let ((.cse0 (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) (.cse1 (+ (* 28 |t_funThread2of2ForFork0_~i~0#1|) |~#a~0.offset|))) (or (and (= .cse0 .cse1) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_828) |c_~#a~0.base|) .cse0 v_ArrVal_832) .cse1) 0)))) is different from false [2022-01-19 06:14:37,343 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-01-19 06:14:37,545 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:14:37,545 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-19 06:14:37,617 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 5 not checked. [2022-01-19 06:14:37,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643552001] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:14:37,618 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:14:37,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 17, 18] total 72 [2022-01-19 06:14:37,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202414636] [2022-01-19 06:14:37,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:14:37,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-01-19 06:14:37,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:14:37,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-01-19 06:14:37,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=621, Invalid=3793, Unknown=28, NotChecked=670, Total=5112 [2022-01-19 06:14:37,624 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 269 [2022-01-19 06:14:37,629 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 197 transitions, 715 flow. Second operand has 72 states, 72 states have (on average 132.875) internal successors, (9567), 72 states have internal predecessors, (9567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:14:37,629 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:14:37,629 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 269 [2022-01-19 06:14:37,629 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:15:02,011 INFO L129 PetriNetUnfolder]: 4238/13067 cut-off events. [2022-01-19 06:15:02,012 INFO L130 PetriNetUnfolder]: For 5081/5113 co-relation queries the response was YES. [2022-01-19 06:15:02,039 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25105 conditions, 13067 events. 4238/13067 cut-off events. For 5081/5113 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 139982 event pairs, 1221 based on Foata normal form. 30/12642 useless extension candidates. Maximal degree in co-relation 25083. Up to 3847 conditions per place. [2022-01-19 06:15:02,070 INFO L132 encePairwiseOnDemand]: 234/269 looper letters, 290 selfloop transitions, 124 changer transitions 54/550 dead transitions. [2022-01-19 06:15:02,071 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 550 transitions, 2906 flow [2022-01-19 06:15:02,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-01-19 06:15:02,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2022-01-19 06:15:02,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 8643 transitions. [2022-01-19 06:15:02,082 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5100017702248185 [2022-01-19 06:15:02,082 INFO L72 ComplementDD]: Start complementDD. Operand 63 states and 8643 transitions. [2022-01-19 06:15:02,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 8643 transitions. [2022-01-19 06:15:02,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:15:02,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 63 states and 8643 transitions. [2022-01-19 06:15:02,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 64 states, 63 states have (on average 137.1904761904762) internal successors, (8643), 63 states have internal predecessors, (8643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:15:02,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 64 states, 64 states have (on average 269.0) internal successors, (17216), 64 states have internal predecessors, (17216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:15:02,115 INFO L81 ComplementDD]: Finished complementDD. Result has 64 states, 64 states have (on average 269.0) internal successors, (17216), 64 states have internal predecessors, (17216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:15:02,115 INFO L186 Difference]: Start difference. First operand has 225 places, 197 transitions, 715 flow. Second operand 63 states and 8643 transitions. [2022-01-19 06:15:02,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 550 transitions, 2906 flow [2022-01-19 06:15:02,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 550 transitions, 2903 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 06:15:02,131 INFO L242 Difference]: Finished difference. Result has 306 places, 298 transitions, 1534 flow [2022-01-19 06:15:02,131 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=712, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=1534, PETRI_PLACES=306, PETRI_TRANSITIONS=298} [2022-01-19 06:15:02,131 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 77 predicate places. [2022-01-19 06:15:02,131 INFO L470 AbstractCegarLoop]: Abstraction has has 306 places, 298 transitions, 1534 flow [2022-01-19 06:15:02,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 132.875) internal successors, (9567), 72 states have internal predecessors, (9567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:15:02,133 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:15:02,133 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:15:02,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-01-19 06:15:02,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-01-19 06:15:02,347 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:15:02,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:15:02,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1511907963, now seen corresponding path program 2 times [2022-01-19 06:15:02,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:15:02,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341315170] [2022-01-19 06:15:02,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:15:02,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:15:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:15:03,058 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-01-19 06:15:03,059 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:15:03,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341315170] [2022-01-19 06:15:03,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341315170] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:15:03,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215166324] [2022-01-19 06:15:03,059 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 06:15:03,059 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:15:03,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:15:03,060 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) [2022-01-19 06:15:03,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-01-19 06:15:03,187 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 06:15:03,187 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:15:03,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 31 conjunts are in the unsatisfiable core [2022-01-19 06:15:03,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:15:03,232 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-01-19 06:15:03,627 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:15:03,628 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 06:15:03,669 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:15:03,746 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:15:03,848 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-01-19 06:15:03,914 INFO L353 Elim1Store]: treesize reduction 10, result has 44.4 percent of original size [2022-01-19 06:15:03,914 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 15 [2022-01-19 06:15:03,991 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-01-19 06:15:19,589 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 21 [2022-01-19 06:15:19,642 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-01-19 06:15:19,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:15:19,790 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 19 [2022-01-19 06:15:20,389 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_918 Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (let ((.cse0 (* |t_funThread1of2ForFork0_~i~0#1| 28))) (or (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0) v_ArrVal_918) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) 0) (and (= |c_~#a~0.base| |c_t_funThread2of2ForFork0_~p~0#1.base|) (= (+ |c_t_funThread2of2ForFork0_~p~0#1.offset| 4) (+ |c_~#a~0.offset| .cse0 4)))))) is different from false [2022-01-19 06:15:22,405 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_918 Int) (|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (let ((.cse0 (* |t_funThread1of2ForFork0_~i~0#1| 28)) (.cse1 (* 28 |t_funThread2of2ForFork0_~i~0#1|))) (or (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ .cse0 |~#a~0.offset|) v_ArrVal_918) (+ .cse1 |~#a~0.offset|)) 0) (= (+ .cse0 4 |~#a~0.offset|) (+ .cse1 4 |~#a~0.offset|))))) is different from false [2022-01-19 06:15:22,549 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_918 Int) (v_ArrVal_915 (Array Int Int)) (|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (let ((.cse0 (* |t_funThread1of2ForFork0_~i~0#1| 28)) (.cse1 (* 28 |t_funThread2of2ForFork0_~i~0#1|))) (or (= (+ .cse0 4 |~#a~0.offset|) (+ .cse1 4 |~#a~0.offset|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_915) |c_~#a~0.base|) (+ .cse0 |~#a~0.offset|) v_ArrVal_918) (+ .cse1 |~#a~0.offset|)) 0)))) is different from false [2022-01-19 06:15:24,669 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 06:15:24,671 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-01-19 06:15:24,702 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:15:24,702 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-19 06:15:24,716 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 1 not checked. [2022-01-19 06:15:24,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215166324] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:15:24,716 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:15:24,716 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 15] total 40 [2022-01-19 06:15:24,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680519987] [2022-01-19 06:15:24,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:15:24,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-01-19 06:15:24,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:15:24,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-01-19 06:15:24,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1109, Unknown=15, NotChecked=216, Total=1560 [2022-01-19 06:15:24,720 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 269 [2022-01-19 06:15:24,723 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 298 transitions, 1534 flow. Second operand has 40 states, 40 states have (on average 149.65) internal successors, (5986), 40 states have internal predecessors, (5986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:15:24,723 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:15:24,723 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 269 [2022-01-19 06:15:24,723 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:15:25,389 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (< |c_~#a~0.base| (+ 5 |c_~#__global_lock~0.offset|)) (<= (+ |c_~#__global_lock~0.offset| 4) |c_~#a~0.base|) (forall ((v_ArrVal_918 Int) (v_ArrVal_915 (Array Int Int)) (|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (let ((.cse0 (* |t_funThread1of2ForFork0_~i~0#1| 28)) (.cse1 (* 28 |t_funThread2of2ForFork0_~i~0#1|))) (or (= (+ .cse0 4 |~#a~0.offset|) (+ .cse1 4 |~#a~0.offset|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_915) |c_~#a~0.base|) (+ .cse0 |~#a~0.offset|) v_ArrVal_918) (+ .cse1 |~#a~0.offset|)) 0)))) (= |c_~#__global_lock~0.offset| 0) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |c_~#a~0.base|))) is different from false [2022-01-19 06:15:26,150 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (< |c_~#a~0.base| (+ 5 |c_~#__global_lock~0.offset|)) (<= (+ |c_~#__global_lock~0.offset| 4) |c_~#a~0.base|) (forall ((v_ArrVal_918 Int) (v_ArrVal_915 (Array Int Int)) (|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (let ((.cse0 (* |t_funThread1of2ForFork0_~i~0#1| 28)) (.cse1 (* 28 |t_funThread2of2ForFork0_~i~0#1|))) (or (= (+ .cse0 4 |~#a~0.offset|) (+ .cse1 4 |~#a~0.offset|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_915) |c_~#a~0.base|) (+ .cse0 |~#a~0.offset|) v_ArrVal_918) (+ .cse1 |~#a~0.offset|)) 0)))) (forall ((v_ArrVal_918 Int) (|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (let ((.cse2 (* |t_funThread1of2ForFork0_~i~0#1| 28)) (.cse3 (* 28 |t_funThread2of2ForFork0_~i~0#1|))) (or (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ .cse2 |~#a~0.offset|) v_ArrVal_918) (+ .cse3 |~#a~0.offset|)) 0) (= (+ .cse2 4 |~#a~0.offset|) (+ .cse3 4 |~#a~0.offset|))))) (= |c_~#__global_lock~0.offset| 0) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |c_~#a~0.base|))) is different from false [2022-01-19 06:15:35,139 INFO L129 PetriNetUnfolder]: 1227/5036 cut-off events. [2022-01-19 06:15:35,139 INFO L130 PetriNetUnfolder]: For 6839/6871 co-relation queries the response was YES. [2022-01-19 06:15:35,162 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12655 conditions, 5036 events. 1227/5036 cut-off events. For 6839/6871 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 50800 event pairs, 568 based on Foata normal form. 7/4787 useless extension candidates. Maximal degree in co-relation 12611. Up to 2277 conditions per place. [2022-01-19 06:15:35,177 INFO L132 encePairwiseOnDemand]: 241/269 looper letters, 190 selfloop transitions, 71 changer transitions 11/409 dead transitions. [2022-01-19 06:15:35,177 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 409 transitions, 2803 flow [2022-01-19 06:15:35,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-19 06:15:35,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-01-19 06:15:35,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3085 transitions. [2022-01-19 06:15:35,181 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5734200743494424 [2022-01-19 06:15:35,181 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3085 transitions. [2022-01-19 06:15:35,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3085 transitions. [2022-01-19 06:15:35,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:15:35,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3085 transitions. [2022-01-19 06:15:35,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 154.25) internal successors, (3085), 20 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:15:35,188 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 269.0) internal successors, (5649), 21 states have internal predecessors, (5649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:15:35,188 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 269.0) internal successors, (5649), 21 states have internal predecessors, (5649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:15:35,188 INFO L186 Difference]: Start difference. First operand has 306 places, 298 transitions, 1534 flow. Second operand 20 states and 3085 transitions. [2022-01-19 06:15:35,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 409 transitions, 2803 flow [2022-01-19 06:15:35,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 409 transitions, 2647 flow, removed 11 selfloop flow, removed 29 redundant places. [2022-01-19 06:15:35,222 INFO L242 Difference]: Finished difference. Result has 306 places, 361 transitions, 2155 flow [2022-01-19 06:15:35,222 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=1416, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2155, PETRI_PLACES=306, PETRI_TRANSITIONS=361} [2022-01-19 06:15:35,223 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 77 predicate places. [2022-01-19 06:15:35,223 INFO L470 AbstractCegarLoop]: Abstraction has has 306 places, 361 transitions, 2155 flow [2022-01-19 06:15:35,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 149.65) internal successors, (5986), 40 states have internal predecessors, (5986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:15:35,224 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:15:35,224 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:15:35,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-01-19 06:15:35,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-01-19 06:15:35,451 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:15:35,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:15:35,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1523946865, now seen corresponding path program 3 times [2022-01-19 06:15:35,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:15:35,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994029442] [2022-01-19 06:15:35,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:15:35,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:15:35,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:15:35,888 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-01-19 06:15:35,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:15:35,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994029442] [2022-01-19 06:15:35,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994029442] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:15:35,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347558082] [2022-01-19 06:15:35,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 06:15:35,889 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:15:35,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:15:35,890 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) [2022-01-19 06:15:35,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-01-19 06:15:36,023 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-19 06:15:36,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:15:36,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 31 conjunts are in the unsatisfiable core [2022-01-19 06:15:36,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:15:36,071 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-01-19 06:15:36,442 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:15:36,442 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 06:15:36,492 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:15:36,603 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:15:36,752 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-01-19 06:15:36,813 INFO L353 Elim1Store]: treesize reduction 10, result has 44.4 percent of original size [2022-01-19 06:15:36,813 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 15 [2022-01-19 06:15:36,888 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-01-19 06:15:52,043 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 21 [2022-01-19 06:15:52,103 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-01-19 06:15:52,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:15:52,246 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 19 [2022-01-19 06:15:52,850 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1003 Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (let ((.cse0 (* |t_funThread1of2ForFork0_~i~0#1| 28))) (or (and (= |c_~#a~0.base| |c_t_funThread2of2ForFork0_~p~0#1.base|) (= (+ |c_t_funThread2of2ForFork0_~p~0#1.offset| 4) (+ |c_~#a~0.offset| .cse0 4))) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0) v_ArrVal_1003) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) 0)))) is different from false [2022-01-19 06:15:54,938 WARN L838 $PredicateComparison]: unable to prove that (forall ((|~#a~0.offset| Int) (v_ArrVal_1003 Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (let ((.cse0 (* |t_funThread1of2ForFork0_~i~0#1| 28)) (.cse1 (* 28 |t_funThread2of2ForFork0_~i~0#1|))) (or (= (+ .cse0 4 |~#a~0.offset|) (+ .cse1 4 |~#a~0.offset|)) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ .cse0 |~#a~0.offset|) v_ArrVal_1003) (+ .cse1 |~#a~0.offset|)) 0)))) is different from false [2022-01-19 06:15:55,056 WARN L838 $PredicateComparison]: unable to prove that (forall ((|~#a~0.offset| Int) (v_ArrVal_1003 Int) (v_ArrVal_1000 (Array Int Int)) (|t_funThread2of2ForFork0_~i~0#1| Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (let ((.cse0 (* |t_funThread1of2ForFork0_~i~0#1| 28)) (.cse1 (* 28 |t_funThread2of2ForFork0_~i~0#1|))) (or (= (+ .cse0 4 |~#a~0.offset|) (+ .cse1 4 |~#a~0.offset|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1000) |c_~#a~0.base|) (+ .cse0 |~#a~0.offset|) v_ArrVal_1003) (+ .cse1 |~#a~0.offset|)) 0)))) is different from false [2022-01-19 06:15:57,160 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 06:15:57,162 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-01-19 06:15:57,204 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:15:57,205 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-19 06:15:57,219 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 1 not checked. [2022-01-19 06:15:57,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347558082] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:15:57,219 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:15:57,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 15] total 38 [2022-01-19 06:15:57,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204631340] [2022-01-19 06:15:57,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:15:57,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-01-19 06:15:57,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:15:57,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-01-19 06:15:57,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1029, Unknown=9, NotChecked=204, Total=1406 [2022-01-19 06:15:57,223 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 269 [2022-01-19 06:15:57,225 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 361 transitions, 2155 flow. Second operand has 38 states, 38 states have (on average 152.55263157894737) internal successors, (5797), 38 states have internal predecessors, (5797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:15:57,225 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:15:57,225 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 269 [2022-01-19 06:15:57,226 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:16:24,287 WARN L228 SmtUtils]: Spent 24.78s on a formula simplification. DAG size of input: 56 DAG size of output: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:16:31,310 INFO L129 PetriNetUnfolder]: 1672/7879 cut-off events. [2022-01-19 06:16:31,310 INFO L130 PetriNetUnfolder]: For 20349/20557 co-relation queries the response was YES. [2022-01-19 06:16:31,347 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22149 conditions, 7879 events. 1672/7879 cut-off events. For 20349/20557 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 90718 event pairs, 113 based on Foata normal form. 98/7643 useless extension candidates. Maximal degree in co-relation 22095. Up to 857 conditions per place. [2022-01-19 06:16:31,369 INFO L132 encePairwiseOnDemand]: 240/269 looper letters, 327 selfloop transitions, 254 changer transitions 23/750 dead transitions. [2022-01-19 06:16:31,369 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 750 transitions, 6247 flow [2022-01-19 06:16:31,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-19 06:16:31,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-01-19 06:16:31,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 4648 transitions. [2022-01-19 06:16:31,374 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5958210485835149 [2022-01-19 06:16:31,374 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 4648 transitions. [2022-01-19 06:16:31,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 4648 transitions. [2022-01-19 06:16:31,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:16:31,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 4648 transitions. [2022-01-19 06:16:31,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 160.27586206896552) internal successors, (4648), 29 states have internal predecessors, (4648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:16:31,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 269.0) internal successors, (8070), 30 states have internal predecessors, (8070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:16:31,385 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 269.0) internal successors, (8070), 30 states have internal predecessors, (8070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:16:31,385 INFO L186 Difference]: Start difference. First operand has 306 places, 361 transitions, 2155 flow. Second operand 29 states and 4648 transitions. [2022-01-19 06:16:31,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 750 transitions, 6247 flow [2022-01-19 06:16:31,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 750 transitions, 6139 flow, removed 50 selfloop flow, removed 4 redundant places. [2022-01-19 06:16:31,471 INFO L242 Difference]: Finished difference. Result has 349 places, 545 transitions, 4524 flow [2022-01-19 06:16:31,472 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=2063, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=4524, PETRI_PLACES=349, PETRI_TRANSITIONS=545} [2022-01-19 06:16:31,472 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 120 predicate places. [2022-01-19 06:16:31,472 INFO L470 AbstractCegarLoop]: Abstraction has has 349 places, 545 transitions, 4524 flow [2022-01-19 06:16:31,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 152.55263157894737) internal successors, (5797), 38 states have internal predecessors, (5797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:16:31,473 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:16:31,473 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:16:31,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-01-19 06:16:31,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-01-19 06:16:31,700 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:16:31,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:16:31,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1931114707, now seen corresponding path program 4 times [2022-01-19 06:16:31,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:16:31,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386036176] [2022-01-19 06:16:31,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:16:31,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:16:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:16:32,573 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:16:32,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:16:32,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386036176] [2022-01-19 06:16:32,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386036176] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:16:32,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220105612] [2022-01-19 06:16:32,574 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-19 06:16:32,574 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:16:32,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:16:32,576 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) [2022-01-19 06:16:32,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-01-19 06:16:32,707 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-19 06:16:32,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:16:32,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 35 conjunts are in the unsatisfiable core [2022-01-19 06:16:32,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:16:32,788 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-01-19 06:16:33,288 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:16:33,289 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 06:16:33,343 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:16:33,554 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:16:33,659 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-01-19 06:16:33,737 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-01-19 06:16:33,807 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-01-19 06:16:33,867 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-01-19 06:16:33,952 INFO L353 Elim1Store]: treesize reduction 10, result has 44.4 percent of original size [2022-01-19 06:16:33,953 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 15 [2022-01-19 06:16:57,100 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 21 [2022-01-19 06:16:57,159 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:16:57,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:16:57,273 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1091 (Array Int Int)) (|t_funThread2of2ForFork0_~i~0#1| Int)) (let ((.cse0 (* 28 |t_funThread2of2ForFork0_~i~0#1|))) (or (= (select (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1091) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0 4)) 0))))) is different from false [2022-01-19 06:16:57,300 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1091 (Array Int Int)) (v_ArrVal_1089 Int) (|t_funThread2of2ForFork0_~i~0#1| Int)) (let ((.cse0 (* 28 |t_funThread2of2ForFork0_~i~0#1|))) (or (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|) v_ArrVal_1089) (+ |c_~#a~0.offset| .cse0)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1091) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0 4)) 0))))) is different from false [2022-01-19 06:16:57,432 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 06:16:57,433 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-01-19 06:16:57,440 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 06:16:57,440 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 48 [2022-01-19 06:16:57,443 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2022-01-19 06:16:58,071 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1089 Int) (|t_funThread2of2ForFork0_~i~0#1| Int)) (let ((.cse0 (+ |c_~#a~0.offset| (* 28 |t_funThread2of2ForFork0_~i~0#1|)))) (or (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|) v_ArrVal_1089) .cse0) 0) (and (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (= .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset|) (= |c_~#a~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|))))) is different from false [2022-01-19 06:16:58,268 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1089 Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (v_ArrVal_1085 (Array Int Int))) (let ((.cse0 (+ |c_~#a~0.offset| (* 28 |t_funThread2of2ForFork0_~i~0#1|)))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1085) |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|) v_ArrVal_1089) .cse0) 0) (and (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (= .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset|) (= |c_~#a~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|))))) is different from false [2022-01-19 06:16:58,416 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1089 Int) (|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (|t_funThread1of2ForFork0_~i~0#1| Int) (v_ArrVal_1085 (Array Int Int))) (let ((.cse0 (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) (.cse1 (+ (* 28 |t_funThread2of2ForFork0_~i~0#1|) |~#a~0.offset|))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1085) |c_~#a~0.base|) .cse0 v_ArrVal_1089) .cse1) 0) (and (= .cse0 .cse1) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))))) is different from false [2022-01-19 06:17:07,774 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-01-19 06:17:08,018 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:17:08,019 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-19 06:17:08,074 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 5 not checked. [2022-01-19 06:17:08,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220105612] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:17:08,075 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:17:08,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 17] total 46 [2022-01-19 06:17:08,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258318045] [2022-01-19 06:17:08,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:17:08,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-01-19 06:17:08,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:17:08,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-01-19 06:17:08,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1375, Unknown=20, NotChecked=410, Total=2070 [2022-01-19 06:17:08,078 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 269 [2022-01-19 06:17:08,080 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 545 transitions, 4524 flow. Second operand has 46 states, 46 states have (on average 149.47826086956522) internal successors, (6876), 46 states have internal predecessors, (6876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:17:08,080 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:17:08,080 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 269 [2022-01-19 06:17:08,080 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:17:42,321 WARN L228 SmtUtils]: Spent 31.99s on a formula simplification. DAG size of input: 53 DAG size of output: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:18:22,961 INFO L129 PetriNetUnfolder]: 2521/10853 cut-off events. [2022-01-19 06:18:22,962 INFO L130 PetriNetUnfolder]: For 45548/45949 co-relation queries the response was YES. [2022-01-19 06:18:23,073 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36918 conditions, 10853 events. 2521/10853 cut-off events. For 45548/45949 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 130125 event pairs, 326 based on Foata normal form. 100/10460 useless extension candidates. Maximal degree in co-relation 36844. Up to 2144 conditions per place. [2022-01-19 06:18:23,116 INFO L132 encePairwiseOnDemand]: 239/269 looper letters, 379 selfloop transitions, 472 changer transitions 55/1043 dead transitions. [2022-01-19 06:18:23,116 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 1043 transitions, 11380 flow [2022-01-19 06:18:23,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-01-19 06:18:23,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2022-01-19 06:18:23,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 5838 transitions. [2022-01-19 06:18:23,123 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5711211113285072 [2022-01-19 06:18:23,123 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 5838 transitions. [2022-01-19 06:18:23,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 5838 transitions. [2022-01-19 06:18:23,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:18:23,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 5838 transitions. [2022-01-19 06:18:23,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 153.6315789473684) internal successors, (5838), 38 states have internal predecessors, (5838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:23,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 269.0) internal successors, (10491), 39 states have internal predecessors, (10491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:23,139 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 269.0) internal successors, (10491), 39 states have internal predecessors, (10491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:23,139 INFO L186 Difference]: Start difference. First operand has 349 places, 545 transitions, 4524 flow. Second operand 38 states and 5838 transitions. [2022-01-19 06:18:23,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 1043 transitions, 11380 flow [2022-01-19 06:18:23,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 1043 transitions, 10968 flow, removed 204 selfloop flow, removed 2 redundant places. [2022-01-19 06:18:23,459 INFO L242 Difference]: Finished difference. Result has 405 places, 908 transitions, 9956 flow [2022-01-19 06:18:23,459 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=4380, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=193, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=9956, PETRI_PLACES=405, PETRI_TRANSITIONS=908} [2022-01-19 06:18:23,464 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 176 predicate places. [2022-01-19 06:18:23,465 INFO L470 AbstractCegarLoop]: Abstraction has has 405 places, 908 transitions, 9956 flow [2022-01-19 06:18:23,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 149.47826086956522) internal successors, (6876), 46 states have internal predecessors, (6876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:23,466 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:18:23,466 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:18:23,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-01-19 06:18:23,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-01-19 06:18:23,687 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:18:23,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:18:23,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1803294487, now seen corresponding path program 5 times [2022-01-19 06:18:23,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:18:23,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194349515] [2022-01-19 06:18:23,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:18:23,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:18:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:18:24,771 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-01-19 06:18:24,772 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:18:24,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194349515] [2022-01-19 06:18:24,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194349515] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:18:24,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185948947] [2022-01-19 06:18:24,772 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-19 06:18:24,772 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:18:24,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:18:24,774 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) [2022-01-19 06:18:24,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-01-19 06:18:24,922 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-01-19 06:18:24,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:18:24,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 33 conjunts are in the unsatisfiable core [2022-01-19 06:18:24,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:18:25,020 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-01-19 06:18:25,712 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:18:25,713 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 06:18:25,783 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:18:25,963 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:18:26,089 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-01-19 06:18:26,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 06:18:26,185 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-01-19 06:18:26,272 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-01-19 06:18:26,429 INFO L353 Elim1Store]: treesize reduction 10, result has 44.4 percent of original size [2022-01-19 06:18:26,429 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 15 [2022-01-19 06:18:47,084 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 21 [2022-01-19 06:18:47,151 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-01-19 06:18:47,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:18:47,503 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1176 Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (v_ArrVal_1175 (Array Int Int))) (let ((.cse0 (* 28 |t_funThread2of2ForFork0_~i~0#1|))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1175) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0 4)) 0)) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|) v_ArrVal_1176) (+ |c_~#a~0.offset| .cse0)) 0)))) is different from false [2022-01-19 06:18:47,631 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 06:18:47,632 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-01-19 06:18:47,650 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 06:18:47,650 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 48 [2022-01-19 06:18:47,660 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2022-01-19 06:18:48,319 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1176 Int) (|t_funThread2of2ForFork0_~i~0#1| Int)) (let ((.cse0 (+ |c_~#a~0.offset| (* 28 |t_funThread2of2ForFork0_~i~0#1|)))) (or (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|) v_ArrVal_1176) .cse0) 0) (and (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (= .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset|) (= |c_~#a~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|))))) is different from false [2022-01-19 06:18:50,362 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1176 Int) (|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (let ((.cse0 (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) (.cse1 (+ (* 28 |t_funThread2of2ForFork0_~i~0#1|) |~#a~0.offset|))) (or (= (select (store (select |c_#memory_int| |c_~#a~0.base|) .cse0 v_ArrVal_1176) .cse1) 0) (and (= .cse0 .cse1) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))))) is different from false [2022-01-19 06:18:50,675 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1176 Int) (|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (|t_funThread1of2ForFork0_~i~0#1| Int) (v_ArrVal_1172 (Array Int Int))) (let ((.cse0 (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) (.cse1 (+ (* 28 |t_funThread2of2ForFork0_~i~0#1|) |~#a~0.offset|))) (or (and (= .cse0 .cse1) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1172) |c_~#a~0.base|) .cse0 v_ArrVal_1176) .cse1) 0)))) is different from false [2022-01-19 06:19:16,407 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-01-19 06:19:17,311 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:19:17,312 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-19 06:19:17,381 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 1 not checked. [2022-01-19 06:19:17,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185948947] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:19:17,382 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:19:17,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 17] total 46 [2022-01-19 06:19:17,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877114219] [2022-01-19 06:19:17,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:19:17,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-01-19 06:19:17,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:19:17,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-01-19 06:19:17,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=1462, Unknown=18, NotChecked=332, Total=2070 [2022-01-19 06:19:17,387 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 269 [2022-01-19 06:19:17,391 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 908 transitions, 9956 flow. Second operand has 46 states, 46 states have (on average 149.47826086956522) internal successors, (6876), 46 states have internal predecessors, (6876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:19:17,391 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:19:17,391 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 269 [2022-01-19 06:19:17,391 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:19:29,697 WARN L228 SmtUtils]: Spent 10.00s on a formula simplification. DAG size of input: 60 DAG size of output: 34 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:19:38,158 INFO L129 PetriNetUnfolder]: 2470/10782 cut-off events. [2022-01-19 06:19:38,158 INFO L130 PetriNetUnfolder]: For 53921/54362 co-relation queries the response was YES. [2022-01-19 06:19:38,281 INFO L84 FinitePrefix]: Finished finitePrefix Result has 40656 conditions, 10782 events. 2470/10782 cut-off events. For 53921/54362 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 130096 event pairs, 223 based on Foata normal form. 186/10466 useless extension candidates. Maximal degree in co-relation 40561. Up to 1883 conditions per place. [2022-01-19 06:19:38,320 INFO L132 encePairwiseOnDemand]: 241/269 looper letters, 435 selfloop transitions, 729 changer transitions 21/1322 dead transitions. [2022-01-19 06:19:38,320 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 1322 transitions, 16925 flow [2022-01-19 06:19:38,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-01-19 06:19:38,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2022-01-19 06:19:38,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 6431 transitions. [2022-01-19 06:19:38,327 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5692157904053815 [2022-01-19 06:19:38,327 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 6431 transitions. [2022-01-19 06:19:38,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 6431 transitions. [2022-01-19 06:19:38,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:19:38,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 6431 transitions. [2022-01-19 06:19:38,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 153.11904761904762) internal successors, (6431), 42 states have internal predecessors, (6431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:19:38,343 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 269.0) internal successors, (11567), 43 states have internal predecessors, (11567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:19:38,344 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 269.0) internal successors, (11567), 43 states have internal predecessors, (11567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:19:38,344 INFO L186 Difference]: Start difference. First operand has 405 places, 908 transitions, 9956 flow. Second operand 42 states and 6431 transitions. [2022-01-19 06:19:38,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 1322 transitions, 16925 flow [2022-01-19 06:19:38,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 1322 transitions, 16505 flow, removed 207 selfloop flow, removed 6 redundant places. [2022-01-19 06:19:38,893 INFO L242 Difference]: Finished difference. Result has 447 places, 1161 transitions, 14577 flow [2022-01-19 06:19:38,894 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=9662, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=908, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=493, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=14577, PETRI_PLACES=447, PETRI_TRANSITIONS=1161} [2022-01-19 06:19:38,895 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 218 predicate places. [2022-01-19 06:19:38,895 INFO L470 AbstractCegarLoop]: Abstraction has has 447 places, 1161 transitions, 14577 flow [2022-01-19 06:19:38,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 149.47826086956522) internal successors, (6876), 46 states have internal predecessors, (6876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:19:38,896 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:19:38,896 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:19:38,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-01-19 06:19:39,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:19:39,107 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:19:39,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:19:39,108 INFO L85 PathProgramCache]: Analyzing trace with hash -319580311, now seen corresponding path program 6 times [2022-01-19 06:19:39,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:19:39,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144420745] [2022-01-19 06:19:39,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:19:39,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:19:39,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:19:40,156 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-01-19 06:19:40,157 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:19:40,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144420745] [2022-01-19 06:19:40,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144420745] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:19:40,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565307260] [2022-01-19 06:19:40,157 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-19 06:19:40,157 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:19:40,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:19:40,159 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) [2022-01-19 06:19:40,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-01-19 06:19:40,298 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-01-19 06:19:40,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:19:40,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 34 conjunts are in the unsatisfiable core [2022-01-19 06:19:40,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:19:40,424 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-01-19 06:19:41,534 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:19:41,535 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 06:19:41,617 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:19:41,844 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:19:42,012 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-01-19 06:19:42,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 06:19:42,217 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-01-19 06:19:42,345 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-01-19 06:19:42,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 06:19:42,754 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-01-19 06:19:42,856 INFO L353 Elim1Store]: treesize reduction 10, result has 44.4 percent of original size [2022-01-19 06:19:42,856 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 15 [2022-01-19 06:20:00,569 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 21 [2022-01-19 06:20:00,641 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-01-19 06:20:00,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:20:00,750 WARN L838 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) 0) (forall ((v_ArrVal_1264 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1264) |c_t_funThread2of2ForFork0_~p~0#1.base|) (+ |c_t_funThread2of2ForFork0_~p~0#1.offset| 4)) 0)))) is different from false [2022-01-19 06:20:00,772 WARN L838 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~i~0#1| Int)) (or (forall ((v_ArrVal_1264 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1264) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* 28 |t_funThread2of2ForFork0_~i~0#1|) 4)) 0))) (= (select (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* 28 |t_funThread2of2ForFork0_~i~0#1|))) 0))) is different from false [2022-01-19 06:20:00,915 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1263 Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (v_ArrVal_1264 (Array Int Int))) (let ((.cse0 (* 28 |t_funThread2of2ForFork0_~i~0#1|))) (or (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|) v_ArrVal_1263) (+ |c_~#a~0.offset| .cse0)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1264) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0 4)) 0))))) is different from false [2022-01-19 06:20:01,265 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 06:20:01,265 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-01-19 06:20:01,289 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 06:20:01,289 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 48 [2022-01-19 06:20:01,317 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2022-01-19 06:20:02,155 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1263 Int) (|t_funThread2of2ForFork0_~i~0#1| Int)) (let ((.cse0 (+ |c_~#a~0.offset| (* 28 |t_funThread2of2ForFork0_~i~0#1|)))) (or (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|) v_ArrVal_1263) .cse0) 0) (and (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (= .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset|) (= |c_~#a~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|))))) is different from false [2022-01-19 06:20:04,276 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1263 Int) (|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (let ((.cse0 (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) (.cse1 (+ (* 28 |t_funThread2of2ForFork0_~i~0#1|) |~#a~0.offset|))) (or (= (select (store (select |c_#memory_int| |c_~#a~0.base|) .cse0 v_ArrVal_1263) .cse1) 0) (and (= .cse0 .cse1) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))))) is different from false [2022-01-19 06:20:04,978 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1258 (Array Int Int)) (v_ArrVal_1263 Int) (|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (let ((.cse0 (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) (.cse1 (+ (* 28 |t_funThread2of2ForFork0_~i~0#1|) |~#a~0.offset|))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1258) |c_~#a~0.base|) .cse0 v_ArrVal_1263) .cse1) 0) (and (= .cse0 .cse1) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))))) is different from false [2022-01-19 06:20:29,520 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-01-19 06:20:29,675 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:20:29,675 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-19 06:20:29,733 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 1 not checked. [2022-01-19 06:20:29,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565307260] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:20:29,733 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:20:29,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 44 [2022-01-19 06:20:29,733 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029592291] [2022-01-19 06:20:29,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:20:29,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-01-19 06:20:29,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:20:29,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-01-19 06:20:29,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1219, Unknown=15, NotChecked=462, Total=1892 [2022-01-19 06:20:29,736 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 269 [2022-01-19 06:20:29,738 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 1161 transitions, 14577 flow. Second operand has 44 states, 44 states have (on average 152.38636363636363) internal successors, (6705), 44 states have internal predecessors, (6705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:20:29,738 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:20:29,738 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 269 [2022-01-19 06:20:29,738 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:20:43,759 INFO L129 PetriNetUnfolder]: 2770/13348 cut-off events. [2022-01-19 06:20:43,759 INFO L130 PetriNetUnfolder]: For 72133/73054 co-relation queries the response was YES. [2022-01-19 06:20:43,905 INFO L84 FinitePrefix]: Finished finitePrefix Result has 51847 conditions, 13348 events. 2770/13348 cut-off events. For 72133/73054 co-relation queries the response was YES. Maximal size of possible extension queue 718. Compared 173111 event pairs, 327 based on Foata normal form. 483/13124 useless extension candidates. Maximal degree in co-relation 51742. Up to 1782 conditions per place. [2022-01-19 06:20:43,948 INFO L132 encePairwiseOnDemand]: 239/269 looper letters, 712 selfloop transitions, 966 changer transitions 15/1859 dead transitions. [2022-01-19 06:20:43,948 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 485 places, 1859 transitions, 27986 flow [2022-01-19 06:20:43,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-01-19 06:20:43,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2022-01-19 06:20:43,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 6571 transitions. [2022-01-19 06:20:43,953 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5816073641352452 [2022-01-19 06:20:43,954 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 6571 transitions. [2022-01-19 06:20:43,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 6571 transitions. [2022-01-19 06:20:43,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:20:43,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 6571 transitions. [2022-01-19 06:20:43,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 156.45238095238096) internal successors, (6571), 42 states have internal predecessors, (6571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:20:43,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 269.0) internal successors, (11567), 43 states have internal predecessors, (11567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:20:43,967 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 269.0) internal successors, (11567), 43 states have internal predecessors, (11567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:20:43,967 INFO L186 Difference]: Start difference. First operand has 447 places, 1161 transitions, 14577 flow. Second operand 42 states and 6571 transitions. [2022-01-19 06:20:43,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 485 places, 1859 transitions, 27986 flow [2022-01-19 06:20:44,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 476 places, 1859 transitions, 26956 flow, removed 314 selfloop flow, removed 9 redundant places. [2022-01-19 06:20:44,762 INFO L242 Difference]: Finished difference. Result has 501 places, 1656 transitions, 24495 flow [2022-01-19 06:20:44,763 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=13971, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=508, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=520, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=24495, PETRI_PLACES=501, PETRI_TRANSITIONS=1656} [2022-01-19 06:20:44,763 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 272 predicate places. [2022-01-19 06:20:44,763 INFO L470 AbstractCegarLoop]: Abstraction has has 501 places, 1656 transitions, 24495 flow [2022-01-19 06:20:44,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 152.38636363636363) internal successors, (6705), 44 states have internal predecessors, (6705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:20:44,764 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:20:44,764 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:20:44,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-01-19 06:20:44,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:20:44,989 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:20:44,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:20:44,990 INFO L85 PathProgramCache]: Analyzing trace with hash 896369049, now seen corresponding path program 7 times [2022-01-19 06:20:44,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:20:44,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558584532] [2022-01-19 06:20:44,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:20:44,990 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:20:45,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:40,519 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:21:40,519 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:21:40,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558584532] [2022-01-19 06:21:40,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558584532] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:21:40,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633313213] [2022-01-19 06:21:40,519 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-19 06:21:40,519 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:21:40,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:21:40,523 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) [2022-01-19 06:21:40,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-01-19 06:21:40,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:40,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 33 conjunts are in the unsatisfiable core [2022-01-19 06:21:40,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:21:40,770 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-01-19 06:21:41,281 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:21:41,282 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 06:21:41,356 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:21:41,472 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:21:41,627 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-01-19 06:21:41,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 06:21:41,730 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-01-19 06:21:41,892 INFO L353 Elim1Store]: treesize reduction 10, result has 44.4 percent of original size [2022-01-19 06:21:41,892 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 15 [2022-01-19 06:21:41,960 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-01-19 06:21:59,043 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 21 [2022-01-19 06:21:59,163 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-01-19 06:21:59,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:21:59,451 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1350 Int) (v_ArrVal_1348 (Array Int Int)) (|t_funThread2of2ForFork0_~i~0#1| Int)) (let ((.cse0 (* 28 |t_funThread2of2ForFork0_~i~0#1|))) (or (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|) v_ArrVal_1350) (+ |c_~#a~0.offset| .cse0)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1348) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0 4)) 0))))) is different from false [2022-01-19 06:21:59,501 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 06:21:59,502 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-01-19 06:21:59,509 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 06:21:59,509 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 48 [2022-01-19 06:21:59,514 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2022-01-19 06:22:00,143 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1350 Int) (|t_funThread2of2ForFork0_~i~0#1| Int)) (let ((.cse0 (+ |c_~#a~0.offset| (* 28 |t_funThread2of2ForFork0_~i~0#1|)))) (or (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|) v_ArrVal_1350) .cse0) 0) (and (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (= .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset|) (= |c_~#a~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|))))) is different from false [2022-01-19 06:22:02,167 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1350 Int) (|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (let ((.cse0 (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) (.cse1 (+ (* 28 |t_funThread2of2ForFork0_~i~0#1|) |~#a~0.offset|))) (or (and (= .cse0 .cse1) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) .cse0 v_ArrVal_1350) .cse1) 0)))) is different from false [2022-01-19 06:22:02,391 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1350 Int) (v_ArrVal_1345 (Array Int Int)) (|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (let ((.cse0 (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) (.cse1 (+ (* 28 |t_funThread2of2ForFork0_~i~0#1|) |~#a~0.offset|))) (or (and (= .cse0 .cse1) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1345) |c_~#a~0.base|) .cse0 v_ArrVal_1350) .cse1) 0)))) is different from false [2022-01-19 06:22:09,696 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-01-19 06:22:09,840 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:22:09,840 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-19 06:22:09,908 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 1 not checked. [2022-01-19 06:22:09,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633313213] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:22:09,908 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:22:09,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 17, 17] total 71 [2022-01-19 06:22:09,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991197183] [2022-01-19 06:22:09,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:22:09,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-01-19 06:22:09,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:22:09,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-01-19 06:22:09,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=502, Invalid=3924, Unknown=12, NotChecked=532, Total=4970 [2022-01-19 06:22:09,912 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 269 [2022-01-19 06:22:09,915 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 501 places, 1656 transitions, 24495 flow. Second operand has 71 states, 71 states have (on average 131.8732394366197) internal successors, (9363), 71 states have internal predecessors, (9363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:22:09,915 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:22:09,915 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 269 [2022-01-19 06:22:09,915 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:22:32,212 WARN L228 SmtUtils]: Spent 17.73s on a formula simplification. DAG size of input: 53 DAG size of output: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:22:39,444 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (forall ((v_ArrVal_1350 Int) (|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (let ((.cse0 (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) (.cse1 (+ (* 28 |t_funThread2of2ForFork0_~i~0#1|) |~#a~0.offset|))) (or (and (= .cse0 .cse1) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) .cse0 v_ArrVal_1350) .cse1) 0)))) (forall ((v_ArrVal_1350 Int) (v_ArrVal_1345 (Array Int Int)) (|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (let ((.cse2 (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) (.cse3 (+ (* 28 |t_funThread2of2ForFork0_~i~0#1|) |~#a~0.offset|))) (or (and (= .cse2 .cse3) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1345) |c_~#a~0.base|) .cse2 v_ArrVal_1350) .cse3) 0)))) (<= |c_~#__global_lock~0.base| 3) (= |c_~#a~0.base| 4) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |c_~#a~0.base|))) is different from false [2022-01-19 06:23:09,146 WARN L228 SmtUtils]: Spent 29.66s on a formula simplification. DAG size of input: 66 DAG size of output: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:23:32,794 WARN L228 SmtUtils]: Spent 23.61s on a formula simplification. DAG size of input: 64 DAG size of output: 31 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:23:34,802 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1350 Int) (|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (let ((.cse0 (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) (.cse1 (+ (* 28 |t_funThread2of2ForFork0_~i~0#1|) |~#a~0.offset|))) (or (and (= .cse0 .cse1) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) .cse0 v_ArrVal_1350) .cse1) 0)))) (<= |c_~#__global_lock~0.base| 3) (= |c_~#a~0.base| 4) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |c_~#a~0.base|))) is different from false [2022-01-19 06:24:02,292 WARN L228 SmtUtils]: Spent 8.16s on a formula simplification. DAG size of input: 61 DAG size of output: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:24:10,577 WARN L228 SmtUtils]: Spent 8.06s on a formula simplification. DAG size of input: 53 DAG size of output: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:24:33,237 WARN L228 SmtUtils]: Spent 8.16s on a formula simplification. DAG size of input: 59 DAG size of output: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:25:31,503 WARN L228 SmtUtils]: Spent 58.20s on a formula simplification. DAG size of input: 47 DAG size of output: 34 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:25:40,618 WARN L228 SmtUtils]: Spent 8.18s on a formula simplification. DAG size of input: 71 DAG size of output: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2022-01-19 06:25:53,462 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-19 06:25:53,462 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-19 06:25:54,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-01-19 06:25:54,663 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-01-19 06:25:54,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2022-01-19 06:25:54,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-01-19 06:25:54,679 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-01-19 06:25:54,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-19 06:25:54,679 WARN L594 AbstractCegarLoop]: Verification canceled: while executing Executor. [2022-01-19 06:25:54,679 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-01-19 06:25:54,679 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2022-01-19 06:25:54,679 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-01-19 06:25:54,680 INFO L732 BasicCegarLoop]: Path program histogram: [7, 3, 2, 2, 1, 1, 1, 1, 1] [2022-01-19 06:25:54,680 INFO L309 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/2) [2022-01-19 06:25:54,681 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2022-01-19 06:25:54,681 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=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, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 06:25:54,681 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-19 06:25:54,681 WARN L594 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was constructing initial abstraction,while executing CegarLoopForPetriNet. [2022-01-19 06:25:54,681 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 1 remaining) [2022-01-19 06:25:54,682 INFO L732 BasicCegarLoop]: Path program histogram: [] [2022-01-19 06:25:54,682 INFO L309 ceAbstractionStarter]: Result for error location InUseError was TIMEOUT (2/2) [2022-01-19 06:25:54,682 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2022-01-19 06:25:54,682 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 06:25:54,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 06:25:54 BasicIcfg [2022-01-19 06:25:54,691 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 06:25:54,692 INFO L158 Benchmark]: Toolchain (without parser) took 798535.02ms. Allocated memory was 343.9MB in the beginning and 12.3GB in the end (delta: 11.9GB). Free memory was 285.9MB in the beginning and 8.2GB in the end (delta: -7.9GB). Peak memory consumption was 4.1GB. Max. memory is 16.0GB. [2022-01-19 06:25:54,692 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 343.9MB. Free memory is still 305.0MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 06:25:54,692 INFO L158 Benchmark]: CACSL2BoogieTranslator took 566.24ms. Allocated memory was 343.9MB in the beginning and 499.1MB in the end (delta: 155.2MB). Free memory was 285.8MB in the beginning and 449.7MB in the end (delta: -164.0MB). Peak memory consumption was 11.3MB. Max. memory is 16.0GB. [2022-01-19 06:25:54,692 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.27ms. Allocated memory is still 499.1MB. Free memory was 449.7MB in the beginning and 446.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 06:25:54,692 INFO L158 Benchmark]: Boogie Preprocessor took 30.81ms. Allocated memory is still 499.1MB. Free memory was 446.9MB in the beginning and 444.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 06:25:54,692 INFO L158 Benchmark]: RCFGBuilder took 412.08ms. Allocated memory is still 499.1MB. Free memory was 444.8MB in the beginning and 427.4MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2022-01-19 06:25:54,693 INFO L158 Benchmark]: TraceAbstraction took 797460.75ms. Allocated memory was 499.1MB in the beginning and 12.3GB in the end (delta: 11.8GB). Free memory was 426.7MB in the beginning and 8.2GB in the end (delta: -7.8GB). Peak memory consumption was 4.0GB. Max. memory is 16.0GB. [2022-01-19 06:25:54,694 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 343.9MB. Free memory is still 305.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 566.24ms. Allocated memory was 343.9MB in the beginning and 499.1MB in the end (delta: 155.2MB). Free memory was 285.8MB in the beginning and 449.7MB in the end (delta: -164.0MB). Peak memory consumption was 11.3MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 60.27ms. Allocated memory is still 499.1MB. Free memory was 449.7MB in the beginning and 446.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 30.81ms. Allocated memory is still 499.1MB. Free memory was 446.9MB in the beginning and 444.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 412.08ms. Allocated memory is still 499.1MB. Free memory was 444.8MB in the beginning and 427.4MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 797460.75ms. Allocated memory was 499.1MB in the beginning and 12.3GB in the end (delta: 11.8GB). Free memory was 426.7MB in the beginning and 8.2GB in the end (delta: -7.8GB). Peak memory consumption was 4.0GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 953]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was constructing initial abstraction,while executing CegarLoopForPetriNet. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 225 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.9s, OverallIterations: 7, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 149 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 149 mSDsluCounter, 143 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 127 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 351 IncrementalHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 35 mSDtfsCounter, 351 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 618 GetRequests, 515 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=472occurred in iteration=6, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 805 NumberOfCodeBlocks, 805 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1031 ConstructedInterpolants, 0 QuantifiedInterpolants, 3141 SizeOfPredicates, 22 NumberOfNonLiveVariables, 675 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 259/636 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, 283 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: 789.7s, OverallIterations: 19, TraceHistogramMax: 10, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 425.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5900 SdHoareTripleChecker+Valid, 7.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5900 mSDsluCounter, 7442 SdHoareTripleChecker+Invalid, 6.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 7283 IncrementalHoareTripleChecker+Unchecked, 7356 mSDsCounter, 792 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14300 IncrementalHoareTripleChecker+Invalid, 22375 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 792 mSolverCounterUnsat, 486 mSDtfsCounter, 14300 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4468 GetRequests, 3528 SyntacticMatches, 120 SemanticMatches, 819 ConstructedPredicates, 37 IntricatePredicates, 4 DeprecatedPredicates, 18620 ImplicationChecksByTransitivity, 526.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24495occurred in iteration=18, InterpolantAutomatonStates: 395, 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.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 358.7s InterpolantComputationTime, 4078 NumberOfCodeBlocks, 3953 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 5833 ConstructedInterpolants, 1216 QuantifiedInterpolants, 102816 SizeOfPredicates, 190 NumberOfNonLiveVariables, 3886 ConjunctsInSsa, 312 ConjunctsInUnsatCore, 48 InterpolantComputations, 5 PerfectInterpolantSequences, 7901/8895 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, 225 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.7s, OverallIterations: 6, TraceHistogramMax: 10, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 104 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 104 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 199 IncrementalHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 16 mSDtfsCounter, 199 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 474 GetRequests, 393 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=641occurred in iteration=5, InterpolantAutomatonStates: 65, 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, 1.0s InterpolantComputationTime, 610 NumberOfCodeBlocks, 610 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 704 ConstructedInterpolants, 0 QuantifiedInterpolants, 1054 SizeOfPredicates, 22 NumberOfNonLiveVariables, 458 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 55/448 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, 283 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: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, 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: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown