/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.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 03:10:43,800 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 03:10:43,802 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 03:10:43,839 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 03:10:43,839 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 03:10:43,840 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 03:10:43,841 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 03:10:43,853 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 03:10:43,854 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 03:10:43,857 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 03:10:43,858 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 03:10:43,859 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 03:10:43,859 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 03:10:43,860 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 03:10:43,861 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 03:10:43,862 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 03:10:43,863 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 03:10:43,863 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 03:10:43,865 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 03:10:43,869 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 03:10:43,870 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 03:10:43,870 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 03:10:43,871 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 03:10:43,872 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 03:10:43,876 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 03:10:43,876 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 03:10:43,876 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 03:10:43,877 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 03:10:43,877 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 03:10:43,878 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 03:10:43,878 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 03:10:43,878 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 03:10:43,878 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 03:10:43,879 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 03:10:43,879 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 03:10:43,879 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 03:10:43,880 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 03:10:43,880 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 03:10:43,880 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 03:10:43,881 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 03:10:43,881 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 03:10:43,883 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-01-19 03:10:43,904 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 03:10:43,905 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 03:10:43,905 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 03:10:43,905 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 03:10:43,906 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 03:10:43,906 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 03:10:43,906 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 03:10:43,906 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 03:10:43,906 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 03:10:43,906 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 03:10:43,907 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 03:10:43,907 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 03:10:43,907 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 03:10:43,907 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 03:10:43,907 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 03:10:43,907 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 03:10:43,907 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 03:10:43,907 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 03:10:43,907 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 03:10:43,907 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 03:10:43,908 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 03:10:43,908 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 03:10:43,908 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 03:10:43,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 03:10:43,908 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 03:10:43,908 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 03:10:43,908 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 03:10:43,908 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 03:10:43,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 03:10:43,908 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 03:10:43,908 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 03:10:43,908 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 03:10:44,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 03:10:44,099 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 03:10:44,100 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 03:10:44,101 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 03:10:44,102 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 03:10:44,102 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i [2022-01-19 03:10:44,144 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36e1772ae/9d2e1a1d9a2e4ab6a7759833b105c39c/FLAGff8290bd6 [2022-01-19 03:10:44,588 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 03:10:44,588 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i [2022-01-19 03:10:44,605 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36e1772ae/9d2e1a1d9a2e4ab6a7759833b105c39c/FLAGff8290bd6 [2022-01-19 03:10:44,619 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36e1772ae/9d2e1a1d9a2e4ab6a7759833b105c39c [2022-01-19 03:10:44,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 03:10:44,622 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 03:10:44,624 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 03:10:44,624 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 03:10:44,626 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 03:10:44,626 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 03:10:44" (1/1) ... [2022-01-19 03:10:44,627 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e2a4119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:10:44, skipping insertion in model container [2022-01-19 03:10:44,628 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 03:10:44" (1/1) ... [2022-01-19 03:10:44,649 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 03:10:44,693 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 03:10:44,896 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-deagle/circular_buffer_ok.i[30451,30464] [2022-01-19 03:10:44,900 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-deagle/circular_buffer_ok.i[30681,30694] [2022-01-19 03:10:44,903 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-deagle/circular_buffer_ok.i[30979,30992] [2022-01-19 03:10:44,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 03:10:44,912 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 03:10:44,953 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-deagle/circular_buffer_ok.i[30451,30464] [2022-01-19 03:10:44,954 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-deagle/circular_buffer_ok.i[30681,30694] [2022-01-19 03:10:44,955 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-deagle/circular_buffer_ok.i[30979,30992] [2022-01-19 03:10:44,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 03:10:44,991 INFO L208 MainTranslator]: Completed translation [2022-01-19 03:10:44,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:10:44 WrapperNode [2022-01-19 03:10:44,991 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 03:10:44,992 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 03:10:44,992 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 03:10:44,992 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 03:10:44,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:10:44" (1/1) ... [2022-01-19 03:10:45,007 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:10:44" (1/1) ... [2022-01-19 03:10:45,024 INFO L137 Inliner]: procedures = 168, calls = 36, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-01-19 03:10:45,025 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 03:10:45,025 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 03:10:45,025 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 03:10:45,026 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 03:10:45,031 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:10:44" (1/1) ... [2022-01-19 03:10:45,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:10:44" (1/1) ... [2022-01-19 03:10:45,034 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:10:44" (1/1) ... [2022-01-19 03:10:45,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:10:44" (1/1) ... [2022-01-19 03:10:45,040 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:10:44" (1/1) ... [2022-01-19 03:10:45,044 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:10:44" (1/1) ... [2022-01-19 03:10:45,045 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:10:44" (1/1) ... [2022-01-19 03:10:45,047 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 03:10:45,048 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 03:10:45,048 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 03:10:45,048 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 03:10:45,049 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:10:44" (1/1) ... [2022-01-19 03:10:45,054 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 03:10:45,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:10:45,070 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 03:10:45,076 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 03:10:45,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 03:10:45,098 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-01-19 03:10:45,099 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-01-19 03:10:45,099 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-01-19 03:10:45,099 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-01-19 03:10:45,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 03:10:45,099 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-01-19 03:10:45,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 03:10:45,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 03:10:45,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 03:10:45,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-01-19 03:10:45,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 03:10:45,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 03:10:45,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 03:10:45,101 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 03:10:45,179 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 03:10:45,180 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 03:10:45,355 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 03:10:45,361 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 03:10:45,362 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-19 03:10:45,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 03:10:45 BoogieIcfgContainer [2022-01-19 03:10:45,363 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 03:10:45,364 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 03:10:45,364 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 03:10:45,367 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 03:10:45,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 03:10:44" (1/3) ... [2022-01-19 03:10:45,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b08b8c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 03:10:45, skipping insertion in model container [2022-01-19 03:10:45,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:10:44" (2/3) ... [2022-01-19 03:10:45,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b08b8c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 03:10:45, skipping insertion in model container [2022-01-19 03:10:45,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 03:10:45" (3/3) ... [2022-01-19 03:10:45,369 INFO L111 eAbstractionObserver]: Analyzing ICFG circular_buffer_ok.i [2022-01-19 03:10:45,372 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 03:10:45,372 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-01-19 03:10:45,372 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 03:10:45,422 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,423 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,423 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,423 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,423 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,423 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,423 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,423 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,424 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,424 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,424 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,424 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,424 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,424 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,425 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,425 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,425 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,425 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,425 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,425 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,426 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,426 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,426 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,426 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,427 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,427 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,427 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,427 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,427 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,430 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,430 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,430 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,431 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,431 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,431 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,431 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,431 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,431 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,431 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,446 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,447 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,447 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,447 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,447 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,447 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,447 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,448 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,449 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,450 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,450 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,450 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,450 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,451 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,451 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,451 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,451 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,452 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,452 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,452 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,452 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,453 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,453 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,453 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,453 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,453 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,454 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,454 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,454 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,454 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,454 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,454 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,454 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,455 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,455 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,455 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,456 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,456 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,456 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,456 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,456 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,456 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,456 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,457 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,457 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,457 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,457 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,457 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,458 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,458 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,458 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,458 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,458 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,459 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,459 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,459 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,459 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,459 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,460 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,460 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,460 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,460 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,461 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,461 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,461 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,461 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,461 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,461 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,461 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,461 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,461 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,462 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,462 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,463 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,463 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,463 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,463 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,463 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,464 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,464 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,464 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,464 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,464 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,465 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,465 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,465 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,465 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,465 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,465 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,466 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,466 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,467 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,467 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,467 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,467 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,467 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,467 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,467 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,467 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,468 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,468 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,468 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,468 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,468 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,468 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,471 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,471 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,471 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,471 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,471 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,471 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,471 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_insertLogElement_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,472 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,472 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,472 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,472 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,474 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,474 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,474 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,474 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,474 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,474 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,475 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,475 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,475 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,475 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_removeLogElement_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,475 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:45,478 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-01-19 03:10:45,523 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 03:10:45,527 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 03:10:45,527 INFO L340 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-01-19 03:10:45,545 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 154 places, 158 transitions, 332 flow [2022-01-19 03:10:45,616 INFO L129 PetriNetUnfolder]: 11/156 cut-off events. [2022-01-19 03:10:45,616 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 03:10:45,619 INFO L84 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 156 events. 11/156 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 292 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2022-01-19 03:10:45,619 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 158 transitions, 332 flow [2022-01-19 03:10:45,623 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 146 transitions, 301 flow [2022-01-19 03:10:45,642 INFO L129 PetriNetUnfolder]: 5/110 cut-off events. [2022-01-19 03:10:45,642 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 03:10:45,643 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:10:45,643 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 03:10:45,643 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 03:10:45,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:10:45,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1257082362, now seen corresponding path program 1 times [2022-01-19 03:10:45,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:10:45,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235840238] [2022-01-19 03:10:45,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:10:45,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:10:45,775 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-19 03:10:45,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1698952208] [2022-01-19 03:10:45,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:10:45,777 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:10:45,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:10:45,794 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 03:10:45,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-19 03:10:45,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:10:45,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-19 03:10:45,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 03:10:46,153 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 03:10:46,153 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 03:10:46,154 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:10:46,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235840238] [2022-01-19 03:10:46,154 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-19 03:10:46,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698952208] [2022-01-19 03:10:46,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698952208] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:10:46,155 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:10:46,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 03:10:46,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610697428] [2022-01-19 03:10:46,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:10:46,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 03:10:46,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:10:46,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 03:10:46,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-19 03:10:46,192 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 158 [2022-01-19 03:10:46,195 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 146 transitions, 301 flow. Second operand has 4 states, 4 states have (on average 135.5) internal successors, (542), 4 states have internal predecessors, (542), 0 states have call successors, (0), 0 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 03:10:46,195 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:10:46,195 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 158 [2022-01-19 03:10:46,196 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:10:46,296 INFO L129 PetriNetUnfolder]: 29/250 cut-off events. [2022-01-19 03:10:46,297 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-01-19 03:10:46,299 INFO L84 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 250 events. 29/250 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 894 event pairs, 8 based on Foata normal form. 21/246 useless extension candidates. Maximal degree in co-relation 240. Up to 29 conditions per place. [2022-01-19 03:10:46,301 INFO L132 encePairwiseOnDemand]: 150/158 looper letters, 18 selfloop transitions, 3 changer transitions 0/142 dead transitions. [2022-01-19 03:10:46,301 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 142 transitions, 341 flow [2022-01-19 03:10:46,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 03:10:46,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 03:10:46,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 562 transitions. [2022-01-19 03:10:46,313 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8892405063291139 [2022-01-19 03:10:46,314 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 562 transitions. [2022-01-19 03:10:46,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 562 transitions. [2022-01-19 03:10:46,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:10:46,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 562 transitions. [2022-01-19 03:10:46,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.5) internal successors, (562), 4 states have internal predecessors, (562), 0 states have call successors, (0), 0 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 03:10:46,340 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 158.0) internal successors, (790), 5 states have internal predecessors, (790), 0 states have call successors, (0), 0 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 03:10:46,340 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 158.0) internal successors, (790), 5 states have internal predecessors, (790), 0 states have call successors, (0), 0 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 03:10:46,343 INFO L186 Difference]: Start difference. First operand has 142 places, 146 transitions, 301 flow. Second operand 4 states and 562 transitions. [2022-01-19 03:10:46,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 142 transitions, 341 flow [2022-01-19 03:10:46,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 142 transitions, 334 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-19 03:10:46,351 INFO L242 Difference]: Finished difference. Result has 137 places, 136 transitions, 282 flow [2022-01-19 03:10:46,353 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=282, PETRI_PLACES=137, PETRI_TRANSITIONS=136} [2022-01-19 03:10:46,359 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, -5 predicate places. [2022-01-19 03:10:46,359 INFO L470 AbstractCegarLoop]: Abstraction has has 137 places, 136 transitions, 282 flow [2022-01-19 03:10:46,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 135.5) internal successors, (542), 4 states have internal predecessors, (542), 0 states have call successors, (0), 0 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 03:10:46,360 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:10:46,360 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 03:10:46,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-19 03:10:46,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-01-19 03:10:46,575 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 03:10:46,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:10:46,576 INFO L85 PathProgramCache]: Analyzing trace with hash 286149751, now seen corresponding path program 1 times [2022-01-19 03:10:46,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:10:46,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715124463] [2022-01-19 03:10:46,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:10:46,577 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:10:46,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:10:46,798 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 03:10:46,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:10:46,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715124463] [2022-01-19 03:10:46,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715124463] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:10:46,800 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:10:46,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 03:10:46,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539499656] [2022-01-19 03:10:46,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:10:46,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 03:10:46,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:10:46,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 03:10:46,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-19 03:10:46,804 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 158 [2022-01-19 03:10:46,805 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 136 transitions, 282 flow. Second operand has 6 states, 6 states have (on average 131.66666666666666) internal successors, (790), 6 states have internal predecessors, (790), 0 states have call successors, (0), 0 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 03:10:46,805 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:10:46,805 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 158 [2022-01-19 03:10:46,805 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:10:46,925 INFO L129 PetriNetUnfolder]: 51/369 cut-off events. [2022-01-19 03:10:46,925 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-01-19 03:10:46,927 INFO L84 FinitePrefix]: Finished finitePrefix Result has 486 conditions, 369 events. 51/369 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1421 event pairs, 10 based on Foata normal form. 2/328 useless extension candidates. Maximal degree in co-relation 266. Up to 56 conditions per place. [2022-01-19 03:10:46,929 INFO L132 encePairwiseOnDemand]: 151/158 looper letters, 19 selfloop transitions, 5 changer transitions 0/142 dead transitions. [2022-01-19 03:10:46,929 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 142 transitions, 349 flow [2022-01-19 03:10:46,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 03:10:46,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 03:10:46,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 806 transitions. [2022-01-19 03:10:46,933 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8502109704641351 [2022-01-19 03:10:46,933 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 806 transitions. [2022-01-19 03:10:46,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 806 transitions. [2022-01-19 03:10:46,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:10:46,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 806 transitions. [2022-01-19 03:10:46,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 134.33333333333334) internal successors, (806), 6 states have internal predecessors, (806), 0 states have call successors, (0), 0 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 03:10:46,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 158.0) internal successors, (1106), 7 states have internal predecessors, (1106), 0 states have call successors, (0), 0 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 03:10:46,940 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 158.0) internal successors, (1106), 7 states have internal predecessors, (1106), 0 states have call successors, (0), 0 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 03:10:46,940 INFO L186 Difference]: Start difference. First operand has 137 places, 136 transitions, 282 flow. Second operand 6 states and 806 transitions. [2022-01-19 03:10:46,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 142 transitions, 349 flow [2022-01-19 03:10:46,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 142 transitions, 339 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-19 03:10:46,945 INFO L242 Difference]: Finished difference. Result has 140 places, 137 transitions, 296 flow [2022-01-19 03:10:46,945 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=296, PETRI_PLACES=140, PETRI_TRANSITIONS=137} [2022-01-19 03:10:46,946 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, -2 predicate places. [2022-01-19 03:10:46,946 INFO L470 AbstractCegarLoop]: Abstraction has has 140 places, 137 transitions, 296 flow [2022-01-19 03:10:46,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 131.66666666666666) internal successors, (790), 6 states have internal predecessors, (790), 0 states have call successors, (0), 0 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 03:10:46,947 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:10:46,947 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 03:10:46,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 03:10:46,947 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 03:10:46,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:10:46,948 INFO L85 PathProgramCache]: Analyzing trace with hash 830490914, now seen corresponding path program 1 times [2022-01-19 03:10:46,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:10:46,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220002498] [2022-01-19 03:10:46,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:10:46,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:10:46,987 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-19 03:10:46,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1758747227] [2022-01-19 03:10:46,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:10:46,987 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:10:46,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:10:47,008 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 03:10:47,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-19 03:10:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:10:47,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-19 03:10:47,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 03:10:47,265 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 03:10:47,265 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 03:10:47,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:10:47,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220002498] [2022-01-19 03:10:47,266 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-19 03:10:47,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758747227] [2022-01-19 03:10:47,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758747227] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:10:47,268 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:10:47,268 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 03:10:47,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812903968] [2022-01-19 03:10:47,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:10:47,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 03:10:47,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:10:47,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 03:10:47,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 03:10:47,271 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 158 [2022-01-19 03:10:47,272 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 137 transitions, 296 flow. Second operand has 6 states, 6 states have (on average 128.33333333333334) internal successors, (770), 6 states have internal predecessors, (770), 0 states have call successors, (0), 0 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 03:10:47,272 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:10:47,272 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 158 [2022-01-19 03:10:47,272 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:10:47,376 INFO L129 PetriNetUnfolder]: 54/345 cut-off events. [2022-01-19 03:10:47,376 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 03:10:47,377 INFO L84 FinitePrefix]: Finished finitePrefix Result has 558 conditions, 345 events. 54/345 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1202 event pairs, 11 based on Foata normal form. 0/320 useless extension candidates. Maximal degree in co-relation 233. Up to 39 conditions per place. [2022-01-19 03:10:47,378 INFO L132 encePairwiseOnDemand]: 150/158 looper letters, 28 selfloop transitions, 9 changer transitions 0/151 dead transitions. [2022-01-19 03:10:47,378 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 151 transitions, 408 flow [2022-01-19 03:10:47,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 03:10:47,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 03:10:47,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 920 transitions. [2022-01-19 03:10:47,380 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8318264014466547 [2022-01-19 03:10:47,380 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 920 transitions. [2022-01-19 03:10:47,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 920 transitions. [2022-01-19 03:10:47,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:10:47,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 920 transitions. [2022-01-19 03:10:47,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.42857142857142) internal successors, (920), 7 states have internal predecessors, (920), 0 states have call successors, (0), 0 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 03:10:47,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 158.0) internal successors, (1264), 8 states have internal predecessors, (1264), 0 states have call successors, (0), 0 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 03:10:47,389 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 158.0) internal successors, (1264), 8 states have internal predecessors, (1264), 0 states have call successors, (0), 0 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 03:10:47,389 INFO L186 Difference]: Start difference. First operand has 140 places, 137 transitions, 296 flow. Second operand 7 states and 920 transitions. [2022-01-19 03:10:47,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 151 transitions, 408 flow [2022-01-19 03:10:47,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 151 transitions, 400 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-01-19 03:10:47,393 INFO L242 Difference]: Finished difference. Result has 145 places, 142 transitions, 335 flow [2022-01-19 03:10:47,393 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=335, PETRI_PLACES=145, PETRI_TRANSITIONS=142} [2022-01-19 03:10:47,395 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 3 predicate places. [2022-01-19 03:10:47,395 INFO L470 AbstractCegarLoop]: Abstraction has has 145 places, 142 transitions, 335 flow [2022-01-19 03:10:47,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.33333333333334) internal successors, (770), 6 states have internal predecessors, (770), 0 states have call successors, (0), 0 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 03:10:47,395 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:10:47,396 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 03:10:47,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-01-19 03:10:47,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-01-19 03:10:47,612 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 03:10:47,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:10:47,613 INFO L85 PathProgramCache]: Analyzing trace with hash 834900101, now seen corresponding path program 1 times [2022-01-19 03:10:47,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:10:47,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891170097] [2022-01-19 03:10:47,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:10:47,613 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:10:47,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:10:47,684 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 03:10:47,684 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:10:47,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891170097] [2022-01-19 03:10:47,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891170097] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:10:47,685 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:10:47,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 03:10:47,685 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632314769] [2022-01-19 03:10:47,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:10:47,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 03:10:47,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:10:47,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 03:10:47,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 03:10:47,686 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 158 [2022-01-19 03:10:47,687 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 142 transitions, 335 flow. Second operand has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 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 03:10:47,687 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:10:47,687 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 158 [2022-01-19 03:10:47,687 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:10:47,742 INFO L129 PetriNetUnfolder]: 43/500 cut-off events. [2022-01-19 03:10:47,742 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-01-19 03:10:47,743 INFO L84 FinitePrefix]: Finished finitePrefix Result has 672 conditions, 500 events. 43/500 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1936 event pairs, 5 based on Foata normal form. 0/467 useless extension candidates. Maximal degree in co-relation 520. Up to 36 conditions per place. [2022-01-19 03:10:47,744 INFO L132 encePairwiseOnDemand]: 154/158 looper letters, 10 selfloop transitions, 3 changer transitions 0/146 dead transitions. [2022-01-19 03:10:47,744 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 146 transitions, 372 flow [2022-01-19 03:10:47,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 03:10:47,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 03:10:47,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions. [2022-01-19 03:10:47,745 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9156118143459916 [2022-01-19 03:10:47,745 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 434 transitions. [2022-01-19 03:10:47,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 434 transitions. [2022-01-19 03:10:47,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:10:47,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 434 transitions. [2022-01-19 03:10:47,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 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 03:10:47,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 158.0) internal successors, (632), 4 states have internal predecessors, (632), 0 states have call successors, (0), 0 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 03:10:47,748 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 158.0) internal successors, (632), 4 states have internal predecessors, (632), 0 states have call successors, (0), 0 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 03:10:47,748 INFO L186 Difference]: Start difference. First operand has 145 places, 142 transitions, 335 flow. Second operand 3 states and 434 transitions. [2022-01-19 03:10:47,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 146 transitions, 372 flow [2022-01-19 03:10:47,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 146 transitions, 370 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 03:10:47,751 INFO L242 Difference]: Finished difference. Result has 147 places, 143 transitions, 348 flow [2022-01-19 03:10:47,751 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=147, PETRI_TRANSITIONS=143} [2022-01-19 03:10:47,752 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 5 predicate places. [2022-01-19 03:10:47,752 INFO L470 AbstractCegarLoop]: Abstraction has has 147 places, 143 transitions, 348 flow [2022-01-19 03:10:47,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 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 03:10:47,753 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:10:47,753 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 03:10:47,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 03:10:47,753 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 03:10:47,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:10:47,754 INFO L85 PathProgramCache]: Analyzing trace with hash -520728899, now seen corresponding path program 1 times [2022-01-19 03:10:47,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:10:47,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380285145] [2022-01-19 03:10:47,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:10:47,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:10:47,780 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-19 03:10:47,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [647342180] [2022-01-19 03:10:47,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:10:47,780 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:10:47,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:10:47,781 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 03:10:47,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-19 03:10:47,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:10:47,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-19 03:10:47,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 03:10:48,040 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:10:48,041 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 03:10:48,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:10:48,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380285145] [2022-01-19 03:10:48,041 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-19 03:10:48,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647342180] [2022-01-19 03:10:48,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647342180] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:10:48,041 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:10:48,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 03:10:48,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673508244] [2022-01-19 03:10:48,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:10:48,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 03:10:48,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:10:48,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 03:10:48,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-19 03:10:48,043 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 158 [2022-01-19 03:10:48,043 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 143 transitions, 348 flow. Second operand has 4 states, 4 states have (on average 135.75) internal successors, (543), 4 states have internal predecessors, (543), 0 states have call successors, (0), 0 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 03:10:48,043 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:10:48,043 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 158 [2022-01-19 03:10:48,043 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:10:48,089 INFO L129 PetriNetUnfolder]: 40/431 cut-off events. [2022-01-19 03:10:48,090 INFO L130 PetriNetUnfolder]: For 33/36 co-relation queries the response was YES. [2022-01-19 03:10:48,091 INFO L84 FinitePrefix]: Finished finitePrefix Result has 601 conditions, 431 events. 40/431 cut-off events. For 33/36 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1466 event pairs, 10 based on Foata normal form. 3/409 useless extension candidates. Maximal degree in co-relation 416. Up to 52 conditions per place. [2022-01-19 03:10:48,092 INFO L132 encePairwiseOnDemand]: 156/158 looper letters, 17 selfloop transitions, 1 changer transitions 0/137 dead transitions. [2022-01-19 03:10:48,092 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 137 transitions, 360 flow [2022-01-19 03:10:48,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 03:10:48,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 03:10:48,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions. [2022-01-19 03:10:48,093 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.879746835443038 [2022-01-19 03:10:48,093 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 417 transitions. [2022-01-19 03:10:48,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 417 transitions. [2022-01-19 03:10:48,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:10:48,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 417 transitions. [2022-01-19 03:10:48,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 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 03:10:48,095 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 158.0) internal successors, (632), 4 states have internal predecessors, (632), 0 states have call successors, (0), 0 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 03:10:48,095 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 158.0) internal successors, (632), 4 states have internal predecessors, (632), 0 states have call successors, (0), 0 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 03:10:48,095 INFO L186 Difference]: Start difference. First operand has 147 places, 143 transitions, 348 flow. Second operand 3 states and 417 transitions. [2022-01-19 03:10:48,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 137 transitions, 360 flow [2022-01-19 03:10:48,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 137 transitions, 343 flow, removed 1 selfloop flow, removed 6 redundant places. [2022-01-19 03:10:48,098 INFO L242 Difference]: Finished difference. Result has 139 places, 135 transitions, 305 flow [2022-01-19 03:10:48,098 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=305, PETRI_PLACES=139, PETRI_TRANSITIONS=135} [2022-01-19 03:10:48,098 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, -3 predicate places. [2022-01-19 03:10:48,098 INFO L470 AbstractCegarLoop]: Abstraction has has 139 places, 135 transitions, 305 flow [2022-01-19 03:10:48,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 135.75) internal successors, (543), 4 states have internal predecessors, (543), 0 states have call successors, (0), 0 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 03:10:48,099 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:10:48,099 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:10:48,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-19 03:10:48,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:10:48,320 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 03:10:48,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:10:48,320 INFO L85 PathProgramCache]: Analyzing trace with hash -157225881, now seen corresponding path program 1 times [2022-01-19 03:10:48,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:10:48,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787510008] [2022-01-19 03:10:48,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:10:48,321 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:10:48,334 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-19 03:10:48,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [581368596] [2022-01-19 03:10:48,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:10:48,334 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:10:48,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:10:48,335 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 03:10:48,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-19 03:10:48,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:10:48,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-19 03:10:48,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 03:10:48,505 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-19 03:10:48,554 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 03:10:48,554 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 03:10:48,554 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:10:48,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787510008] [2022-01-19 03:10:48,554 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-19 03:10:48,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581368596] [2022-01-19 03:10:48,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581368596] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:10:48,554 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:10:48,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 03:10:48,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123827292] [2022-01-19 03:10:48,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:10:48,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 03:10:48,555 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:10:48,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 03:10:48,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 03:10:48,556 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 158 [2022-01-19 03:10:48,556 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 135 transitions, 305 flow. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 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 03:10:48,556 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:10:48,556 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 158 [2022-01-19 03:10:48,556 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:10:48,595 INFO L129 PetriNetUnfolder]: 35/425 cut-off events. [2022-01-19 03:10:48,595 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-01-19 03:10:48,596 INFO L84 FinitePrefix]: Finished finitePrefix Result has 564 conditions, 425 events. 35/425 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1610 event pairs, 10 based on Foata normal form. 7/412 useless extension candidates. Maximal degree in co-relation 388. Up to 42 conditions per place. [2022-01-19 03:10:48,596 INFO L132 encePairwiseOnDemand]: 154/158 looper letters, 15 selfloop transitions, 4 changer transitions 0/137 dead transitions. [2022-01-19 03:10:48,596 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 137 transitions, 350 flow [2022-01-19 03:10:48,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 03:10:48,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 03:10:48,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions. [2022-01-19 03:10:48,597 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.879746835443038 [2022-01-19 03:10:48,597 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 417 transitions. [2022-01-19 03:10:48,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 417 transitions. [2022-01-19 03:10:48,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:10:48,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 417 transitions. [2022-01-19 03:10:48,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 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 03:10:48,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 158.0) internal successors, (632), 4 states have internal predecessors, (632), 0 states have call successors, (0), 0 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 03:10:48,599 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 158.0) internal successors, (632), 4 states have internal predecessors, (632), 0 states have call successors, (0), 0 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 03:10:48,599 INFO L186 Difference]: Start difference. First operand has 139 places, 135 transitions, 305 flow. Second operand 3 states and 417 transitions. [2022-01-19 03:10:48,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 137 transitions, 350 flow [2022-01-19 03:10:48,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 137 transitions, 348 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-01-19 03:10:48,601 INFO L242 Difference]: Finished difference. Result has 141 places, 135 transitions, 311 flow [2022-01-19 03:10:48,602 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=311, PETRI_PLACES=141, PETRI_TRANSITIONS=135} [2022-01-19 03:10:48,602 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, -1 predicate places. [2022-01-19 03:10:48,602 INFO L470 AbstractCegarLoop]: Abstraction has has 141 places, 135 transitions, 311 flow [2022-01-19 03:10:48,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 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 03:10:48,602 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:10:48,603 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:10:48,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-19 03:10:48,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:10:48,818 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 03:10:48,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:10:48,818 INFO L85 PathProgramCache]: Analyzing trace with hash 637106843, now seen corresponding path program 1 times [2022-01-19 03:10:48,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:10:48,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69352269] [2022-01-19 03:10:48,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:10:48,819 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:10:48,836 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-19 03:10:48,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [162545127] [2022-01-19 03:10:48,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:10:48,837 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:10:48,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:10:48,838 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 03:10:48,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-19 03:10:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:10:49,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-19 03:10:49,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 03:10:49,429 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 03:10:49,430 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 03:10:49,430 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:10:49,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69352269] [2022-01-19 03:10:49,430 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-19 03:10:49,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162545127] [2022-01-19 03:10:49,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162545127] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:10:49,431 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:10:49,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 03:10:49,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620042857] [2022-01-19 03:10:49,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:10:49,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 03:10:49,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:10:49,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 03:10:49,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-19 03:10:49,435 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 158 [2022-01-19 03:10:49,436 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 135 transitions, 311 flow. Second operand has 8 states, 8 states have (on average 128.0) internal successors, (1024), 8 states have internal predecessors, (1024), 0 states have call successors, (0), 0 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 03:10:49,436 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:10:49,437 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 158 [2022-01-19 03:10:49,437 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:10:49,546 INFO L129 PetriNetUnfolder]: 45/520 cut-off events. [2022-01-19 03:10:49,546 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-01-19 03:10:49,547 INFO L84 FinitePrefix]: Finished finitePrefix Result has 755 conditions, 520 events. 45/520 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2204 event pairs, 13 based on Foata normal form. 0/488 useless extension candidates. Maximal degree in co-relation 485. Up to 49 conditions per place. [2022-01-19 03:10:49,548 INFO L132 encePairwiseOnDemand]: 150/158 looper letters, 27 selfloop transitions, 8 changer transitions 0/147 dead transitions. [2022-01-19 03:10:49,548 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 147 transitions, 415 flow [2022-01-19 03:10:49,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 03:10:49,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 03:10:49,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1044 transitions. [2022-01-19 03:10:49,551 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8259493670886076 [2022-01-19 03:10:49,551 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1044 transitions. [2022-01-19 03:10:49,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1044 transitions. [2022-01-19 03:10:49,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:10:49,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1044 transitions. [2022-01-19 03:10:49,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 130.5) internal successors, (1044), 8 states have internal predecessors, (1044), 0 states have call successors, (0), 0 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 03:10:49,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 158.0) internal successors, (1422), 9 states have internal predecessors, (1422), 0 states have call successors, (0), 0 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 03:10:49,554 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 158.0) internal successors, (1422), 9 states have internal predecessors, (1422), 0 states have call successors, (0), 0 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 03:10:49,555 INFO L186 Difference]: Start difference. First operand has 141 places, 135 transitions, 311 flow. Second operand 8 states and 1044 transitions. [2022-01-19 03:10:49,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 147 transitions, 415 flow [2022-01-19 03:10:49,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 147 transitions, 411 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 03:10:49,558 INFO L242 Difference]: Finished difference. Result has 148 places, 137 transitions, 338 flow [2022-01-19 03:10:49,558 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=338, PETRI_PLACES=148, PETRI_TRANSITIONS=137} [2022-01-19 03:10:49,559 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 6 predicate places. [2022-01-19 03:10:49,559 INFO L470 AbstractCegarLoop]: Abstraction has has 148 places, 137 transitions, 338 flow [2022-01-19 03:10:49,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 128.0) internal successors, (1024), 8 states have internal predecessors, (1024), 0 states have call successors, (0), 0 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 03:10:49,561 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:10:49,561 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:10:49,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-19 03:10:49,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:10:49,776 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 03:10:49,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:10:49,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1300379129, now seen corresponding path program 1 times [2022-01-19 03:10:49,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:10:49,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788130120] [2022-01-19 03:10:49,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:10:49,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:10:49,791 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-19 03:10:49,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1164738688] [2022-01-19 03:10:49,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:10:49,792 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:10:49,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:10:49,808 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 03:10:49,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-19 03:10:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:10:50,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 32 conjunts are in the unsatisfiable core [2022-01-19 03:10:50,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 03:10:50,064 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-01-19 03:10:50,205 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-19 03:10:50,205 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-19 03:10:50,225 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 03:10:50,225 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 03:10:50,342 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 03:10:50,387 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 03:10:50,511 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2022-01-19 03:10:50,720 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2022-01-19 03:10:50,844 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 03:10:50,845 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 03:10:50,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:10:50,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788130120] [2022-01-19 03:10:50,845 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-19 03:10:50,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164738688] [2022-01-19 03:10:50,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164738688] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:10:50,845 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:10:50,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-19 03:10:50,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191799272] [2022-01-19 03:10:50,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:10:50,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-19 03:10:50,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:10:50,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-19 03:10:50,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-01-19 03:10:50,847 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 158 [2022-01-19 03:10:50,848 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 137 transitions, 338 flow. Second operand has 16 states, 16 states have (on average 93.75) internal successors, (1500), 16 states have internal predecessors, (1500), 0 states have call successors, (0), 0 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 03:10:50,848 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:10:50,848 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 158 [2022-01-19 03:10:50,849 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:10:51,282 INFO L129 PetriNetUnfolder]: 885/3002 cut-off events. [2022-01-19 03:10:51,282 INFO L130 PetriNetUnfolder]: For 204/204 co-relation queries the response was YES. [2022-01-19 03:10:51,289 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5228 conditions, 3002 events. 885/3002 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 21441 event pairs, 197 based on Foata normal form. 0/2782 useless extension candidates. Maximal degree in co-relation 2591. Up to 545 conditions per place. [2022-01-19 03:10:51,298 INFO L132 encePairwiseOnDemand]: 140/158 looper letters, 120 selfloop transitions, 23 changer transitions 4/230 dead transitions. [2022-01-19 03:10:51,298 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 230 transitions, 858 flow [2022-01-19 03:10:51,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-19 03:10:51,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-01-19 03:10:51,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1510 transitions. [2022-01-19 03:10:51,301 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6371308016877637 [2022-01-19 03:10:51,301 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1510 transitions. [2022-01-19 03:10:51,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1510 transitions. [2022-01-19 03:10:51,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:10:51,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1510 transitions. [2022-01-19 03:10:51,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 100.66666666666667) internal successors, (1510), 15 states have internal predecessors, (1510), 0 states have call successors, (0), 0 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 03:10:51,306 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 158.0) internal successors, (2528), 16 states have internal predecessors, (2528), 0 states have call successors, (0), 0 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 03:10:51,306 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 158.0) internal successors, (2528), 16 states have internal predecessors, (2528), 0 states have call successors, (0), 0 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 03:10:51,306 INFO L186 Difference]: Start difference. First operand has 148 places, 137 transitions, 338 flow. Second operand 15 states and 1510 transitions. [2022-01-19 03:10:51,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 230 transitions, 858 flow [2022-01-19 03:10:51,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 230 transitions, 843 flow, removed 1 selfloop flow, removed 6 redundant places. [2022-01-19 03:10:51,310 INFO L242 Difference]: Finished difference. Result has 163 places, 153 transitions, 464 flow [2022-01-19 03:10:51,310 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=464, PETRI_PLACES=163, PETRI_TRANSITIONS=153} [2022-01-19 03:10:51,311 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 21 predicate places. [2022-01-19 03:10:51,311 INFO L470 AbstractCegarLoop]: Abstraction has has 163 places, 153 transitions, 464 flow [2022-01-19 03:10:51,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 93.75) internal successors, (1500), 16 states have internal predecessors, (1500), 0 states have call successors, (0), 0 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 03:10:51,312 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:10:51,312 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:10:51,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-19 03:10:51,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:10:51,530 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 03:10:51,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:10:51,530 INFO L85 PathProgramCache]: Analyzing trace with hash -2021703457, now seen corresponding path program 1 times [2022-01-19 03:10:51,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:10:51,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587834350] [2022-01-19 03:10:51,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:10:51,530 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:10:51,543 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-19 03:10:51,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [920861047] [2022-01-19 03:10:51,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:10:51,543 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:10:51,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:10:51,564 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 03:10:51,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-19 03:10:51,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:10:51,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-19 03:10:51,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 03:10:51,756 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:10:51,757 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 03:10:51,757 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:10:51,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587834350] [2022-01-19 03:10:51,757 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-19 03:10:51,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920861047] [2022-01-19 03:10:51,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920861047] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:10:51,757 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:10:51,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 03:10:51,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488902371] [2022-01-19 03:10:51,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:10:51,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 03:10:51,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:10:51,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 03:10:51,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 03:10:51,758 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 158 [2022-01-19 03:10:51,759 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 153 transitions, 464 flow. Second operand has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 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 03:10:51,759 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:10:51,759 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 158 [2022-01-19 03:10:51,759 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:10:51,801 INFO L129 PetriNetUnfolder]: 39/483 cut-off events. [2022-01-19 03:10:51,801 INFO L130 PetriNetUnfolder]: For 123/124 co-relation queries the response was YES. [2022-01-19 03:10:51,803 INFO L84 FinitePrefix]: Finished finitePrefix Result has 766 conditions, 483 events. 39/483 cut-off events. For 123/124 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1549 event pairs, 7 based on Foata normal form. 1/466 useless extension candidates. Maximal degree in co-relation 623. Up to 32 conditions per place. [2022-01-19 03:10:51,804 INFO L132 encePairwiseOnDemand]: 152/158 looper letters, 9 selfloop transitions, 5 changer transitions 0/151 dead transitions. [2022-01-19 03:10:51,804 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 151 transitions, 484 flow [2022-01-19 03:10:51,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 03:10:51,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 03:10:51,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2022-01-19 03:10:51,805 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9135021097046413 [2022-01-19 03:10:51,805 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 433 transitions. [2022-01-19 03:10:51,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 433 transitions. [2022-01-19 03:10:51,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:10:51,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 433 transitions. [2022-01-19 03:10:51,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 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 03:10:51,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 158.0) internal successors, (632), 4 states have internal predecessors, (632), 0 states have call successors, (0), 0 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 03:10:51,807 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 158.0) internal successors, (632), 4 states have internal predecessors, (632), 0 states have call successors, (0), 0 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 03:10:51,807 INFO L186 Difference]: Start difference. First operand has 163 places, 153 transitions, 464 flow. Second operand 3 states and 433 transitions. [2022-01-19 03:10:51,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 151 transitions, 484 flow [2022-01-19 03:10:51,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 151 transitions, 465 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-01-19 03:10:51,810 INFO L242 Difference]: Finished difference. Result has 161 places, 149 transitions, 450 flow [2022-01-19 03:10:51,810 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=450, PETRI_PLACES=161, PETRI_TRANSITIONS=149} [2022-01-19 03:10:51,811 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 19 predicate places. [2022-01-19 03:10:51,811 INFO L470 AbstractCegarLoop]: Abstraction has has 161 places, 149 transitions, 450 flow [2022-01-19 03:10:51,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 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 03:10:51,811 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:10:51,811 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:10:51,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-19 03:10:52,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:10:52,044 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 03:10:52,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:10:52,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1952781966, now seen corresponding path program 1 times [2022-01-19 03:10:52,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:10:52,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425453700] [2022-01-19 03:10:52,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:10:52,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:10:52,057 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-19 03:10:52,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [800844466] [2022-01-19 03:10:52,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:10:52,057 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:10:52,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:10:52,080 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 03:10:52,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-19 03:10:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:10:52,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-19 03:10:52,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 03:10:52,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:10:52,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 03:10:52,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:10:52,482 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:10:52,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425453700] [2022-01-19 03:10:52,482 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-19 03:10:52,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800844466] [2022-01-19 03:10:52,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800844466] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 03:10:52,482 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-19 03:10:52,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-01-19 03:10:52,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529553757] [2022-01-19 03:10:52,483 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-19 03:10:52,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 03:10:52,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:10:52,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 03:10:52,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-01-19 03:10:52,484 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 158 [2022-01-19 03:10:52,485 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 149 transitions, 450 flow. Second operand has 8 states, 8 states have (on average 137.875) internal successors, (1103), 8 states have internal predecessors, (1103), 0 states have call successors, (0), 0 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 03:10:52,485 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:10:52,485 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 158 [2022-01-19 03:10:52,485 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:10:52,592 INFO L129 PetriNetUnfolder]: 75/697 cut-off events. [2022-01-19 03:10:52,592 INFO L130 PetriNetUnfolder]: For 235/260 co-relation queries the response was YES. [2022-01-19 03:10:52,594 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1271 conditions, 697 events. 75/697 cut-off events. For 235/260 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2969 event pairs, 17 based on Foata normal form. 24/703 useless extension candidates. Maximal degree in co-relation 1088. Up to 52 conditions per place. [2022-01-19 03:10:52,595 INFO L132 encePairwiseOnDemand]: 152/158 looper letters, 28 selfloop transitions, 14 changer transitions 0/171 dead transitions. [2022-01-19 03:10:52,596 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 171 transitions, 611 flow [2022-01-19 03:10:52,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 03:10:52,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 03:10:52,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1252 transitions. [2022-01-19 03:10:52,598 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8804500703234881 [2022-01-19 03:10:52,598 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1252 transitions. [2022-01-19 03:10:52,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1252 transitions. [2022-01-19 03:10:52,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:10:52,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1252 transitions. [2022-01-19 03:10:52,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 139.11111111111111) internal successors, (1252), 9 states have internal predecessors, (1252), 0 states have call successors, (0), 0 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 03:10:52,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 158.0) internal successors, (1580), 10 states have internal predecessors, (1580), 0 states have call successors, (0), 0 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 03:10:52,603 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 158.0) internal successors, (1580), 10 states have internal predecessors, (1580), 0 states have call successors, (0), 0 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 03:10:52,603 INFO L186 Difference]: Start difference. First operand has 161 places, 149 transitions, 450 flow. Second operand 9 states and 1252 transitions. [2022-01-19 03:10:52,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 171 transitions, 611 flow [2022-01-19 03:10:52,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 171 transitions, 601 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 03:10:52,606 INFO L242 Difference]: Finished difference. Result has 170 places, 157 transitions, 520 flow [2022-01-19 03:10:52,606 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=520, PETRI_PLACES=170, PETRI_TRANSITIONS=157} [2022-01-19 03:10:52,607 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 28 predicate places. [2022-01-19 03:10:52,607 INFO L470 AbstractCegarLoop]: Abstraction has has 170 places, 157 transitions, 520 flow [2022-01-19 03:10:52,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 137.875) internal successors, (1103), 8 states have internal predecessors, (1103), 0 states have call successors, (0), 0 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 03:10:52,607 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:10:52,608 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 03:10:52,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-19 03:10:52,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-19 03:10:52,825 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 03:10:52,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:10:52,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1985769086, now seen corresponding path program 1 times [2022-01-19 03:10:52,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:10:52,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552189861] [2022-01-19 03:10:52,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:10:52,826 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:10:52,844 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-19 03:10:52,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [925322060] [2022-01-19 03:10:52,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:10:52,844 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:10:52,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:10:52,868 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 03:10:52,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-19 03:10:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:10:52,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-19 03:10:52,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 03:10:53,142 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:10:53,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 03:10:53,305 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:10:53,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:10:53,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552189861] [2022-01-19 03:10:53,305 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-19 03:10:53,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925322060] [2022-01-19 03:10:53,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925322060] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 03:10:53,306 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-19 03:10:53,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2022-01-19 03:10:53,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880419674] [2022-01-19 03:10:53,306 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-19 03:10:53,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-19 03:10:53,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:10:53,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-19 03:10:53,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2022-01-19 03:10:53,308 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 158 [2022-01-19 03:10:53,310 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 157 transitions, 520 flow. Second operand has 15 states, 15 states have (on average 137.53333333333333) internal successors, (2063), 15 states have internal predecessors, (2063), 0 states have call successors, (0), 0 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 03:10:53,310 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:10:53,310 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 158 [2022-01-19 03:10:53,310 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:10:53,638 INFO L129 PetriNetUnfolder]: 164/1534 cut-off events. [2022-01-19 03:10:53,638 INFO L130 PetriNetUnfolder]: For 687/721 co-relation queries the response was YES. [2022-01-19 03:10:53,646 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3070 conditions, 1534 events. 164/1534 cut-off events. For 687/721 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 8948 event pairs, 31 based on Foata normal form. 49/1535 useless extension candidates. Maximal degree in co-relation 2537. Up to 107 conditions per place. [2022-01-19 03:10:53,650 INFO L132 encePairwiseOnDemand]: 152/158 looper letters, 56 selfloop transitions, 30 changer transitions 0/215 dead transitions. [2022-01-19 03:10:53,651 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 215 transitions, 969 flow [2022-01-19 03:10:53,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-19 03:10:53,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-01-19 03:10:53,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2914 transitions. [2022-01-19 03:10:53,656 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8782399035563593 [2022-01-19 03:10:53,656 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 2914 transitions. [2022-01-19 03:10:53,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 2914 transitions. [2022-01-19 03:10:53,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:10:53,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 2914 transitions. [2022-01-19 03:10:53,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 138.76190476190476) internal successors, (2914), 21 states have internal predecessors, (2914), 0 states have call successors, (0), 0 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 03:10:53,668 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 158.0) internal successors, (3476), 22 states have internal predecessors, (3476), 0 states have call successors, (0), 0 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 03:10:53,669 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 158.0) internal successors, (3476), 22 states have internal predecessors, (3476), 0 states have call successors, (0), 0 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 03:10:53,669 INFO L186 Difference]: Start difference. First operand has 170 places, 157 transitions, 520 flow. Second operand 21 states and 2914 transitions. [2022-01-19 03:10:53,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 215 transitions, 969 flow [2022-01-19 03:10:53,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 215 transitions, 955 flow, removed 7 selfloop flow, removed 0 redundant places. [2022-01-19 03:10:53,677 INFO L242 Difference]: Finished difference. Result has 195 places, 174 transitions, 720 flow [2022-01-19 03:10:53,677 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=720, PETRI_PLACES=195, PETRI_TRANSITIONS=174} [2022-01-19 03:10:53,678 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 53 predicate places. [2022-01-19 03:10:53,678 INFO L470 AbstractCegarLoop]: Abstraction has has 195 places, 174 transitions, 720 flow [2022-01-19 03:10:53,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 137.53333333333333) internal successors, (2063), 15 states have internal predecessors, (2063), 0 states have call successors, (0), 0 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 03:10:53,679 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:10:53,679 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:10:53,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-19 03:10:53,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:10:53,898 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 03:10:53,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:10:53,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1197382044, now seen corresponding path program 1 times [2022-01-19 03:10:53,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:10:53,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327244257] [2022-01-19 03:10:53,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:10:53,899 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:10:53,917 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-19 03:10:53,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1165351682] [2022-01-19 03:10:53,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:10:53,918 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:10:53,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:10:53,927 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 03:10:53,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-19 03:10:54,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:10:54,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 21 conjunts are in the unsatisfiable core [2022-01-19 03:10:54,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 03:11:26,144 WARN L228 SmtUtils]: Spent 5.23s on a formula simplification that was a NOOP. DAG size: 5 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-01-19 03:12:27,213 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:12:27,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 03:12:46,895 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:12:46,895 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:12:46,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327244257] [2022-01-19 03:12:46,895 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-19 03:12:46,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165351682] [2022-01-19 03:12:46,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165351682] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 03:12:46,896 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-19 03:12:46,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 22 [2022-01-19 03:12:46,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702172362] [2022-01-19 03:12:46,896 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-19 03:12:46,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-19 03:12:46,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:12:46,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-19 03:12:46,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=369, Unknown=1, NotChecked=0, Total=462 [2022-01-19 03:12:46,899 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 158 [2022-01-19 03:12:46,930 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 174 transitions, 720 flow. Second operand has 22 states, 22 states have (on average 126.31818181818181) internal successors, (2779), 22 states have internal predecessors, (2779), 0 states have call successors, (0), 0 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 03:12:46,930 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:12:46,930 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 158 [2022-01-19 03:12:46,930 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:12:57,735 WARN L228 SmtUtils]: Spent 9.09s on a formula simplification. DAG size of input: 48 DAG size of output: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 03:13:08,760 WARN L228 SmtUtils]: Spent 9.84s on a formula simplification. DAG size of input: 51 DAG size of output: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 03:13:19,566 WARN L228 SmtUtils]: Spent 9.48s on a formula simplification. DAG size of input: 53 DAG size of output: 51 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 03:13:21,954 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-19 03:13:24,074 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-19 03:13:26,251 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-19 03:13:28,374 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-19 03:13:30,632 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-19 03:13:33,641 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-19 03:13:51,211 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-01-19 03:13:53,402 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-19 03:13:55,517 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-19 03:13:57,695 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-19 03:13:59,887 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-19 03:14:02,009 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-19 03:14:04,480 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-19 03:14:11,128 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-19 03:14:13,320 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-19 03:14:25,371 WARN L228 SmtUtils]: Spent 7.18s on a formula simplification. DAG size of input: 32 DAG size of output: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 03:14:27,572 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (mod (+ c_~next~0 1) 4294967296)) (.cse0 (mod c_~buffer_size~0 4294967296))) (let ((.cse3 (mod .cse4 .cse0))) (let ((.cse2 (mod .cse3 4294967296))) (let ((.cse1 (< 0 .cse2))) (and (< (mod c_~first~0 4294967296) .cse0) (< (mod (+ |c_t2Thread1of1ForFork1_removeLogElement_#t~post1#1| 1) 4294967296) .cse0) (= |c_ULTIMATE.start_initLog_~max#1| 10) .cse1 (or (not (< .cse2 .cse0)) (and (< 0 (mod (mod (mod (+ .cse3 1) 4294967296) .cse0) 4294967296)) (< .cse4 .cse0)) (not .cse1)) (= c_~buffer_size~0 10) (< 0 (mod c_~next~0 4294967296)) (= |c_ULTIMATE.start_initLog_#in~max#1| 10)))))) is different from false [2022-01-19 03:14:30,362 INFO L129 PetriNetUnfolder]: 185/2378 cut-off events. [2022-01-19 03:14:30,362 INFO L130 PetriNetUnfolder]: For 1127/1141 co-relation queries the response was YES. [2022-01-19 03:14:30,371 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4678 conditions, 2378 events. 185/2378 cut-off events. For 1127/1141 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 14481 event pairs, 41 based on Foata normal form. 23/2311 useless extension candidates. Maximal degree in co-relation 4609. Up to 166 conditions per place. [2022-01-19 03:14:30,375 INFO L132 encePairwiseOnDemand]: 144/158 looper letters, 42 selfloop transitions, 19 changer transitions 2/207 dead transitions. [2022-01-19 03:14:30,375 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 207 transitions, 978 flow [2022-01-19 03:14:30,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 03:14:30,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 03:14:30,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2294 transitions. [2022-01-19 03:14:30,379 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8066104078762306 [2022-01-19 03:14:30,379 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2294 transitions. [2022-01-19 03:14:30,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2294 transitions. [2022-01-19 03:14:30,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:14:30,381 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2294 transitions. [2022-01-19 03:14:30,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 127.44444444444444) internal successors, (2294), 18 states have internal predecessors, (2294), 0 states have call successors, (0), 0 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 03:14:30,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 158.0) internal successors, (3002), 19 states have internal predecessors, (3002), 0 states have call successors, (0), 0 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 03:14:30,388 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 158.0) internal successors, (3002), 19 states have internal predecessors, (3002), 0 states have call successors, (0), 0 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 03:14:30,388 INFO L186 Difference]: Start difference. First operand has 195 places, 174 transitions, 720 flow. Second operand 18 states and 2294 transitions. [2022-01-19 03:14:30,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 207 transitions, 978 flow [2022-01-19 03:14:30,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 207 transitions, 938 flow, removed 10 selfloop flow, removed 6 redundant places. [2022-01-19 03:14:30,396 INFO L242 Difference]: Finished difference. Result has 210 places, 183 transitions, 773 flow [2022-01-19 03:14:30,396 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=773, PETRI_PLACES=210, PETRI_TRANSITIONS=183} [2022-01-19 03:14:30,396 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 68 predicate places. [2022-01-19 03:14:30,397 INFO L470 AbstractCegarLoop]: Abstraction has has 210 places, 183 transitions, 773 flow [2022-01-19 03:14:30,397 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 126.31818181818181) internal successors, (2779), 22 states have internal predecessors, (2779), 0 states have call successors, (0), 0 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 03:14:30,397 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:14:30,398 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:14:30,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-19 03:14:30,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-19 03:14:30,616 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 03:14:30,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:14:30,616 INFO L85 PathProgramCache]: Analyzing trace with hash -2037958642, now seen corresponding path program 1 times [2022-01-19 03:14:30,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:14:30,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551998154] [2022-01-19 03:14:30,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:14:30,617 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:14:30,628 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-19 03:14:30,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [635936189] [2022-01-19 03:14:30,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:14:30,629 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:14:30,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:14:30,633 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 03:14:30,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-19 03:14:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:14:30,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 49 conjunts are in the unsatisfiable core [2022-01-19 03:14:30,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 03:14:58,393 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 57 [2022-01-19 03:14:58,404 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 60 [2022-01-19 03:14:58,418 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2022-01-19 03:15:20,786 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-01-19 03:15:20,915 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:15:20,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 03:15:38,847 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-01-19 03:15:38,859 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 03:15:38,859 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2022-01-19 03:15:38,880 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2022-01-19 03:15:38,903 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-01-19 03:15:38,940 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-01-19 03:15:39,032 INFO L353 Elim1Store]: treesize reduction 78, result has 24.3 percent of original size [2022-01-19 03:15:39,032 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 130 treesize of output 115 [2022-01-19 03:17:29,849 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:17:29,850 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:17:29,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551998154] [2022-01-19 03:17:29,850 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-19 03:17:29,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635936189] [2022-01-19 03:17:29,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635936189] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 03:17:29,850 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-19 03:17:29,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 46 [2022-01-19 03:17:29,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340012903] [2022-01-19 03:17:29,850 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-19 03:17:29,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-01-19 03:17:29,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:17:29,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-01-19 03:17:29,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1841, Unknown=30, NotChecked=0, Total=2070 [2022-01-19 03:17:29,854 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 158 [2022-01-19 03:17:29,856 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 183 transitions, 773 flow. Second operand has 46 states, 46 states have (on average 80.34782608695652) internal successors, (3696), 46 states have internal predecessors, (3696), 0 states have call successors, (0), 0 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 03:17:29,856 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:17:29,856 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 158 [2022-01-19 03:17:29,856 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:17:31,885 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-19 03:17:34,120 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 03:17:37,043 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-01-19 03:17:39,169 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-01-19 03:17:41,307 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-01-19 03:17:43,521 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-01-19 03:17:45,674 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-01-19 03:17:48,451 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-19 03:17:51,406 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-19 03:18:56,600 WARN L228 SmtUtils]: Spent 6.73s on a formula simplification. DAG size of input: 71 DAG size of output: 35 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 03:19:08,083 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (let ((.cse8 (mod .cse7 256))) (let ((.cse6 (<= .cse8 127))) (let ((.cse1 (mod c_~next~0 4294967296)) (.cse2 (mod (+ c_~first~0 1) 4294967296)) (.cse4 (or .cse6 (= .cse7 (+ (- 256) .cse8)))) (.cse5 (or (not .cse6) (= .cse7 .cse8)))) (and (let ((.cse0 (mod c_~buffer_size~0 4294967296))) (let ((.cse3 (mod (mod (mod (+ c_~next~0 1) 4294967296) .cse0) 4294967296))) (or (<= .cse0 .cse1) (= (mod c_~send~0 256) 0) (and (= .cse2 .cse3) .cse4 .cse5) (<= .cse3 0)))) (= (+ (- 1) |c_t1Thread1of1ForFork0_~i~0#1|) 0) (= |c_ULTIMATE.start_initLog_~max#1| 10) (= (mod .cse2 10) c_~next~0) (= c_~buffer_size~0 10) (or (not (< 0 .cse1)) (and (= .cse1 .cse2) .cse4 .cse5)) (= c_~first~0 0) (= |c_ULTIMATE.start_initLog_#in~max#1| 10)))))) is different from true [2022-01-19 03:19:15,492 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~next~0 4294967296)) (.cse11 (mod (+ c_~first~0 1) 4294967296)) (.cse7 (mod c_~first~0 4294967296)) (.cse8 (mod |c_t1Thread1of1ForFork0_~i~0#1| 256))) (let ((.cse9 (<= .cse8 127)) (.cse6 (select |c_#memory_int| |c_~#buffer~0.base|)) (.cse5 (<= .cse7 2147483647)) (.cse4 (= .cse0 .cse11))) (and (or (not (< 0 .cse0)) (let ((.cse2 (+ |c_t1Thread1of1ForFork0_#t~post3#1| 1))) (let ((.cse1 (mod .cse2 256))) (let ((.cse3 (<= .cse1 127))) (and (or (= (+ .cse1 (- 256)) .cse2) .cse3) .cse4 (or (= .cse1 .cse2) (not .cse3))))))) (or .cse5 (= c_~value~0 (select .cse6 (+ |c_~#buffer~0.offset| .cse7 (- 4294967296))))) (or (= .cse8 |c_t1Thread1of1ForFork0_~i~0#1|) (not .cse9)) (or (= (+ .cse8 (- 256)) |c_t1Thread1of1ForFork0_~i~0#1|) .cse9) (or (= c_~value~0 (select .cse6 (+ |c_~#buffer~0.offset| .cse7))) (not .cse5)) (let ((.cse10 (mod c_~buffer_size~0 4294967296))) (let ((.cse12 (mod (mod (mod (+ c_~next~0 1) 4294967296) .cse10) 4294967296))) (or (<= .cse10 .cse0) (= (mod c_~send~0 256) 0) (let ((.cse14 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (let ((.cse15 (mod .cse14 256))) (let ((.cse13 (<= .cse15 127))) (and (= .cse11 .cse12) (or .cse13 (= .cse14 (+ (- 256) .cse15))) (or (not .cse13) (= .cse14 .cse15)))))) (<= .cse12 0)))) .cse4 (= |c_ULTIMATE.start_initLog_~max#1| 10) (= c_~buffer_size~0 10) (= |c_ULTIMATE.start_initLog_#in~max#1| 10)))) is different from false [2022-01-19 03:19:31,349 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~next~0 4294967296)) (.cse8 (mod (+ c_~first~0 1) 4294967296)) (.cse5 (mod |c_t1Thread1of1ForFork0_~i~0#1| 256))) (let ((.cse6 (<= .cse5 127)) (.cse4 (= .cse0 .cse8))) (and (or (not (< 0 .cse0)) (let ((.cse2 (+ |c_t1Thread1of1ForFork0_#t~post3#1| 1))) (let ((.cse1 (mod .cse2 256))) (let ((.cse3 (<= .cse1 127))) (and (or (= (+ .cse1 (- 256)) .cse2) .cse3) .cse4 (or (= .cse1 .cse2) (not .cse3))))))) (or (= .cse5 |c_t1Thread1of1ForFork0_~i~0#1|) (not .cse6)) (or (= (+ .cse5 (- 256)) |c_t1Thread1of1ForFork0_~i~0#1|) .cse6) (let ((.cse7 (mod c_~buffer_size~0 4294967296))) (let ((.cse9 (mod (mod (mod (+ c_~next~0 1) 4294967296) .cse7) 4294967296))) (or (<= .cse7 .cse0) (= (mod c_~send~0 256) 0) (let ((.cse11 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (let ((.cse12 (mod .cse11 256))) (let ((.cse10 (<= .cse12 127))) (and (= .cse8 .cse9) (or .cse10 (= .cse11 (+ (- 256) .cse12))) (or (not .cse10) (= .cse11 .cse12)))))) (<= .cse9 0)))) .cse4 (= |c_ULTIMATE.start_initLog_~max#1| 10) (= c_~buffer_size~0 10) (= |c_ULTIMATE.start_initLog_#in~max#1| 10)))) is different from false [2022-01-19 03:19:43,864 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse19 (mod c_~first~0 4294967296))) (let ((.cse7 (mod |c_t2Thread1of1ForFork1_removeLogElement_#t~post1#1| 4294967296)) (.cse8 (<= .cse19 2147483647)) (.cse13 (mod |c_t1Thread1of1ForFork0_~i~0#1| 256)) (.cse6 (select |c_#memory_int| |c_~#buffer~0.base|))) (let ((.cse9 (select .cse6 (+ |c_~#buffer~0.offset| .cse19 (- 4294967296)))) (.cse14 (<= .cse13 127)) (.cse11 (select .cse6 (+ |c_~#buffer~0.offset| .cse19))) (.cse12 (not .cse8)) (.cse10 (mod c_~buffer_size~0 4294967296)) (.cse4 (mod (+ c_~first~0 1) 4294967296)) (.cse0 (mod c_~next~0 4294967296)) (.cse5 (<= .cse7 2147483647))) (and (or (not (< 0 .cse0)) (let ((.cse2 (+ |c_t1Thread1of1ForFork0_#t~post3#1| 1))) (let ((.cse1 (mod .cse2 256))) (let ((.cse3 (<= .cse1 127))) (and (or (= (+ .cse1 (- 256)) .cse2) .cse3) (= .cse0 .cse4) (or (= .cse1 .cse2) (not .cse3))))))) (= |c_t1Thread1of1ForFork0_~i~0#1| 0) (or (not .cse5) (= c_~value~0 (select .cse6 (+ |c_~#buffer~0.offset| .cse7)))) (or .cse8 (= c_~value~0 .cse9)) (or (= .cse9 |c_t1Thread1of1ForFork0_~i~0#1|) .cse8) (= (mod .cse4 .cse10) c_~next~0) (or (= .cse11 |c_t1Thread1of1ForFork0_~i~0#1|) .cse12) (or (= .cse13 |c_t1Thread1of1ForFork0_~i~0#1|) (not .cse14)) (or (= (+ .cse13 (- 256)) |c_t1Thread1of1ForFork0_~i~0#1|) .cse14) (or (= c_~value~0 .cse11) .cse12) (let ((.cse15 (mod (mod (mod (+ c_~next~0 1) 4294967296) .cse10) 4294967296))) (or (<= .cse10 .cse0) (= (mod c_~send~0 256) 0) (let ((.cse17 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (let ((.cse18 (mod .cse17 256))) (let ((.cse16 (<= .cse18 127))) (and (= .cse4 .cse15) (or .cse16 (= .cse17 (+ (- 256) .cse18))) (or (not .cse16) (= .cse17 .cse18)))))) (<= .cse15 0))) (= |c_t1Thread1of1ForFork0_#t~post3#1| 0) (= |c_ULTIMATE.start_initLog_~max#1| 10) (= (mod .cse4 10) c_~next~0) (= c_~buffer_size~0 10) (= .cse0 (mod (+ |c_t2Thread1of1ForFork1_removeLogElement_#t~post1#1| 1) 4294967296)) (or (= c_~value~0 (select .cse6 (+ |c_~#buffer~0.offset| .cse7 (- 4294967296)))) .cse5) (= c_~first~0 0) (= |c_ULTIMATE.start_initLog_#in~max#1| 10))))) is different from true [2022-01-19 03:19:46,080 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (mod |c_t2Thread1of1ForFork1_removeLogElement_#t~post1#1| 4294967296)) (.cse2 (mod (+ 4294967295 c_~first~0) 4294967296)) (.cse6 (mod |c_t1Thread1of1ForFork0_~i~0#1| 256))) (let ((.cse7 (<= .cse6 127)) (.cse0 (<= .cse2 2147483647)) (.cse3 (mod c_~next~0 4294967296)) (.cse1 (select |c_#memory_int| |c_~#buffer~0.base|)) (.cse4 (<= .cse5 2147483647))) (and (or (not .cse0) (= c_~value~0 (select .cse1 (+ |c_~#buffer~0.offset| .cse2)))) (= .cse3 (mod c_~first~0 4294967296)) (or (not .cse4) (= c_~value~0 (select .cse1 (+ |c_~#buffer~0.offset| .cse5)))) (or (= .cse6 |c_t1Thread1of1ForFork0_~i~0#1|) (not .cse7)) (let ((.cse9 (mod c_~buffer_size~0 4294967296))) (let ((.cse8 (mod (mod (mod (+ c_~next~0 1) 4294967296) .cse9) 4294967296))) (or (not (< .cse8 .cse9)) (let ((.cse11 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (let ((.cse12 (mod .cse11 256))) (let ((.cse10 (<= .cse12 127))) (and (= (mod (+ c_~first~0 1) 4294967296) .cse8) (or .cse10 (= .cse11 (+ (- 256) .cse12))) (or (not .cse10) (= .cse11 .cse12)))))) (not (< 0 .cse8))))) (or (= (+ .cse6 (- 256)) |c_t1Thread1of1ForFork0_~i~0#1|) .cse7) (or .cse0 (= c_~value~0 (select .cse1 (+ |c_~#buffer~0.offset| .cse2 (- 4294967296))))) (= |c_ULTIMATE.start_initLog_~max#1| 10) (= c_~buffer_size~0 10) (= .cse3 (mod (+ |c_t2Thread1of1ForFork1_removeLogElement_#t~post1#1| 1) 4294967296)) (or (= c_~value~0 (select .cse1 (+ |c_~#buffer~0.offset| .cse5 (- 4294967296)))) .cse4) (= |c_ULTIMATE.start_initLog_#in~max#1| 10)))) is different from false [2022-01-19 03:20:01,551 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse6 (mod |c_t1Thread1of1ForFork0_~i~0#1| 256))) (let ((.cse7 (<= .cse6 127)) (.cse5 (mod c_~buffer_size~0 4294967296)) (.cse4 (mod (+ c_~first~0 1) 4294967296)) (.cse0 (mod c_~next~0 4294967296))) (and (or (not (< 0 .cse0)) (let ((.cse2 (+ |c_t1Thread1of1ForFork0_#t~post3#1| 1))) (let ((.cse1 (mod .cse2 256))) (let ((.cse3 (<= .cse1 127))) (and (or (= (+ .cse1 (- 256)) .cse2) .cse3) (= .cse0 .cse4) (or (= .cse1 .cse2) (not .cse3))))))) (= |c_t1Thread1of1ForFork0_~i~0#1| 0) (= (mod .cse4 .cse5) c_~next~0) (or (= .cse6 |c_t1Thread1of1ForFork0_~i~0#1|) (not .cse7)) (or (= (+ .cse6 (- 256)) |c_t1Thread1of1ForFork0_~i~0#1|) .cse7) (let ((.cse8 (mod (mod (mod (+ c_~next~0 1) 4294967296) .cse5) 4294967296))) (or (<= .cse5 .cse0) (= (mod c_~send~0 256) 0) (let ((.cse10 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (let ((.cse11 (mod .cse10 256))) (let ((.cse9 (<= .cse11 127))) (and (= .cse4 .cse8) (or .cse9 (= .cse10 (+ (- 256) .cse11))) (or (not .cse9) (= .cse10 .cse11)))))) (<= .cse8 0))) (= |c_t1Thread1of1ForFork0_#t~post3#1| 0) (= |c_ULTIMATE.start_initLog_~max#1| 10) (= (mod .cse4 10) c_~next~0) (= c_~buffer_size~0 10) (= .cse0 (mod (+ |c_t2Thread1of1ForFork1_removeLogElement_#t~post1#1| 1) 4294967296)) (= c_~first~0 0) (= |c_ULTIMATE.start_initLog_#in~max#1| 10)))) is different from true [2022-01-19 03:20:03,733 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (mod |c_t1Thread1of1ForFork0_~i~0#1| 256))) (let ((.cse2 (<= .cse1 127)) (.cse0 (mod c_~next~0 4294967296))) (and (= .cse0 (mod c_~first~0 4294967296)) (or (= .cse1 |c_t1Thread1of1ForFork0_~i~0#1|) (not .cse2)) (let ((.cse4 (mod c_~buffer_size~0 4294967296))) (let ((.cse3 (mod (mod (mod (+ c_~next~0 1) 4294967296) .cse4) 4294967296))) (or (not (< .cse3 .cse4)) (let ((.cse6 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (let ((.cse7 (mod .cse6 256))) (let ((.cse5 (<= .cse7 127))) (and (= (mod (+ c_~first~0 1) 4294967296) .cse3) (or .cse5 (= .cse6 (+ (- 256) .cse7))) (or (not .cse5) (= .cse6 .cse7)))))) (not (< 0 .cse3))))) (or (= (+ .cse1 (- 256)) |c_t1Thread1of1ForFork0_~i~0#1|) .cse2) (= |c_ULTIMATE.start_initLog_~max#1| 10) (= c_~buffer_size~0 10) (= .cse0 (mod (+ |c_t2Thread1of1ForFork1_removeLogElement_#t~post1#1| 1) 4294967296)) (= |c_ULTIMATE.start_initLog_#in~max#1| 10)))) is different from false [2022-01-19 03:20:47,983 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-19 03:20:51,011 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-19 03:20:54,121 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-19 03:20:56,787 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-19 03:21:02,826 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-19 03:21:16,407 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-19 03:21:31,433 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-19 03:21:32,663 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-01-19 03:21:35,063 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-19 03:21:37,234 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-19 03:22:30,556 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-19 03:22:33,779 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-19 03:22:36,269 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-19 03:23:06,069 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-19 03:23:44,045 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-19 03:23:46,611 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-19 03:23:48,728 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-19 03:23:51,022 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-19 03:24:05,812 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-19 03:24:09,163 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-19 03:24:40,134 WARN L228 SmtUtils]: Spent 6.64s on a formula simplification. DAG size of input: 100 DAG size of output: 50 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 03:24:57,761 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] Received shutdown request... [2022-01-19 03:25:30,006 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-19 03:25:30,056 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-19 03:25:30,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2022-01-19 03:25:30,890 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2022-01-19 03:25:30,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-01-19 03:25:31,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-19 03:25:31,091 WARN L594 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantifier-free) to 125 known predicates. [2022-01-19 03:25:31,092 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (6 of 8 remaining) [2022-01-19 03:25:31,092 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (5 of 8 remaining) [2022-01-19 03:25:31,092 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2022-01-19 03:25:31,092 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2022-01-19 03:25:31,092 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2022-01-19 03:25:31,092 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2022-01-19 03:25:31,092 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2022-01-19 03:25:31,094 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 03:25:31,096 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 03:25:31,096 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 03:25:31,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 03:25:31 BasicIcfg [2022-01-19 03:25:31,098 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 03:25:31,098 INFO L158 Benchmark]: Toolchain (without parser) took 886475.99ms. Allocated memory was 467.7MB in the beginning and 845.2MB in the end (delta: 377.5MB). Free memory was 410.6MB in the beginning and 391.5MB in the end (delta: 19.1MB). Peak memory consumption was 398.5MB. Max. memory is 16.0GB. [2022-01-19 03:25:31,098 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 467.7MB. Free memory is still 428.4MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 03:25:31,098 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.32ms. Allocated memory was 467.7MB in the beginning and 679.5MB in the end (delta: 211.8MB). Free memory was 410.4MB in the beginning and 641.1MB in the end (delta: -230.6MB). Peak memory consumption was 8.2MB. Max. memory is 16.0GB. [2022-01-19 03:25:31,099 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.01ms. Allocated memory is still 679.5MB. Free memory was 641.1MB in the beginning and 638.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 03:25:31,099 INFO L158 Benchmark]: Boogie Preprocessor took 21.97ms. Allocated memory is still 679.5MB. Free memory was 638.8MB in the beginning and 636.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 03:25:31,099 INFO L158 Benchmark]: RCFGBuilder took 315.38ms. Allocated memory is still 679.5MB. Free memory was 636.9MB in the beginning and 620.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2022-01-19 03:25:31,099 INFO L158 Benchmark]: TraceAbstraction took 885733.49ms. Allocated memory was 679.5MB in the beginning and 845.2MB in the end (delta: 165.7MB). Free memory was 620.1MB in the beginning and 391.5MB in the end (delta: 228.5MB). Peak memory consumption was 394.5MB. Max. memory is 16.0GB. [2022-01-19 03:25:31,100 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 467.7MB. Free memory is still 428.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 367.32ms. Allocated memory was 467.7MB in the beginning and 679.5MB in the end (delta: 211.8MB). Free memory was 410.4MB in the beginning and 641.1MB in the end (delta: -230.6MB). Peak memory consumption was 8.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 33.01ms. Allocated memory is still 679.5MB. Free memory was 641.1MB in the beginning and 638.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 21.97ms. Allocated memory is still 679.5MB. Free memory was 638.8MB in the beginning and 636.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 315.38ms. Allocated memory is still 679.5MB. Free memory was 636.9MB in the beginning and 620.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 885733.49ms. Allocated memory was 679.5MB in the beginning and 845.2MB in the end (delta: 165.7MB). Free memory was 620.1MB in the beginning and 391.5MB in the end (delta: 228.5MB). Peak memory consumption was 394.5MB. 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 - TimeoutResultAtElement [Line: 749]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 125 known predicates. - TimeoutResultAtElement [Line: 763]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 125 known predicates. - TimeoutResultAtElement [Line: 764]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 125 known predicates. - TimeoutResultAtElement [Line: 714]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 125 known predicates. - TimeoutResultAtElement [Line: 731]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 125 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 226 locations, 8 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: 885.6s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 586.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 44 mSolverCounterUnknown, 1710 SdHoareTripleChecker+Valid, 113.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1710 mSDsluCounter, 1906 SdHoareTripleChecker+Invalid, 106.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 534 IncrementalHoareTripleChecker+Unchecked, 2063 mSDsCounter, 269 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3451 IncrementalHoareTripleChecker+Invalid, 4298 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 269 mSolverCounterUnsat, 184 mSDtfsCounter, 3451 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1883 GetRequests, 1633 SyntacticMatches, 3 SemanticMatches, 246 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 4016 ImplicationChecksByTransitivity, 597.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=773occurred in iteration=12, InterpolantAutomatonStates: 100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 294.3s InterpolantComputationTime, 1337 NumberOfCodeBlocks, 1337 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1869 ConstructedInterpolants, 7 QuantifiedInterpolants, 16766 SizeOfPredicates, 65 NumberOfNonLiveVariables, 3118 ConjunctsInSsa, 152 ConjunctsInUnsatCore, 17 InterpolantComputations, 9 PerfectInterpolantSequences, 27/227 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown