/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/pthread-ext/40_barrier_vf.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 04:31:18,327 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 04:31:18,328 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 04:31:18,386 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 04:31:18,386 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 04:31:18,387 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 04:31:18,387 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 04:31:18,389 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 04:31:18,390 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 04:31:18,390 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 04:31:18,391 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 04:31:18,392 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 04:31:18,392 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 04:31:18,392 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 04:31:18,393 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 04:31:18,394 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 04:31:18,394 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 04:31:18,399 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 04:31:18,403 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 04:31:18,404 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 04:31:18,407 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 04:31:18,410 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 04:31:18,411 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 04:31:18,412 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 04:31:18,421 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 04:31:18,422 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 04:31:18,422 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 04:31:18,422 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 04:31:18,423 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 04:31:18,423 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 04:31:18,423 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 04:31:18,424 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 04:31:18,424 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 04:31:18,424 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 04:31:18,425 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 04:31:18,425 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 04:31:18,425 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 04:31:18,426 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 04:31:18,426 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 04:31:18,426 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 04:31:18,427 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 04:31:18,429 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 04:31:18,453 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 04:31:18,453 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 04:31:18,454 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 04:31:18,454 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 04:31:18,454 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 04:31:18,454 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 04:31:18,454 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 04:31:18,454 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 04:31:18,454 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 04:31:18,455 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 04:31:18,455 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 04:31:18,455 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 04:31:18,455 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 04:31:18,455 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 04:31:18,455 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 04:31:18,456 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 04:31:18,456 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 04:31:18,456 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 04:31:18,456 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 04:31:18,456 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 04:31:18,456 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 04:31:18,456 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 04:31:18,456 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 04:31:18,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 04:31:18,456 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 04:31:18,456 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 04:31:18,456 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 04:31:18,457 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 04:31:18,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 04:31:18,457 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 04:31:18,458 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 04:31:18,458 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 04:31:18,458 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 04:31:18,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 04:31:18,645 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 04:31:18,647 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 04:31:18,648 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 04:31:18,648 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 04:31:18,649 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/40_barrier_vf.i [2022-01-19 04:31:18,694 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1875d6c68/91564fcf87ee4250a588a0d03450b87a/FLAGaee2ba863 [2022-01-19 04:31:19,058 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 04:31:19,058 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/40_barrier_vf.i [2022-01-19 04:31:19,077 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1875d6c68/91564fcf87ee4250a588a0d03450b87a/FLAGaee2ba863 [2022-01-19 04:31:19,471 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1875d6c68/91564fcf87ee4250a588a0d03450b87a [2022-01-19 04:31:19,472 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 04:31:19,473 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 04:31:19,476 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 04:31:19,476 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 04:31:19,478 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 04:31:19,479 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 04:31:19" (1/1) ... [2022-01-19 04:31:19,480 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c3370fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:31:19, skipping insertion in model container [2022-01-19 04:31:19,480 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 04:31:19" (1/1) ... [2022-01-19 04:31:19,485 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 04:31:19,531 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 04:31:19,689 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-01-19 04:31:19,798 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/40_barrier_vf.i[31163,31176] [2022-01-19 04:31:19,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 04:31:19,810 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 04:31:19,824 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-01-19 04:31:19,840 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/40_barrier_vf.i[31163,31176] [2022-01-19 04:31:19,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 04:31:19,869 INFO L208 MainTranslator]: Completed translation [2022-01-19 04:31:19,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:31:19 WrapperNode [2022-01-19 04:31:19,870 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 04:31:19,871 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 04:31:19,871 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 04:31:19,871 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 04:31:19,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:31:19" (1/1) ... [2022-01-19 04:31:19,896 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:31:19" (1/1) ... [2022-01-19 04:31:19,915 INFO L137 Inliner]: procedures = 174, calls = 25, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 78 [2022-01-19 04:31:19,916 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 04:31:19,916 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 04:31:19,916 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 04:31:19,916 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 04:31:19,921 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:31:19" (1/1) ... [2022-01-19 04:31:19,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:31:19" (1/1) ... [2022-01-19 04:31:19,926 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:31:19" (1/1) ... [2022-01-19 04:31:19,927 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:31:19" (1/1) ... [2022-01-19 04:31:19,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:31:19" (1/1) ... [2022-01-19 04:31:19,932 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:31:19" (1/1) ... [2022-01-19 04:31:19,933 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:31:19" (1/1) ... [2022-01-19 04:31:19,934 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 04:31:19,935 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 04:31:19,935 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 04:31:19,935 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 04:31:19,939 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:31:19" (1/1) ... [2022-01-19 04:31:19,944 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 04:31:19,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:31:19,967 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 04:31:19,973 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 04:31:19,989 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-01-19 04:31:19,989 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-01-19 04:31:19,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 04:31:19,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 04:31:19,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 04:31:19,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 04:31:19,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 04:31:19,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 04:31:19,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 04:31:19,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 04:31:19,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 04:31:19,991 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 04:31:20,083 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 04:31:20,087 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 04:31:20,202 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 04:31:20,232 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 04:31:20,232 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-19 04:31:20,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 04:31:20 BoogieIcfgContainer [2022-01-19 04:31:20,234 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 04:31:20,235 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 04:31:20,235 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 04:31:20,238 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 04:31:20,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 04:31:19" (1/3) ... [2022-01-19 04:31:20,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cfc88d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 04:31:20, skipping insertion in model container [2022-01-19 04:31:20,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:31:19" (2/3) ... [2022-01-19 04:31:20,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cfc88d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 04:31:20, skipping insertion in model container [2022-01-19 04:31:20,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 04:31:20" (3/3) ... [2022-01-19 04:31:20,240 INFO L111 eAbstractionObserver]: Analyzing ICFG 40_barrier_vf.i [2022-01-19 04:31:20,243 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 04:31:20,243 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 04:31:20,243 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 04:31:20,262 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,262 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,262 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,263 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,263 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,263 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,263 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,263 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,263 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,263 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,264 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,264 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,264 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,264 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,264 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,264 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,264 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,265 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,265 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,265 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,265 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,265 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,266 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,266 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,266 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,266 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,266 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,266 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,267 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,267 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,267 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,267 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,267 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,267 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,268 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,268 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,268 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,268 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,269 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,269 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,271 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,271 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,271 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,271 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,271 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,271 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,271 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,272 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-19 04:31:20,300 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 04:31:20,305 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 04:31:20,305 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-01-19 04:31:20,311 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 54 transitions, 113 flow [2022-01-19 04:31:20,330 INFO L129 PetriNetUnfolder]: 4/65 cut-off events. [2022-01-19 04:31:20,330 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 04:31:20,332 INFO L84 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 65 events. 4/65 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 36. Up to 4 conditions per place. [2022-01-19 04:31:20,333 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 54 transitions, 113 flow [2022-01-19 04:31:20,335 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 54 transitions, 113 flow [2022-01-19 04:31:20,344 INFO L129 PetriNetUnfolder]: 3/59 cut-off events. [2022-01-19 04:31:20,345 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 04:31:20,345 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:31:20,345 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] [2022-01-19 04:31:20,346 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:31:20,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:31:20,349 INFO L85 PathProgramCache]: Analyzing trace with hash -259697942, now seen corresponding path program 1 times [2022-01-19 04:31:20,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:31:20,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26597502] [2022-01-19 04:31:20,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:31:20,355 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:31:20,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:31:20,594 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 04:31:20,594 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:31:20,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26597502] [2022-01-19 04:31:20,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26597502] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:31:20,595 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:31:20,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 04:31:20,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627858870] [2022-01-19 04:31:20,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:31:20,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 04:31:20,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:31:20,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 04:31:20,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-19 04:31:20,631 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 54 [2022-01-19 04:31:20,633 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 54 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 0 states have call successors, (0), 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 04:31:20,633 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:31:20,633 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 54 [2022-01-19 04:31:20,634 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:31:20,699 INFO L129 PetriNetUnfolder]: 0/43 cut-off events. [2022-01-19 04:31:20,699 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 04:31:20,700 INFO L84 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 43 events. 0/43 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 13 event pairs, 0 based on Foata normal form. 13/56 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2022-01-19 04:31:20,701 INFO L132 encePairwiseOnDemand]: 45/54 looper letters, 8 selfloop transitions, 4 changer transitions 0/39 dead transitions. [2022-01-19 04:31:20,701 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 107 flow [2022-01-19 04:31:20,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 04:31:20,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 04:31:20,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 233 transitions. [2022-01-19 04:31:20,713 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7191358024691358 [2022-01-19 04:31:20,713 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 233 transitions. [2022-01-19 04:31:20,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 233 transitions. [2022-01-19 04:31:20,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:31:20,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 233 transitions. [2022-01-19 04:31:20,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 states have internal predecessors, (233), 0 states have call successors, (0), 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 04:31:20,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 54.0) internal successors, (378), 7 states have internal predecessors, (378), 0 states have call successors, (0), 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 04:31:20,729 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 54.0) internal successors, (378), 7 states have internal predecessors, (378), 0 states have call successors, (0), 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 04:31:20,730 INFO L186 Difference]: Start difference. First operand has 54 places, 54 transitions, 113 flow. Second operand 6 states and 233 transitions. [2022-01-19 04:31:20,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 107 flow [2022-01-19 04:31:20,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 39 transitions, 107 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 04:31:20,736 INFO L242 Difference]: Finished difference. Result has 47 places, 39 transitions, 91 flow [2022-01-19 04:31:20,738 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=91, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2022-01-19 04:31:20,741 INFO L334 CegarLoopForPetriNet]: 54 programPoint places, -7 predicate places. [2022-01-19 04:31:20,741 INFO L470 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 91 flow [2022-01-19 04:31:20,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 0 states have call successors, (0), 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 04:31:20,741 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:31:20,742 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] [2022-01-19 04:31:20,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 04:31:20,742 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:31:20,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:31:20,742 INFO L85 PathProgramCache]: Analyzing trace with hash -2096686393, now seen corresponding path program 1 times [2022-01-19 04:31:20,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:31:20,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459409891] [2022-01-19 04:31:20,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:31:20,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:31:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:31:20,837 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 04:31:20,838 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:31:20,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459409891] [2022-01-19 04:31:20,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459409891] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:31:20,838 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:31:20,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 04:31:20,838 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347219042] [2022-01-19 04:31:20,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:31:20,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 04:31:20,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:31:20,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 04:31:20,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 04:31:20,841 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 54 [2022-01-19 04:31:20,842 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 04:31:20,842 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:31:20,842 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 54 [2022-01-19 04:31:20,842 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:31:20,852 INFO L129 PetriNetUnfolder]: 0/37 cut-off events. [2022-01-19 04:31:20,852 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 04:31:20,852 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 37 events. 0/37 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 13 event pairs, 0 based on Foata normal form. 1/38 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2022-01-19 04:31:20,853 INFO L132 encePairwiseOnDemand]: 52/54 looper letters, 0 selfloop transitions, 0 changer transitions 33/33 dead transitions. [2022-01-19 04:31:20,853 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 33 transitions, 87 flow [2022-01-19 04:31:20,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 04:31:20,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 04:31:20,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2022-01-19 04:31:20,855 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7716049382716049 [2022-01-19 04:31:20,856 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 125 transitions. [2022-01-19 04:31:20,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 125 transitions. [2022-01-19 04:31:20,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:31:20,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 125 transitions. [2022-01-19 04:31:20,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 04:31:20,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 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 04:31:20,858 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 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 04:31:20,858 INFO L186 Difference]: Start difference. First operand has 47 places, 39 transitions, 91 flow. Second operand 3 states and 125 transitions. [2022-01-19 04:31:20,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 33 transitions, 87 flow [2022-01-19 04:31:20,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 33 transitions, 80 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-01-19 04:31:20,860 INFO L242 Difference]: Finished difference. Result has 39 places, 0 transitions, 0 flow [2022-01-19 04:31:20,860 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=39, PETRI_TRANSITIONS=0} [2022-01-19 04:31:20,860 INFO L334 CegarLoopForPetriNet]: 54 programPoint places, -15 predicate places. [2022-01-19 04:31:20,860 INFO L470 AbstractCegarLoop]: Abstraction has has 39 places, 0 transitions, 0 flow [2022-01-19 04:31:20,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 04:31:20,863 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-01-19 04:31:20,863 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-01-19 04:31:20,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 04:31:20,866 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-01-19 04:31:20,867 INFO L309 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE (1/2) [2022-01-19 04:31:20,875 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2022-01-19 04:31:20,879 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 04:31:20,879 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-19 04:31:20,883 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 54 transitions, 113 flow [2022-01-19 04:31:20,890 INFO L129 PetriNetUnfolder]: 4/65 cut-off events. [2022-01-19 04:31:20,890 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 04:31:20,891 INFO L84 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 65 events. 4/65 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 36. Up to 4 conditions per place. [2022-01-19 04:31:20,891 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 54 transitions, 113 flow [2022-01-19 04:31:20,891 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 54 transitions, 113 flow [2022-01-19 04:31:20,895 INFO L129 PetriNetUnfolder]: 2/47 cut-off events. [2022-01-19 04:31:20,895 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 04:31:20,895 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:31:20,895 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] [2022-01-19 04:31:20,896 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-19 04:31:20,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:31:20,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1260215165, now seen corresponding path program 1 times [2022-01-19 04:31:20,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:31:20,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492173331] [2022-01-19 04:31:20,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:31:20,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:31:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 04:31:20,911 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-19 04:31:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 04:31:20,932 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-19 04:31:20,932 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-19 04:31:20,932 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 1 remaining) [2022-01-19 04:31:20,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 04:31:20,933 INFO L732 BasicCegarLoop]: Path program histogram: [1] [2022-01-19 04:31:20,933 INFO L309 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2022-01-19 04:31:20,933 WARN L235 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-01-19 04:31:20,933 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-01-19 04:31:20,944 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,945 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,945 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,945 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,945 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,945 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,945 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,945 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,945 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,945 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,946 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,946 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,946 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,946 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,946 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,946 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,946 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,946 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,947 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,947 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,947 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,947 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,947 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,948 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,948 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,948 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,948 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,948 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,948 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,948 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,948 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,948 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,949 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,949 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,949 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,949 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,949 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,949 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,949 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,949 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,950 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,950 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,950 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,950 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,950 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,950 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,950 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,950 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,950 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,951 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,951 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,951 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,951 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,951 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,951 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,951 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,951 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,951 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,952 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,952 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,952 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,952 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,952 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,952 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,953 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,953 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,953 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,953 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,953 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,953 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,953 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,953 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,954 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,954 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,954 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,954 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,954 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,954 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,954 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,954 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,955 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,955 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,955 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,955 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,955 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,955 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,955 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,956 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,956 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,956 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,956 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,956 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,956 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,956 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:20,956 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-19 04:31:20,957 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 04:31:20,958 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 04:31:20,958 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-19 04:31:20,959 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 78 places, 78 transitions, 168 flow [2022-01-19 04:31:20,967 INFO L129 PetriNetUnfolder]: 7/102 cut-off events. [2022-01-19 04:31:20,968 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 04:31:20,968 INFO L84 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 7/102 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 191 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 66. Up to 6 conditions per place. [2022-01-19 04:31:20,968 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 78 transitions, 168 flow [2022-01-19 04:31:20,969 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 78 transitions, 168 flow [2022-01-19 04:31:20,975 INFO L129 PetriNetUnfolder]: 4/75 cut-off events. [2022-01-19 04:31:20,975 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 04:31:20,975 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:31:20,975 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] [2022-01-19 04:31:20,976 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:31:20,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:31:20,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1346439990, now seen corresponding path program 1 times [2022-01-19 04:31:20,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:31:20,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680588459] [2022-01-19 04:31:20,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:31:20,977 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:31:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:31:21,047 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 04:31:21,047 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:31:21,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680588459] [2022-01-19 04:31:21,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680588459] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:31:21,049 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:31:21,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 04:31:21,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898410294] [2022-01-19 04:31:21,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:31:21,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 04:31:21,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:31:21,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 04:31:21,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-19 04:31:21,052 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 78 [2022-01-19 04:31:21,053 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 78 transitions, 168 flow. Second operand has 5 states, 5 states have (on average 47.0) internal successors, (235), 5 states have internal predecessors, (235), 0 states have call successors, (0), 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 04:31:21,053 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:31:21,053 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 78 [2022-01-19 04:31:21,053 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:31:21,269 INFO L129 PetriNetUnfolder]: 191/585 cut-off events. [2022-01-19 04:31:21,269 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-01-19 04:31:21,272 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1047 conditions, 585 events. 191/585 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3421 event pairs, 26 based on Foata normal form. 290/850 useless extension candidates. Maximal degree in co-relation 931. Up to 168 conditions per place. [2022-01-19 04:31:21,275 INFO L132 encePairwiseOnDemand]: 63/78 looper letters, 67 selfloop transitions, 17 changer transitions 0/120 dead transitions. [2022-01-19 04:31:21,276 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 120 transitions, 435 flow [2022-01-19 04:31:21,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 04:31:21,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 04:31:21,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 434 transitions. [2022-01-19 04:31:21,278 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7948717948717948 [2022-01-19 04:31:21,278 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 434 transitions. [2022-01-19 04:31:21,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 434 transitions. [2022-01-19 04:31:21,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:31:21,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 434 transitions. [2022-01-19 04:31:21,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 62.0) internal successors, (434), 7 states have internal predecessors, (434), 0 states have call successors, (0), 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 04:31:21,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 78.0) internal successors, (624), 8 states have internal predecessors, (624), 0 states have call successors, (0), 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 04:31:21,281 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 78.0) internal successors, (624), 8 states have internal predecessors, (624), 0 states have call successors, (0), 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 04:31:21,281 INFO L186 Difference]: Start difference. First operand has 78 places, 78 transitions, 168 flow. Second operand 7 states and 434 transitions. [2022-01-19 04:31:21,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 120 transitions, 435 flow [2022-01-19 04:31:21,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 120 transitions, 433 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-01-19 04:31:21,290 INFO L242 Difference]: Finished difference. Result has 74 places, 77 transitions, 243 flow [2022-01-19 04:31:21,290 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=243, PETRI_PLACES=74, PETRI_TRANSITIONS=77} [2022-01-19 04:31:21,295 INFO L334 CegarLoopForPetriNet]: 78 programPoint places, -4 predicate places. [2022-01-19 04:31:21,296 INFO L470 AbstractCegarLoop]: Abstraction has has 74 places, 77 transitions, 243 flow [2022-01-19 04:31:21,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.0) internal successors, (235), 5 states have internal predecessors, (235), 0 states have call successors, (0), 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 04:31:21,296 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:31:21,296 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] [2022-01-19 04:31:21,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 04:31:21,296 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:31:21,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:31:21,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1516228935, now seen corresponding path program 1 times [2022-01-19 04:31:21,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:31:21,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664547225] [2022-01-19 04:31:21,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:31:21,297 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:31:21,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:31:21,332 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 04:31:21,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:31:21,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664547225] [2022-01-19 04:31:21,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664547225] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:31:21,333 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:31:21,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 04:31:21,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316077183] [2022-01-19 04:31:21,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:31:21,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 04:31:21,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:31:21,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 04:31:21,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 04:31:21,334 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 78 [2022-01-19 04:31:21,334 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 77 transitions, 243 flow. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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 04:31:21,334 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:31:21,334 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 78 [2022-01-19 04:31:21,334 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:31:21,373 INFO L129 PetriNetUnfolder]: 52/291 cut-off events. [2022-01-19 04:31:21,374 INFO L130 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2022-01-19 04:31:21,375 INFO L84 FinitePrefix]: Finished finitePrefix Result has 544 conditions, 291 events. 52/291 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1462 event pairs, 18 based on Foata normal form. 14/296 useless extension candidates. Maximal degree in co-relation 475. Up to 65 conditions per place. [2022-01-19 04:31:21,376 INFO L132 encePairwiseOnDemand]: 71/78 looper letters, 19 selfloop transitions, 5 changer transitions 0/84 dead transitions. [2022-01-19 04:31:21,376 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 84 transitions, 305 flow [2022-01-19 04:31:21,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 04:31:21,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 04:31:21,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2022-01-19 04:31:21,377 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7905982905982906 [2022-01-19 04:31:21,377 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 185 transitions. [2022-01-19 04:31:21,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 185 transitions. [2022-01-19 04:31:21,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:31:21,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 185 transitions. [2022-01-19 04:31:21,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 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 04:31:21,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 0 states have call successors, (0), 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 04:31:21,378 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 0 states have call successors, (0), 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 04:31:21,378 INFO L186 Difference]: Start difference. First operand has 74 places, 77 transitions, 243 flow. Second operand 3 states and 185 transitions. [2022-01-19 04:31:21,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 84 transitions, 305 flow [2022-01-19 04:31:21,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 84 transitions, 305 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 04:31:21,384 INFO L242 Difference]: Finished difference. Result has 77 places, 79 transitions, 270 flow [2022-01-19 04:31:21,384 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=77, PETRI_TRANSITIONS=79} [2022-01-19 04:31:21,385 INFO L334 CegarLoopForPetriNet]: 78 programPoint places, -1 predicate places. [2022-01-19 04:31:21,386 INFO L470 AbstractCegarLoop]: Abstraction has has 77 places, 79 transitions, 270 flow [2022-01-19 04:31:21,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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 04:31:21,386 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:31:21,386 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] [2022-01-19 04:31:21,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 04:31:21,386 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:31:21,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:31:21,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1486909128, now seen corresponding path program 1 times [2022-01-19 04:31:21,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:31:21,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976662029] [2022-01-19 04:31:21,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:31:21,387 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:31:21,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:31:21,463 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 04:31:21,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:31:21,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976662029] [2022-01-19 04:31:21,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976662029] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:31:21,463 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:31:21,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 04:31:21,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960657629] [2022-01-19 04:31:21,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:31:21,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 04:31:21,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:31:21,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 04:31:21,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-19 04:31:21,464 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 78 [2022-01-19 04:31:21,465 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 79 transitions, 270 flow. Second operand has 5 states, 5 states have (on average 47.2) internal successors, (236), 5 states have internal predecessors, (236), 0 states have call successors, (0), 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 04:31:21,465 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:31:21,465 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 78 [2022-01-19 04:31:21,465 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:31:21,566 INFO L129 PetriNetUnfolder]: 99/355 cut-off events. [2022-01-19 04:31:21,566 INFO L130 PetriNetUnfolder]: For 194/200 co-relation queries the response was YES. [2022-01-19 04:31:21,567 INFO L84 FinitePrefix]: Finished finitePrefix Result has 808 conditions, 355 events. 99/355 cut-off events. For 194/200 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1698 event pairs, 26 based on Foata normal form. 15/366 useless extension candidates. Maximal degree in co-relation 718. Up to 100 conditions per place. [2022-01-19 04:31:21,569 INFO L132 encePairwiseOnDemand]: 69/78 looper letters, 49 selfloop transitions, 13 changer transitions 11/115 dead transitions. [2022-01-19 04:31:21,569 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 115 transitions, 514 flow [2022-01-19 04:31:21,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 04:31:21,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 04:31:21,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 385 transitions. [2022-01-19 04:31:21,571 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7051282051282052 [2022-01-19 04:31:21,571 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 385 transitions. [2022-01-19 04:31:21,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 385 transitions. [2022-01-19 04:31:21,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:31:21,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 385 transitions. [2022-01-19 04:31:21,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 0 states have call successors, (0), 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 04:31:21,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 78.0) internal successors, (624), 8 states have internal predecessors, (624), 0 states have call successors, (0), 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 04:31:21,574 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 78.0) internal successors, (624), 8 states have internal predecessors, (624), 0 states have call successors, (0), 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 04:31:21,574 INFO L186 Difference]: Start difference. First operand has 77 places, 79 transitions, 270 flow. Second operand 7 states and 385 transitions. [2022-01-19 04:31:21,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 115 transitions, 514 flow [2022-01-19 04:31:21,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 115 transitions, 509 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 04:31:21,579 INFO L242 Difference]: Finished difference. Result has 86 places, 81 transitions, 316 flow [2022-01-19 04:31:21,580 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=316, PETRI_PLACES=86, PETRI_TRANSITIONS=81} [2022-01-19 04:31:21,581 INFO L334 CegarLoopForPetriNet]: 78 programPoint places, 8 predicate places. [2022-01-19 04:31:21,581 INFO L470 AbstractCegarLoop]: Abstraction has has 86 places, 81 transitions, 316 flow [2022-01-19 04:31:21,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.2) internal successors, (236), 5 states have internal predecessors, (236), 0 states have call successors, (0), 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 04:31:21,581 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:31:21,582 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] [2022-01-19 04:31:21,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 04:31:21,582 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:31:21,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:31:21,582 INFO L85 PathProgramCache]: Analyzing trace with hash -992181610, now seen corresponding path program 1 times [2022-01-19 04:31:21,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:31:21,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439213100] [2022-01-19 04:31:21,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:31:21,583 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:31:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:31:21,680 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 04:31:21,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:31:21,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439213100] [2022-01-19 04:31:21,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439213100] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:31:21,681 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:31:21,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:31:21,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493312096] [2022-01-19 04:31:21,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:31:21,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:31:21,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:31:21,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:31:21,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:31:21,686 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 78 [2022-01-19 04:31:21,686 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 81 transitions, 316 flow. Second operand has 7 states, 7 states have (on average 45.142857142857146) internal successors, (316), 7 states have internal predecessors, (316), 0 states have call successors, (0), 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 04:31:21,686 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:31:21,686 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 78 [2022-01-19 04:31:21,686 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:31:21,867 INFO L129 PetriNetUnfolder]: 98/320 cut-off events. [2022-01-19 04:31:21,867 INFO L130 PetriNetUnfolder]: For 395/400 co-relation queries the response was YES. [2022-01-19 04:31:21,868 INFO L84 FinitePrefix]: Finished finitePrefix Result has 829 conditions, 320 events. 98/320 cut-off events. For 395/400 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1326 event pairs, 29 based on Foata normal form. 10/326 useless extension candidates. Maximal degree in co-relation 719. Up to 86 conditions per place. [2022-01-19 04:31:21,869 INFO L132 encePairwiseOnDemand]: 67/78 looper letters, 41 selfloop transitions, 5 changer transitions 34/116 dead transitions. [2022-01-19 04:31:21,869 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 116 transitions, 569 flow [2022-01-19 04:31:21,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 04:31:21,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 04:31:21,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 597 transitions. [2022-01-19 04:31:21,871 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6378205128205128 [2022-01-19 04:31:21,871 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 597 transitions. [2022-01-19 04:31:21,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 597 transitions. [2022-01-19 04:31:21,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:31:21,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 597 transitions. [2022-01-19 04:31:21,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 49.75) internal successors, (597), 12 states have internal predecessors, (597), 0 states have call successors, (0), 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 04:31:21,874 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 78.0) internal successors, (1014), 13 states have internal predecessors, (1014), 0 states have call successors, (0), 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 04:31:21,874 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 78.0) internal successors, (1014), 13 states have internal predecessors, (1014), 0 states have call successors, (0), 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 04:31:21,874 INFO L186 Difference]: Start difference. First operand has 86 places, 81 transitions, 316 flow. Second operand 12 states and 597 transitions. [2022-01-19 04:31:21,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 116 transitions, 569 flow [2022-01-19 04:31:21,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 116 transitions, 547 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-01-19 04:31:21,878 INFO L242 Difference]: Finished difference. Result has 97 places, 70 transitions, 257 flow [2022-01-19 04:31:21,878 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=257, PETRI_PLACES=97, PETRI_TRANSITIONS=70} [2022-01-19 04:31:21,879 INFO L334 CegarLoopForPetriNet]: 78 programPoint places, 19 predicate places. [2022-01-19 04:31:21,879 INFO L470 AbstractCegarLoop]: Abstraction has has 97 places, 70 transitions, 257 flow [2022-01-19 04:31:21,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 45.142857142857146) internal successors, (316), 7 states have internal predecessors, (316), 0 states have call successors, (0), 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 04:31:21,879 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:31:21,879 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] [2022-01-19 04:31:21,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 04:31:21,879 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:31:21,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:31:21,880 INFO L85 PathProgramCache]: Analyzing trace with hash -188257909, now seen corresponding path program 1 times [2022-01-19 04:31:21,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:31:21,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237923188] [2022-01-19 04:31:21,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:31:21,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:31:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:31:21,938 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 04:31:21,939 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:31:21,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237923188] [2022-01-19 04:31:21,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237923188] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:31:21,939 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:31:21,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:31:21,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401289238] [2022-01-19 04:31:21,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:31:21,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:31:21,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:31:21,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:31:21,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:31:21,940 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 78 [2022-01-19 04:31:21,941 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 70 transitions, 257 flow. Second operand has 7 states, 7 states have (on average 45.142857142857146) internal successors, (316), 7 states have internal predecessors, (316), 0 states have call successors, (0), 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 04:31:21,941 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:31:21,941 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 78 [2022-01-19 04:31:21,941 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:31:22,037 INFO L129 PetriNetUnfolder]: 31/115 cut-off events. [2022-01-19 04:31:22,038 INFO L130 PetriNetUnfolder]: For 138/138 co-relation queries the response was YES. [2022-01-19 04:31:22,038 INFO L84 FinitePrefix]: Finished finitePrefix Result has 267 conditions, 115 events. 31/115 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 225 event pairs, 6 based on Foata normal form. 8/121 useless extension candidates. Maximal degree in co-relation 252. Up to 19 conditions per place. [2022-01-19 04:31:22,038 INFO L132 encePairwiseOnDemand]: 69/78 looper letters, 0 selfloop transitions, 0 changer transitions 63/63 dead transitions. [2022-01-19 04:31:22,038 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 63 transitions, 255 flow [2022-01-19 04:31:22,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 04:31:22,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 04:31:22,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 557 transitions. [2022-01-19 04:31:22,040 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5950854700854701 [2022-01-19 04:31:22,040 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 557 transitions. [2022-01-19 04:31:22,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 557 transitions. [2022-01-19 04:31:22,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:31:22,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 557 transitions. [2022-01-19 04:31:22,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 46.416666666666664) internal successors, (557), 12 states have internal predecessors, (557), 0 states have call successors, (0), 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 04:31:22,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 78.0) internal successors, (1014), 13 states have internal predecessors, (1014), 0 states have call successors, (0), 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 04:31:22,043 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 78.0) internal successors, (1014), 13 states have internal predecessors, (1014), 0 states have call successors, (0), 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 04:31:22,043 INFO L186 Difference]: Start difference. First operand has 97 places, 70 transitions, 257 flow. Second operand 12 states and 557 transitions. [2022-01-19 04:31:22,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 63 transitions, 255 flow [2022-01-19 04:31:22,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 63 transitions, 222 flow, removed 2 selfloop flow, removed 12 redundant places. [2022-01-19 04:31:22,045 INFO L242 Difference]: Finished difference. Result has 67 places, 0 transitions, 0 flow [2022-01-19 04:31:22,045 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=0, PETRI_PLACES=67, PETRI_TRANSITIONS=0} [2022-01-19 04:31:22,046 INFO L334 CegarLoopForPetriNet]: 78 programPoint places, -11 predicate places. [2022-01-19 04:31:22,046 INFO L470 AbstractCegarLoop]: Abstraction has has 67 places, 0 transitions, 0 flow [2022-01-19 04:31:22,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 45.142857142857146) internal successors, (316), 7 states have internal predecessors, (316), 0 states have call successors, (0), 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 04:31:22,046 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-01-19 04:31:22,046 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2022-01-19 04:31:22,047 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2022-01-19 04:31:22,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 04:31:22,047 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-01-19 04:31:22,047 INFO L309 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2022-01-19 04:31:22,049 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2022-01-19 04:31:22,050 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 04:31:22,050 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-19 04:31:22,053 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 78 places, 78 transitions, 168 flow [2022-01-19 04:31:22,062 INFO L129 PetriNetUnfolder]: 7/102 cut-off events. [2022-01-19 04:31:22,062 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 04:31:22,063 INFO L84 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 7/102 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 191 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 66. Up to 6 conditions per place. [2022-01-19 04:31:22,063 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 78 transitions, 168 flow [2022-01-19 04:31:22,064 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 78 transitions, 168 flow [2022-01-19 04:31:22,071 INFO L129 PetriNetUnfolder]: 5/83 cut-off events. [2022-01-19 04:31:22,071 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 04:31:22,071 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:31:22,071 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:31:22,071 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-19 04:31:22,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:31:22,072 INFO L85 PathProgramCache]: Analyzing trace with hash -205340232, now seen corresponding path program 1 times [2022-01-19 04:31:22,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:31:22,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189923392] [2022-01-19 04:31:22,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:31:22,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:31:22,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 04:31:22,080 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-19 04:31:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 04:31:22,093 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-19 04:31:22,093 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-19 04:31:22,093 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 1 remaining) [2022-01-19 04:31:22,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 04:31:22,094 INFO L732 BasicCegarLoop]: Path program histogram: [1] [2022-01-19 04:31:22,094 INFO L309 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2022-01-19 04:31:22,094 WARN L235 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-01-19 04:31:22,094 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-01-19 04:31:22,107 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,108 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,108 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,108 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,108 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,108 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,108 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,108 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,108 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,108 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,108 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,109 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,109 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,109 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,109 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,109 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,109 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,109 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,109 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,109 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,110 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,110 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,110 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,110 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,110 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,110 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,110 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,110 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,110 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,110 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,111 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,111 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,111 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,111 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,111 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,111 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,111 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,111 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,111 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,111 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,113 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,113 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,113 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,113 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,113 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,113 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,114 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,114 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,114 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,114 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,114 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,114 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,114 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,114 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,114 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,114 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,114 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,114 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,115 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,115 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,115 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,115 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,115 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,115 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,115 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,115 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,115 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,115 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,116 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,116 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,116 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,116 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,116 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,116 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,116 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,116 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,116 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,116 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,117 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,117 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,117 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,117 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,117 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,117 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,117 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,117 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,118 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,118 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,118 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,118 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,118 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,118 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,119 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,119 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,119 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,120 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,120 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,120 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,120 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,120 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,120 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,120 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,120 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,120 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,120 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,120 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,123 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,123 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,124 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,124 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,124 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,124 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,124 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,124 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,124 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,124 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,124 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,124 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,124 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,124 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,126 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,126 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,126 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,126 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,126 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,126 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,126 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,127 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,127 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,127 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,127 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,127 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,127 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,127 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,128 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,128 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,128 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,128 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,128 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,128 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,128 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:22,128 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-19 04:31:22,129 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 04:31:22,130 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 04:31:22,130 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-19 04:31:22,130 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 102 transitions, 225 flow [2022-01-19 04:31:22,139 INFO L129 PetriNetUnfolder]: 10/139 cut-off events. [2022-01-19 04:31:22,140 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-01-19 04:31:22,140 INFO L84 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 139 events. 10/139 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 315 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 106. Up to 8 conditions per place. [2022-01-19 04:31:22,140 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 102 transitions, 225 flow [2022-01-19 04:31:22,141 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 102 transitions, 225 flow [2022-01-19 04:31:22,144 INFO L129 PetriNetUnfolder]: 4/74 cut-off events. [2022-01-19 04:31:22,144 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 04:31:22,145 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:31:22,145 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] [2022-01-19 04:31:22,145 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:31:22,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:31:22,145 INFO L85 PathProgramCache]: Analyzing trace with hash -235705645, now seen corresponding path program 1 times [2022-01-19 04:31:22,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:31:22,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799383082] [2022-01-19 04:31:22,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:31:22,145 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:31:22,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:31:22,210 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 04:31:22,210 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:31:22,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799383082] [2022-01-19 04:31:22,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799383082] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:31:22,210 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:31:22,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 04:31:22,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902850514] [2022-01-19 04:31:22,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:31:22,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 04:31:22,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:31:22,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 04:31:22,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-19 04:31:22,211 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 102 [2022-01-19 04:31:22,212 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 102 transitions, 225 flow. Second operand has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 0 states have call successors, (0), 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 04:31:22,212 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:31:22,212 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 102 [2022-01-19 04:31:22,212 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:31:23,120 INFO L129 PetriNetUnfolder]: 5046/10012 cut-off events. [2022-01-19 04:31:23,120 INFO L130 PetriNetUnfolder]: For 1432/1432 co-relation queries the response was YES. [2022-01-19 04:31:23,138 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18914 conditions, 10012 events. 5046/10012 cut-off events. For 1432/1432 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 87022 event pairs, 964 based on Foata normal form. 3867/13423 useless extension candidates. Maximal degree in co-relation 8026. Up to 3530 conditions per place. [2022-01-19 04:31:23,183 INFO L132 encePairwiseOnDemand]: 82/102 looper letters, 132 selfloop transitions, 25 changer transitions 0/201 dead transitions. [2022-01-19 04:31:23,183 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 201 transitions, 787 flow [2022-01-19 04:31:23,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 04:31:23,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 04:31:23,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 594 transitions. [2022-01-19 04:31:23,184 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8319327731092437 [2022-01-19 04:31:23,184 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 594 transitions. [2022-01-19 04:31:23,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 594 transitions. [2022-01-19 04:31:23,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:31:23,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 594 transitions. [2022-01-19 04:31:23,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 84.85714285714286) internal successors, (594), 7 states have internal predecessors, (594), 0 states have call successors, (0), 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 04:31:23,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 102.0) internal successors, (816), 8 states have internal predecessors, (816), 0 states have call successors, (0), 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 04:31:23,187 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 102.0) internal successors, (816), 8 states have internal predecessors, (816), 0 states have call successors, (0), 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 04:31:23,187 INFO L186 Difference]: Start difference. First operand has 102 places, 102 transitions, 225 flow. Second operand 7 states and 594 transitions. [2022-01-19 04:31:23,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 201 transitions, 787 flow [2022-01-19 04:31:23,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 201 transitions, 771 flow, removed 8 selfloop flow, removed 0 redundant places. [2022-01-19 04:31:23,190 INFO L242 Difference]: Finished difference. Result has 95 places, 109 transitions, 371 flow [2022-01-19 04:31:23,190 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=371, PETRI_PLACES=95, PETRI_TRANSITIONS=109} [2022-01-19 04:31:23,190 INFO L334 CegarLoopForPetriNet]: 102 programPoint places, -7 predicate places. [2022-01-19 04:31:23,190 INFO L470 AbstractCegarLoop]: Abstraction has has 95 places, 109 transitions, 371 flow [2022-01-19 04:31:23,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 0 states have call successors, (0), 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 04:31:23,191 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:31:23,191 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] [2022-01-19 04:31:23,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 04:31:23,191 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:31:23,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:31:23,191 INFO L85 PathProgramCache]: Analyzing trace with hash -514918960, now seen corresponding path program 1 times [2022-01-19 04:31:23,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:31:23,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006591585] [2022-01-19 04:31:23,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:31:23,191 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:31:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:31:23,224 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 04:31:23,225 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:31:23,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006591585] [2022-01-19 04:31:23,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006591585] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:31:23,225 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:31:23,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 04:31:23,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854674971] [2022-01-19 04:31:23,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:31:23,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 04:31:23,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:31:23,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 04:31:23,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 04:31:23,226 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 102 [2022-01-19 04:31:23,226 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 109 transitions, 371 flow. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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 04:31:23,226 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:31:23,226 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 102 [2022-01-19 04:31:23,226 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:31:23,660 INFO L129 PetriNetUnfolder]: 1981/4991 cut-off events. [2022-01-19 04:31:23,660 INFO L130 PetriNetUnfolder]: For 1074/1132 co-relation queries the response was YES. [2022-01-19 04:31:23,675 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9854 conditions, 4991 events. 1981/4991 cut-off events. For 1074/1132 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 47338 event pairs, 666 based on Foata normal form. 194/4904 useless extension candidates. Maximal degree in co-relation 9782. Up to 1572 conditions per place. [2022-01-19 04:31:23,735 INFO L132 encePairwiseOnDemand]: 92/102 looper letters, 37 selfloop transitions, 7 changer transitions 0/128 dead transitions. [2022-01-19 04:31:23,735 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 128 transitions, 502 flow [2022-01-19 04:31:23,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 04:31:23,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 04:31:23,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2022-01-19 04:31:23,738 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8006535947712419 [2022-01-19 04:31:23,738 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 245 transitions. [2022-01-19 04:31:23,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 245 transitions. [2022-01-19 04:31:23,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:31:23,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 245 transitions. [2022-01-19 04:31:23,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 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 04:31:23,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 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 04:31:23,740 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 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 04:31:23,740 INFO L186 Difference]: Start difference. First operand has 95 places, 109 transitions, 371 flow. Second operand 3 states and 245 transitions. [2022-01-19 04:31:23,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 128 transitions, 502 flow [2022-01-19 04:31:23,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 128 transitions, 502 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 04:31:23,744 INFO L242 Difference]: Finished difference. Result has 99 places, 115 transitions, 429 flow [2022-01-19 04:31:23,744 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=429, PETRI_PLACES=99, PETRI_TRANSITIONS=115} [2022-01-19 04:31:23,745 INFO L334 CegarLoopForPetriNet]: 102 programPoint places, -3 predicate places. [2022-01-19 04:31:23,745 INFO L470 AbstractCegarLoop]: Abstraction has has 99 places, 115 transitions, 429 flow [2022-01-19 04:31:23,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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 04:31:23,745 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:31:23,745 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] [2022-01-19 04:31:23,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 04:31:23,745 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:31:23,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:31:23,746 INFO L85 PathProgramCache]: Analyzing trace with hash 2097732028, now seen corresponding path program 1 times [2022-01-19 04:31:23,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:31:23,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322333926] [2022-01-19 04:31:23,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:31:23,746 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:31:23,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:31:23,787 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 04:31:23,788 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:31:23,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322333926] [2022-01-19 04:31:23,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322333926] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:31:23,788 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:31:23,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 04:31:23,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897050697] [2022-01-19 04:31:23,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:31:23,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 04:31:23,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:31:23,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 04:31:23,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-19 04:31:23,789 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 102 [2022-01-19 04:31:23,789 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 115 transitions, 429 flow. Second operand has 5 states, 5 states have (on average 57.2) internal successors, (286), 5 states have internal predecessors, (286), 0 states have call successors, (0), 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 04:31:23,789 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:31:23,789 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 102 [2022-01-19 04:31:23,789 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:31:24,776 INFO L129 PetriNetUnfolder]: 5383/11464 cut-off events. [2022-01-19 04:31:24,776 INFO L130 PetriNetUnfolder]: For 9255/9398 co-relation queries the response was YES. [2022-01-19 04:31:24,812 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27706 conditions, 11464 events. 5383/11464 cut-off events. For 9255/9398 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 106259 event pairs, 1358 based on Foata normal form. 310/11657 useless extension candidates. Maximal degree in co-relation 27612. Up to 3984 conditions per place. [2022-01-19 04:31:24,857 INFO L132 encePairwiseOnDemand]: 90/102 looper letters, 142 selfloop transitions, 49 changer transitions 0/245 dead transitions. [2022-01-19 04:31:24,857 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 245 transitions, 1257 flow [2022-01-19 04:31:24,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 04:31:24,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 04:31:24,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 545 transitions. [2022-01-19 04:31:24,859 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7633053221288515 [2022-01-19 04:31:24,859 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 545 transitions. [2022-01-19 04:31:24,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 545 transitions. [2022-01-19 04:31:24,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:31:24,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 545 transitions. [2022-01-19 04:31:24,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 77.85714285714286) internal successors, (545), 7 states have internal predecessors, (545), 0 states have call successors, (0), 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 04:31:24,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 102.0) internal successors, (816), 8 states have internal predecessors, (816), 0 states have call successors, (0), 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 04:31:24,861 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 102.0) internal successors, (816), 8 states have internal predecessors, (816), 0 states have call successors, (0), 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 04:31:24,861 INFO L186 Difference]: Start difference. First operand has 99 places, 115 transitions, 429 flow. Second operand 7 states and 545 transitions. [2022-01-19 04:31:24,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 245 transitions, 1257 flow [2022-01-19 04:31:24,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 245 transitions, 1243 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 04:31:24,875 INFO L242 Difference]: Finished difference. Result has 107 places, 149 transitions, 772 flow [2022-01-19 04:31:24,876 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=772, PETRI_PLACES=107, PETRI_TRANSITIONS=149} [2022-01-19 04:31:24,876 INFO L334 CegarLoopForPetriNet]: 102 programPoint places, 5 predicate places. [2022-01-19 04:31:24,876 INFO L470 AbstractCegarLoop]: Abstraction has has 107 places, 149 transitions, 772 flow [2022-01-19 04:31:24,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.2) internal successors, (286), 5 states have internal predecessors, (286), 0 states have call successors, (0), 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 04:31:24,876 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:31:24,877 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] [2022-01-19 04:31:24,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-19 04:31:24,877 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:31:24,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:31:24,877 INFO L85 PathProgramCache]: Analyzing trace with hash 263717428, now seen corresponding path program 1 times [2022-01-19 04:31:24,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:31:24,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426051664] [2022-01-19 04:31:24,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:31:24,877 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:31:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:31:24,929 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 04:31:24,929 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:31:24,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426051664] [2022-01-19 04:31:24,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426051664] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:31:24,929 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:31:24,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:31:24,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426896340] [2022-01-19 04:31:24,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:31:24,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:31:24,929 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:31:24,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:31:24,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:31:24,930 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 102 [2022-01-19 04:31:24,930 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 149 transitions, 772 flow. Second operand has 7 states, 7 states have (on average 55.142857142857146) internal successors, (386), 7 states have internal predecessors, (386), 0 states have call successors, (0), 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 04:31:24,930 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:31:24,930 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 102 [2022-01-19 04:31:24,931 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:31:26,237 INFO L129 PetriNetUnfolder]: 6820/13979 cut-off events. [2022-01-19 04:31:26,238 INFO L130 PetriNetUnfolder]: For 24237/24406 co-relation queries the response was YES. [2022-01-19 04:31:26,280 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38266 conditions, 13979 events. 6820/13979 cut-off events. For 24237/24406 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 129584 event pairs, 1364 based on Foata normal form. 221/14041 useless extension candidates. Maximal degree in co-relation 26112. Up to 4539 conditions per place. [2022-01-19 04:31:26,422 INFO L132 encePairwiseOnDemand]: 88/102 looper letters, 242 selfloop transitions, 82 changer transitions 8/380 dead transitions. [2022-01-19 04:31:26,422 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 380 transitions, 2263 flow [2022-01-19 04:31:26,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 04:31:26,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 04:31:26,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1205 transitions. [2022-01-19 04:31:26,425 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6949250288350635 [2022-01-19 04:31:26,425 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1205 transitions. [2022-01-19 04:31:26,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1205 transitions. [2022-01-19 04:31:26,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:31:26,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1205 transitions. [2022-01-19 04:31:26,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 70.88235294117646) internal successors, (1205), 17 states have internal predecessors, (1205), 0 states have call successors, (0), 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 04:31:26,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 102.0) internal successors, (1836), 18 states have internal predecessors, (1836), 0 states have call successors, (0), 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 04:31:26,430 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 102.0) internal successors, (1836), 18 states have internal predecessors, (1836), 0 states have call successors, (0), 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 04:31:26,430 INFO L186 Difference]: Start difference. First operand has 107 places, 149 transitions, 772 flow. Second operand 17 states and 1205 transitions. [2022-01-19 04:31:26,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 380 transitions, 2263 flow [2022-01-19 04:31:26,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 380 transitions, 2263 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 04:31:26,470 INFO L242 Difference]: Finished difference. Result has 133 places, 184 transitions, 1278 flow [2022-01-19 04:31:26,470 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1278, PETRI_PLACES=133, PETRI_TRANSITIONS=184} [2022-01-19 04:31:26,471 INFO L334 CegarLoopForPetriNet]: 102 programPoint places, 31 predicate places. [2022-01-19 04:31:26,471 INFO L470 AbstractCegarLoop]: Abstraction has has 133 places, 184 transitions, 1278 flow [2022-01-19 04:31:26,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 55.142857142857146) internal successors, (386), 7 states have internal predecessors, (386), 0 states have call successors, (0), 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 04:31:26,471 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:31:26,471 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] [2022-01-19 04:31:26,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 04:31:26,472 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:31:26,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:31:26,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1522265153, now seen corresponding path program 1 times [2022-01-19 04:31:26,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:31:26,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713150095] [2022-01-19 04:31:26,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:31:26,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:31:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:31:26,522 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 04:31:26,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:31:26,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713150095] [2022-01-19 04:31:26,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713150095] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:31:26,522 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:31:26,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:31:26,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660823812] [2022-01-19 04:31:26,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:31:26,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:31:26,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:31:26,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:31:26,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:31:26,524 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 102 [2022-01-19 04:31:26,524 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 184 transitions, 1278 flow. Second operand has 7 states, 7 states have (on average 55.142857142857146) internal successors, (386), 7 states have internal predecessors, (386), 0 states have call successors, (0), 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 04:31:26,524 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:31:26,524 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 102 [2022-01-19 04:31:26,524 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:31:28,174 INFO L129 PetriNetUnfolder]: 7207/14700 cut-off events. [2022-01-19 04:31:28,174 INFO L130 PetriNetUnfolder]: For 45605/45767 co-relation queries the response was YES. [2022-01-19 04:31:28,223 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45631 conditions, 14700 events. 7207/14700 cut-off events. For 45605/45767 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 136439 event pairs, 1555 based on Foata normal form. 234/14839 useless extension candidates. Maximal degree in co-relation 45502. Up to 5266 conditions per place. [2022-01-19 04:31:28,279 INFO L132 encePairwiseOnDemand]: 88/102 looper letters, 265 selfloop transitions, 98 changer transitions 8/419 dead transitions. [2022-01-19 04:31:28,279 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 419 transitions, 2972 flow [2022-01-19 04:31:28,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 04:31:28,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 04:31:28,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1203 transitions. [2022-01-19 04:31:28,282 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6937716262975778 [2022-01-19 04:31:28,282 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1203 transitions. [2022-01-19 04:31:28,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1203 transitions. [2022-01-19 04:31:28,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:31:28,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1203 transitions. [2022-01-19 04:31:28,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 70.76470588235294) internal successors, (1203), 17 states have internal predecessors, (1203), 0 states have call successors, (0), 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 04:31:28,286 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 102.0) internal successors, (1836), 18 states have internal predecessors, (1836), 0 states have call successors, (0), 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 04:31:28,287 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 102.0) internal successors, (1836), 18 states have internal predecessors, (1836), 0 states have call successors, (0), 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 04:31:28,287 INFO L186 Difference]: Start difference. First operand has 133 places, 184 transitions, 1278 flow. Second operand 17 states and 1203 transitions. [2022-01-19 04:31:28,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 419 transitions, 2972 flow [2022-01-19 04:31:28,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 419 transitions, 2892 flow, removed 24 selfloop flow, removed 2 redundant places. [2022-01-19 04:31:28,371 INFO L242 Difference]: Finished difference. Result has 157 places, 219 transitions, 1788 flow [2022-01-19 04:31:28,371 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=1203, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1788, PETRI_PLACES=157, PETRI_TRANSITIONS=219} [2022-01-19 04:31:28,371 INFO L334 CegarLoopForPetriNet]: 102 programPoint places, 55 predicate places. [2022-01-19 04:31:28,371 INFO L470 AbstractCegarLoop]: Abstraction has has 157 places, 219 transitions, 1788 flow [2022-01-19 04:31:28,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 55.142857142857146) internal successors, (386), 7 states have internal predecessors, (386), 0 states have call successors, (0), 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 04:31:28,372 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:31:28,372 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 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] [2022-01-19 04:31:28,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-19 04:31:28,372 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:31:28,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:31:28,372 INFO L85 PathProgramCache]: Analyzing trace with hash 2100624731, now seen corresponding path program 1 times [2022-01-19 04:31:28,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:31:28,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938411999] [2022-01-19 04:31:28,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:31:28,373 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:31:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:31:28,424 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-01-19 04:31:28,424 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:31:28,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938411999] [2022-01-19 04:31:28,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938411999] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:31:28,424 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:31:28,424 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 04:31:28,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135373558] [2022-01-19 04:31:28,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:31:28,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 04:31:28,425 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:31:28,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 04:31:28,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-19 04:31:28,426 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 102 [2022-01-19 04:31:28,427 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 219 transitions, 1788 flow. Second operand has 5 states, 5 states have (on average 57.4) internal successors, (287), 5 states have internal predecessors, (287), 0 states have call successors, (0), 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 04:31:28,427 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:31:28,427 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 102 [2022-01-19 04:31:28,427 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:31:29,957 INFO L129 PetriNetUnfolder]: 6542/14161 cut-off events. [2022-01-19 04:31:29,957 INFO L130 PetriNetUnfolder]: For 68591/68824 co-relation queries the response was YES. [2022-01-19 04:31:30,032 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46513 conditions, 14161 events. 6542/14161 cut-off events. For 68591/68824 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 135899 event pairs, 2096 based on Foata normal form. 270/14289 useless extension candidates. Maximal degree in co-relation 46386. Up to 6396 conditions per place. [2022-01-19 04:31:30,093 INFO L132 encePairwiseOnDemand]: 90/102 looper letters, 161 selfloop transitions, 89 changer transitions 33/363 dead transitions. [2022-01-19 04:31:30,093 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 363 transitions, 3306 flow [2022-01-19 04:31:30,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 04:31:30,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 04:31:30,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 521 transitions. [2022-01-19 04:31:30,209 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7296918767507002 [2022-01-19 04:31:30,209 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 521 transitions. [2022-01-19 04:31:30,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 521 transitions. [2022-01-19 04:31:30,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:31:30,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 521 transitions. [2022-01-19 04:31:30,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 74.42857142857143) internal successors, (521), 7 states have internal predecessors, (521), 0 states have call successors, (0), 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 04:31:30,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 102.0) internal successors, (816), 8 states have internal predecessors, (816), 0 states have call successors, (0), 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 04:31:30,211 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 102.0) internal successors, (816), 8 states have internal predecessors, (816), 0 states have call successors, (0), 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 04:31:30,211 INFO L186 Difference]: Start difference. First operand has 157 places, 219 transitions, 1788 flow. Second operand 7 states and 521 transitions. [2022-01-19 04:31:30,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 363 transitions, 3306 flow [2022-01-19 04:31:30,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 363 transitions, 3076 flow, removed 55 selfloop flow, removed 4 redundant places. [2022-01-19 04:31:30,368 INFO L242 Difference]: Finished difference. Result has 163 places, 250 transitions, 2295 flow [2022-01-19 04:31:30,368 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=1599, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2295, PETRI_PLACES=163, PETRI_TRANSITIONS=250} [2022-01-19 04:31:30,369 INFO L334 CegarLoopForPetriNet]: 102 programPoint places, 61 predicate places. [2022-01-19 04:31:30,369 INFO L470 AbstractCegarLoop]: Abstraction has has 163 places, 250 transitions, 2295 flow [2022-01-19 04:31:30,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.4) internal successors, (287), 5 states have internal predecessors, (287), 0 states have call successors, (0), 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 04:31:30,369 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:31:30,369 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 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] [2022-01-19 04:31:30,369 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-19 04:31:30,369 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:31:30,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:31:30,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1308060547, now seen corresponding path program 1 times [2022-01-19 04:31:30,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:31:30,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951362815] [2022-01-19 04:31:30,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:31:30,370 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:31:30,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:31:30,420 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-01-19 04:31:30,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:31:30,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951362815] [2022-01-19 04:31:30,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951362815] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:31:30,421 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:31:30,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:31:30,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295479278] [2022-01-19 04:31:30,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:31:30,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:31:30,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:31:30,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:31:30,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:31:30,422 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 102 [2022-01-19 04:31:30,422 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 250 transitions, 2295 flow. Second operand has 7 states, 7 states have (on average 55.285714285714285) internal successors, (387), 7 states have internal predecessors, (387), 0 states have call successors, (0), 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 04:31:30,422 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:31:30,422 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 102 [2022-01-19 04:31:30,422 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:31:32,294 INFO L129 PetriNetUnfolder]: 6874/14415 cut-off events. [2022-01-19 04:31:32,294 INFO L130 PetriNetUnfolder]: For 83649/83863 co-relation queries the response was YES. [2022-01-19 04:31:32,356 INFO L84 FinitePrefix]: Finished finitePrefix Result has 49993 conditions, 14415 events. 6874/14415 cut-off events. For 83649/83863 co-relation queries the response was YES. Maximal size of possible extension queue 587. Compared 133191 event pairs, 1752 based on Foata normal form. 228/14522 useless extension candidates. Maximal degree in co-relation 49839. Up to 5613 conditions per place. [2022-01-19 04:31:32,404 INFO L132 encePairwiseOnDemand]: 88/102 looper letters, 237 selfloop transitions, 103 changer transitions 41/444 dead transitions. [2022-01-19 04:31:32,405 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 444 transitions, 3841 flow [2022-01-19 04:31:32,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 04:31:32,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 04:31:32,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1164 transitions. [2022-01-19 04:31:32,407 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.671280276816609 [2022-01-19 04:31:32,407 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1164 transitions. [2022-01-19 04:31:32,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1164 transitions. [2022-01-19 04:31:32,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:31:32,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1164 transitions. [2022-01-19 04:31:32,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 68.47058823529412) internal successors, (1164), 17 states have internal predecessors, (1164), 0 states have call successors, (0), 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 04:31:32,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 102.0) internal successors, (1836), 18 states have internal predecessors, (1836), 0 states have call successors, (0), 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 04:31:32,411 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 102.0) internal successors, (1836), 18 states have internal predecessors, (1836), 0 states have call successors, (0), 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 04:31:32,411 INFO L186 Difference]: Start difference. First operand has 163 places, 250 transitions, 2295 flow. Second operand 17 states and 1164 transitions. [2022-01-19 04:31:32,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 444 transitions, 3841 flow [2022-01-19 04:31:32,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 444 transitions, 3803 flow, removed 19 selfloop flow, removed 0 redundant places. [2022-01-19 04:31:32,577 INFO L242 Difference]: Finished difference. Result has 189 places, 255 transitions, 2519 flow [2022-01-19 04:31:32,578 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=2076, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2519, PETRI_PLACES=189, PETRI_TRANSITIONS=255} [2022-01-19 04:31:32,578 INFO L334 CegarLoopForPetriNet]: 102 programPoint places, 87 predicate places. [2022-01-19 04:31:32,578 INFO L470 AbstractCegarLoop]: Abstraction has has 189 places, 255 transitions, 2519 flow [2022-01-19 04:31:32,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 55.285714285714285) internal successors, (387), 7 states have internal predecessors, (387), 0 states have call successors, (0), 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 04:31:32,578 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:31:32,579 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 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] [2022-01-19 04:31:32,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-19 04:31:32,579 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:31:32,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:31:32,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1780779004, now seen corresponding path program 1 times [2022-01-19 04:31:32,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:31:32,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990841583] [2022-01-19 04:31:32,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:31:32,579 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:31:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:31:32,636 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-01-19 04:31:32,636 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:31:32,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990841583] [2022-01-19 04:31:32,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990841583] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:31:32,637 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:31:32,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:31:32,637 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052271821] [2022-01-19 04:31:32,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:31:32,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:31:32,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:31:32,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:31:32,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:31:32,638 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 102 [2022-01-19 04:31:32,638 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 255 transitions, 2519 flow. Second operand has 7 states, 7 states have (on average 55.285714285714285) internal successors, (387), 7 states have internal predecessors, (387), 0 states have call successors, (0), 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 04:31:32,638 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:31:32,638 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 102 [2022-01-19 04:31:32,638 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:31:34,650 INFO L129 PetriNetUnfolder]: 6552/13638 cut-off events. [2022-01-19 04:31:34,651 INFO L130 PetriNetUnfolder]: For 115992/116122 co-relation queries the response was YES. [2022-01-19 04:31:34,723 INFO L84 FinitePrefix]: Finished finitePrefix Result has 51280 conditions, 13638 events. 6552/13638 cut-off events. For 115992/116122 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 124227 event pairs, 1833 based on Foata normal form. 261/13803 useless extension candidates. Maximal degree in co-relation 51116. Up to 5678 conditions per place. [2022-01-19 04:31:34,769 INFO L132 encePairwiseOnDemand]: 88/102 looper letters, 262 selfloop transitions, 98 changer transitions 44/467 dead transitions. [2022-01-19 04:31:34,769 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 467 transitions, 4522 flow [2022-01-19 04:31:34,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 04:31:34,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 04:31:34,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1166 transitions. [2022-01-19 04:31:34,771 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6724336793540946 [2022-01-19 04:31:34,771 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1166 transitions. [2022-01-19 04:31:34,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1166 transitions. [2022-01-19 04:31:34,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:31:34,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1166 transitions. [2022-01-19 04:31:34,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 68.58823529411765) internal successors, (1166), 17 states have internal predecessors, (1166), 0 states have call successors, (0), 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 04:31:34,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 102.0) internal successors, (1836), 18 states have internal predecessors, (1836), 0 states have call successors, (0), 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 04:31:34,774 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 102.0) internal successors, (1836), 18 states have internal predecessors, (1836), 0 states have call successors, (0), 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 04:31:34,775 INFO L186 Difference]: Start difference. First operand has 189 places, 255 transitions, 2519 flow. Second operand 17 states and 1166 transitions. [2022-01-19 04:31:34,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 467 transitions, 4522 flow [2022-01-19 04:31:35,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 467 transitions, 4450 flow, removed 36 selfloop flow, removed 0 redundant places. [2022-01-19 04:31:35,008 INFO L242 Difference]: Finished difference. Result has 215 places, 269 transitions, 2872 flow [2022-01-19 04:31:35,008 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=2293, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2872, PETRI_PLACES=215, PETRI_TRANSITIONS=269} [2022-01-19 04:31:35,008 INFO L334 CegarLoopForPetriNet]: 102 programPoint places, 113 predicate places. [2022-01-19 04:31:35,008 INFO L470 AbstractCegarLoop]: Abstraction has has 215 places, 269 transitions, 2872 flow [2022-01-19 04:31:35,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 55.285714285714285) internal successors, (387), 7 states have internal predecessors, (387), 0 states have call successors, (0), 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 04:31:35,009 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:31:35,009 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 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] [2022-01-19 04:31:35,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-19 04:31:35,009 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:31:35,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:31:35,009 INFO L85 PathProgramCache]: Analyzing trace with hash 2040148302, now seen corresponding path program 1 times [2022-01-19 04:31:35,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:31:35,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027440189] [2022-01-19 04:31:35,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:31:35,009 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:31:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:31:35,061 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-01-19 04:31:35,062 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:31:35,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027440189] [2022-01-19 04:31:35,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027440189] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:31:35,062 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:31:35,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:31:35,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238263923] [2022-01-19 04:31:35,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:31:35,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:31:35,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:31:35,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:31:35,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:31:35,063 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 102 [2022-01-19 04:31:35,064 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 269 transitions, 2872 flow. Second operand has 7 states, 7 states have (on average 55.285714285714285) internal successors, (387), 7 states have internal predecessors, (387), 0 states have call successors, (0), 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 04:31:35,064 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:31:35,064 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 102 [2022-01-19 04:31:35,064 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:31:36,854 INFO L129 PetriNetUnfolder]: 5658/11774 cut-off events. [2022-01-19 04:31:36,855 INFO L130 PetriNetUnfolder]: For 121367/121494 co-relation queries the response was YES. [2022-01-19 04:31:36,929 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47326 conditions, 11774 events. 5658/11774 cut-off events. For 121367/121494 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 104355 event pairs, 1598 based on Foata normal form. 176/11884 useless extension candidates. Maximal degree in co-relation 47162. Up to 5236 conditions per place. [2022-01-19 04:31:37,093 INFO L132 encePairwiseOnDemand]: 88/102 looper letters, 220 selfloop transitions, 77 changer transitions 78/450 dead transitions. [2022-01-19 04:31:37,093 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 450 transitions, 4586 flow [2022-01-19 04:31:37,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 04:31:37,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 04:31:37,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1139 transitions. [2022-01-19 04:31:37,095 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6568627450980392 [2022-01-19 04:31:37,095 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1139 transitions. [2022-01-19 04:31:37,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1139 transitions. [2022-01-19 04:31:37,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:31:37,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1139 transitions. [2022-01-19 04:31:37,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 67.0) internal successors, (1139), 17 states have internal predecessors, (1139), 0 states have call successors, (0), 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 04:31:37,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 102.0) internal successors, (1836), 18 states have internal predecessors, (1836), 0 states have call successors, (0), 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 04:31:37,099 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 102.0) internal successors, (1836), 18 states have internal predecessors, (1836), 0 states have call successors, (0), 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 04:31:37,099 INFO L186 Difference]: Start difference. First operand has 215 places, 269 transitions, 2872 flow. Second operand 17 states and 1139 transitions. [2022-01-19 04:31:37,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 450 transitions, 4586 flow [2022-01-19 04:31:37,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 450 transitions, 4364 flow, removed 72 selfloop flow, removed 4 redundant places. [2022-01-19 04:31:37,338 INFO L242 Difference]: Finished difference. Result has 237 places, 259 transitions, 2673 flow [2022-01-19 04:31:37,338 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=2431, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2673, PETRI_PLACES=237, PETRI_TRANSITIONS=259} [2022-01-19 04:31:37,339 INFO L334 CegarLoopForPetriNet]: 102 programPoint places, 135 predicate places. [2022-01-19 04:31:37,339 INFO L470 AbstractCegarLoop]: Abstraction has has 237 places, 259 transitions, 2673 flow [2022-01-19 04:31:37,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 55.285714285714285) internal successors, (387), 7 states have internal predecessors, (387), 0 states have call successors, (0), 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 04:31:37,339 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:31:37,339 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 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] [2022-01-19 04:31:37,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-19 04:31:37,339 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:31:37,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:31:37,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1219992766, now seen corresponding path program 1 times [2022-01-19 04:31:37,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:31:37,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35104671] [2022-01-19 04:31:37,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:31:37,340 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:31:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:31:37,409 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-01-19 04:31:37,409 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:31:37,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35104671] [2022-01-19 04:31:37,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35104671] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:31:37,409 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:31:37,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:31:37,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108753192] [2022-01-19 04:31:37,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:31:37,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:31:37,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:31:37,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:31:37,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:31:37,411 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 102 [2022-01-19 04:31:37,412 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 259 transitions, 2673 flow. Second operand has 7 states, 7 states have (on average 55.285714285714285) internal successors, (387), 7 states have internal predecessors, (387), 0 states have call successors, (0), 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 04:31:37,412 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:31:37,412 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 102 [2022-01-19 04:31:37,412 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:31:38,626 INFO L129 PetriNetUnfolder]: 3358/6982 cut-off events. [2022-01-19 04:31:38,627 INFO L130 PetriNetUnfolder]: For 87824/87936 co-relation queries the response was YES. [2022-01-19 04:31:38,672 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27827 conditions, 6982 events. 3358/6982 cut-off events. For 87824/87936 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 55995 event pairs, 849 based on Foata normal form. 162/7089 useless extension candidates. Maximal degree in co-relation 27650. Up to 2418 conditions per place. [2022-01-19 04:31:38,692 INFO L132 encePairwiseOnDemand]: 88/102 looper letters, 220 selfloop transitions, 61 changer transitions 61/417 dead transitions. [2022-01-19 04:31:38,692 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 417 transitions, 4071 flow [2022-01-19 04:31:38,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 04:31:38,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 04:31:38,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1126 transitions. [2022-01-19 04:31:38,694 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.649365628604383 [2022-01-19 04:31:38,694 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1126 transitions. [2022-01-19 04:31:38,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1126 transitions. [2022-01-19 04:31:38,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:31:38,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1126 transitions. [2022-01-19 04:31:38,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 66.23529411764706) internal successors, (1126), 17 states have internal predecessors, (1126), 0 states have call successors, (0), 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 04:31:38,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 102.0) internal successors, (1836), 18 states have internal predecessors, (1836), 0 states have call successors, (0), 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 04:31:38,697 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 102.0) internal successors, (1836), 18 states have internal predecessors, (1836), 0 states have call successors, (0), 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 04:31:38,697 INFO L186 Difference]: Start difference. First operand has 237 places, 259 transitions, 2673 flow. Second operand 17 states and 1126 transitions. [2022-01-19 04:31:38,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 417 transitions, 4071 flow [2022-01-19 04:31:38,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 417 transitions, 3835 flow, removed 105 selfloop flow, removed 4 redundant places. [2022-01-19 04:31:38,847 INFO L242 Difference]: Finished difference. Result has 259 places, 247 transitions, 2321 flow [2022-01-19 04:31:38,847 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=2087, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2321, PETRI_PLACES=259, PETRI_TRANSITIONS=247} [2022-01-19 04:31:38,847 INFO L334 CegarLoopForPetriNet]: 102 programPoint places, 157 predicate places. [2022-01-19 04:31:38,847 INFO L470 AbstractCegarLoop]: Abstraction has has 259 places, 247 transitions, 2321 flow [2022-01-19 04:31:38,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 55.285714285714285) internal successors, (387), 7 states have internal predecessors, (387), 0 states have call successors, (0), 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 04:31:38,848 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:31:38,848 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 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] [2022-01-19 04:31:38,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-19 04:31:38,848 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:31:38,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:31:38,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1772636812, now seen corresponding path program 1 times [2022-01-19 04:31:38,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:31:38,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545308998] [2022-01-19 04:31:38,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:31:38,848 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:31:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:31:38,869 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-01-19 04:31:38,869 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:31:38,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545308998] [2022-01-19 04:31:38,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545308998] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:31:38,869 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:31:38,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 04:31:38,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13944364] [2022-01-19 04:31:38,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:31:38,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 04:31:38,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:31:38,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 04:31:38,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 04:31:38,870 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 102 [2022-01-19 04:31:38,870 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 247 transitions, 2321 flow. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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 04:31:38,870 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:31:38,870 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 102 [2022-01-19 04:31:38,870 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:31:38,923 INFO L129 PetriNetUnfolder]: 43/314 cut-off events. [2022-01-19 04:31:38,923 INFO L130 PetriNetUnfolder]: For 1503/1503 co-relation queries the response was YES. [2022-01-19 04:31:38,925 INFO L84 FinitePrefix]: Finished finitePrefix Result has 978 conditions, 314 events. 43/314 cut-off events. For 1503/1503 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1375 event pairs, 9 based on Foata normal form. 35/342 useless extension candidates. Maximal degree in co-relation 895. Up to 69 conditions per place. [2022-01-19 04:31:38,925 INFO L132 encePairwiseOnDemand]: 90/102 looper letters, 12 selfloop transitions, 12 changer transitions 0/118 dead transitions. [2022-01-19 04:31:38,925 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 118 transitions, 894 flow [2022-01-19 04:31:38,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 04:31:38,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 04:31:38,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 246 transitions. [2022-01-19 04:31:38,926 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.803921568627451 [2022-01-19 04:31:38,926 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 246 transitions. [2022-01-19 04:31:38,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 246 transitions. [2022-01-19 04:31:38,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:31:38,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 246 transitions. [2022-01-19 04:31:38,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 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 04:31:38,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 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 04:31:38,927 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 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 04:31:38,927 INFO L186 Difference]: Start difference. First operand has 259 places, 247 transitions, 2321 flow. Second operand 3 states and 246 transitions. [2022-01-19 04:31:38,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 118 transitions, 894 flow [2022-01-19 04:31:38,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 118 transitions, 596 flow, removed 92 selfloop flow, removed 51 redundant places. [2022-01-19 04:31:38,934 INFO L242 Difference]: Finished difference. Result has 161 places, 113 transitions, 546 flow [2022-01-19 04:31:38,934 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=546, PETRI_PLACES=161, PETRI_TRANSITIONS=113} [2022-01-19 04:31:38,934 INFO L334 CegarLoopForPetriNet]: 102 programPoint places, 59 predicate places. [2022-01-19 04:31:38,935 INFO L470 AbstractCegarLoop]: Abstraction has has 161 places, 113 transitions, 546 flow [2022-01-19 04:31:38,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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 04:31:38,935 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:31:38,935 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 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] [2022-01-19 04:31:38,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-19 04:31:38,935 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:31:38,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:31:38,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1972791890, now seen corresponding path program 1 times [2022-01-19 04:31:38,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:31:38,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783137447] [2022-01-19 04:31:38,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:31:38,935 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:31:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 04:31:38,947 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-19 04:31:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 04:31:38,962 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-19 04:31:38,963 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-19 04:31:38,963 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-01-19 04:31:38,963 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-01-19 04:31:38,963 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2022-01-19 04:31:38,963 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-01-19 04:31:38,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-19 04:31:38,963 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:31:38,963 INFO L309 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2022-01-19 04:31:38,964 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2022-01-19 04:31:38,964 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 04:31:38,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 04:31:38 BasicIcfg [2022-01-19 04:31:38,996 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 04:31:38,996 INFO L158 Benchmark]: Toolchain (without parser) took 19523.00ms. Allocated memory was 385.9MB in the beginning and 9.3GB in the end (delta: 8.9GB). Free memory was 331.0MB in the beginning and 7.8GB in the end (delta: -7.5GB). Peak memory consumption was 1.4GB. Max. memory is 16.0GB. [2022-01-19 04:31:38,996 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 385.9MB. Free memory is still 348.5MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 04:31:38,997 INFO L158 Benchmark]: CACSL2BoogieTranslator took 394.35ms. Allocated memory was 385.9MB in the beginning and 536.9MB in the end (delta: 151.0MB). Free memory was 330.8MB in the beginning and 501.5MB in the end (delta: -170.7MB). Peak memory consumption was 6.9MB. Max. memory is 16.0GB. [2022-01-19 04:31:38,997 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.00ms. Allocated memory is still 536.9MB. Free memory was 501.5MB in the beginning and 499.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 04:31:38,997 INFO L158 Benchmark]: Boogie Preprocessor took 18.27ms. Allocated memory is still 536.9MB. Free memory was 499.4MB in the beginning and 497.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 04:31:38,997 INFO L158 Benchmark]: RCFGBuilder took 298.85ms. Allocated memory is still 536.9MB. Free memory was 497.3MB in the beginning and 479.5MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2022-01-19 04:31:38,997 INFO L158 Benchmark]: TraceAbstraction took 18761.25ms. Allocated memory was 536.9MB in the beginning and 9.3GB in the end (delta: 8.7GB). Free memory was 479.5MB in the beginning and 7.8GB in the end (delta: -7.3GB). Peak memory consumption was 1.4GB. Max. memory is 16.0GB. [2022-01-19 04:31:38,998 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 385.9MB. Free memory is still 348.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 394.35ms. Allocated memory was 385.9MB in the beginning and 536.9MB in the end (delta: 151.0MB). Free memory was 330.8MB in the beginning and 501.5MB in the end (delta: -170.7MB). Peak memory consumption was 6.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 45.00ms. Allocated memory is still 536.9MB. Free memory was 501.5MB in the beginning and 499.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 18.27ms. Allocated memory is still 536.9MB. Free memory was 499.4MB in the beginning and 497.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 298.85ms. Allocated memory is still 536.9MB. Free memory was 497.3MB in the beginning and 479.5MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 18761.25ms. Allocated memory was 536.9MB in the beginning and 9.3GB in the end (delta: 8.7GB). Free memory was 479.5MB in the beginning and 7.8GB in the end (delta: -7.3GB). Peak memory consumption was 1.4GB. 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 - 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 - CounterExampleResult [Line: 728]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L704] 0 volatile unsigned int count = 0; VAL [count=0] [L705] 0 _Bool MTX = 0; VAL [count=0, MTX=0] [L706] 0 _Bool COND = 0; VAL [COND=0, count=0, MTX=0] [L732] 0 pthread_t t; VAL [COND=0, count=0, MTX=0, t={3:0}] [L733] COND TRUE 0 1 VAL [COND=0, count=0, MTX=0, t={3:0}] [L733] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [COND=0, count=0, MTX=0, pthread_create(&t, 0, thr1, 0)=-2, t={3:0}] [L733] COND TRUE 0 1 VAL [COND=0, count=0, MTX=0, t={3:0}] [L733] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [COND=0, count=0, MTX=0, pthread_create(&t, 0, thr1, 0)=-1, t={3:0}] [L733] COND TRUE 0 1 VAL [COND=0, count=0, MTX=0, t={3:0}] [L733] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [COND=0, count=0, MTX=0, pthread_create(&t, 0, thr1, 0)=0, t={3:0}] [L727] CALL 3 Barrier2() [L727] CALL 1 Barrier2() [L718] CALL 1 __VERIFIER_atomic_acquire() [L709] CALL 1 assume_abort_if_not(MTX==0) [L3] COND FALSE 1 !(!cond) [L709] RET 1 assume_abort_if_not(MTX==0) [L710] 1 MTX = 1 [L718] RET 1 __VERIFIER_atomic_acquire() [L719] 1 count++ VAL [COND=0, count=1, MTX=1] [L720] COND FALSE 1 !(count == 3) VAL [COND=0, count=1, MTX=1] [L724] CALL 1 __VERIFIER_atomic_release() [L714] CALL 1 assume_abort_if_not(MTX==1) [L3] COND FALSE 1 !(!cond) [L714] RET 1 assume_abort_if_not(MTX==1) [L715] 1 MTX = 0 [L724] RET 1 __VERIFIER_atomic_release() [L727] CALL 2 Barrier2() [L718] CALL 2 __VERIFIER_atomic_acquire() [L709] CALL 2 assume_abort_if_not(MTX==0) [L3] COND FALSE 2 !(!cond) [L709] RET 2 assume_abort_if_not(MTX==0) [L710] 2 MTX = 1 [L718] RET 2 __VERIFIER_atomic_acquire() [L719] 2 count++ VAL [COND=0, count=2, MTX=1] [L720] COND FALSE 2 !(count == 3) VAL [COND=0, count=2, MTX=1] [L724] CALL 2 __VERIFIER_atomic_release() [L714] CALL 2 assume_abort_if_not(MTX==1) [L3] COND FALSE 2 !(!cond) [L714] RET 2 assume_abort_if_not(MTX==1) [L715] 2 MTX = 0 [L724] RET 2 __VERIFIER_atomic_release() [L718] CALL 3 __VERIFIER_atomic_acquire() [L709] CALL 3 assume_abort_if_not(MTX==0) [L3] COND FALSE 3 !(!cond) [L709] RET 3 assume_abort_if_not(MTX==0) [L710] 3 MTX = 1 [L718] RET 3 __VERIFIER_atomic_acquire() [L719] 3 count++ VAL [COND=0, count=3, MTX=1] [L720] COND TRUE 3 count == 3 VAL [COND=0, count=3, MTX=1] [L721] 3 COND = 1 VAL [COND=1, count=3, MTX=1] [L722] 3 count = 0 VAL [COND=1, count=0, MTX=1] [L725] CALL 3 __VERIFIER_atomic_release() [L714] CALL 3 assume_abort_if_not(MTX==1) [L3] COND FALSE 3 !(!cond) [L714] RET 3 assume_abort_if_not(MTX==1) [L715] 3 MTX = 0 [L725] RET 3 __VERIFIER_atomic_release() [L727] RET 3 Barrier2() [L728] 3 reach_error() VAL [arg={0:0}, arg={0:0}, COND=1, count=0, MTX=0] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 74 locations, 3 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.6s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27 IncrementalHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 4 mSDtfsCounter, 27 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 70 NumberOfCodeBlocks, 70 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 68 ConstructedInterpolants, 0 QuantifiedInterpolants, 166 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 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, 96 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: 1.1s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 234 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 234 mSDsluCounter, 148 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 261 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 459 IncrementalHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 66 mSDtfsCounter, 459 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=316occurred in iteration=3, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 205 NumberOfCodeBlocks, 205 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 544 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 15/15 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 118 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: 16.8s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 16.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1642 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1642 mSDsluCounter, 976 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2093 mSDsCounter, 154 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3302 IncrementalHoareTripleChecker+Invalid, 3456 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 154 mSolverCounterUnsat, 399 mSDtfsCounter, 3302 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2872occurred in iteration=8, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 595 NumberOfCodeBlocks, 595 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 518 ConstructedInterpolants, 0 QuantifiedInterpolants, 1356 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 117/117 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, 74 locations, 3 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.1s, OverallIterations: 1, TraceHistogramMax: 2, PathProgramHistogramMax: 1, 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=113occurred in iteration=0, 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: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 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, 96 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: 0.0s, OverallIterations: 1, TraceHistogramMax: 3, PathProgramHistogramMax: 1, 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=168occurred in iteration=0, 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: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 35 NumberOfCodeBlocks, 35 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-01-19 04:31:39,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...