/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/heap-data/packet_filter.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:47:00,829 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:47:00,833 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:47:00,895 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:47:00,895 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:47:00,900 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:47:00,905 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:47:00,928 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:47:00,931 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:47:00,937 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:47:00,938 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:47:00,942 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:47:00,943 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:47:00,944 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:47:00,948 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:47:00,950 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:47:00,951 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:47:00,954 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:47:00,959 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:47:00,966 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:47:00,971 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:47:00,973 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:47:00,975 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:47:00,979 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:47:00,988 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:47:00,988 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:47:00,988 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:47:00,993 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:47:00,994 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:47:00,995 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:47:00,995 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:47:00,996 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:47:00,998 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:47:00,999 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:47:01,001 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:47:01,001 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:47:01,002 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:47:01,002 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:47:01,003 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:47:01,004 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:47:01,005 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:47:01,006 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-10-15 16:47:01,060 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:47:01,060 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:47:01,061 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:47:01,061 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:47:01,064 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:47:01,064 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:47:01,067 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:47:01,068 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:47:01,068 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:47:01,068 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:47:01,069 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:47:01,070 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:47:01,070 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:47:01,070 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:47:01,070 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:47:01,071 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:47:01,071 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:47:01,071 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:47:01,071 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:47:01,072 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:47:01,072 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:47:01,072 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:47:01,072 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:47:01,072 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:47:01,073 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:47:01,073 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:47:01,073 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:47:01,073 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:47:01,074 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:47:01,074 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:47:01,074 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-10-15 16:47:01,502 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:47:01,527 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:47:01,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:47:01,532 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:47:01,533 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:47:01,535 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/packet_filter.i [2022-10-15 16:47:01,608 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/995474615/9c7112dd54f94196adfc2fc8c45c80b2/FLAG3d068e46b [2022-10-15 16:47:02,367 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:47:02,368 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/packet_filter.i [2022-10-15 16:47:02,392 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/995474615/9c7112dd54f94196adfc2fc8c45c80b2/FLAG3d068e46b [2022-10-15 16:47:02,608 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/995474615/9c7112dd54f94196adfc2fc8c45c80b2 [2022-10-15 16:47:02,613 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:47:02,619 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:47:02,621 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:47:02,621 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:47:02,625 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:47:02,626 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:47:02" (1/1) ... [2022-10-15 16:47:02,627 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5760985c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:02, skipping insertion in model container [2022-10-15 16:47:02,628 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:47:02" (1/1) ... [2022-10-15 16:47:02,636 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:47:02,677 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:47:03,014 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/packet_filter.i[23925,23938] [2022-10-15 16:47:03,031 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/packet_filter.i[24159,24172] [2022-10-15 16:47:03,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:47:03,068 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:47:03,158 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/packet_filter.i[23925,23938] [2022-10-15 16:47:03,163 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/packet_filter.i[24159,24172] [2022-10-15 16:47:03,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:47:03,224 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:47:03,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:03 WrapperNode [2022-10-15 16:47:03,225 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:47:03,227 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:47:03,227 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:47:03,228 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:47:03,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:03" (1/1) ... [2022-10-15 16:47:03,264 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:03" (1/1) ... [2022-10-15 16:47:03,324 INFO L138 Inliner]: procedures = 130, calls = 86, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 160 [2022-10-15 16:47:03,325 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:47:03,326 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:47:03,326 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:47:03,326 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:47:03,337 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:03" (1/1) ... [2022-10-15 16:47:03,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:03" (1/1) ... [2022-10-15 16:47:03,361 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:03" (1/1) ... [2022-10-15 16:47:03,361 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:03" (1/1) ... [2022-10-15 16:47:03,390 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:03" (1/1) ... [2022-10-15 16:47:03,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:03" (1/1) ... [2022-10-15 16:47:03,408 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:03" (1/1) ... [2022-10-15 16:47:03,413 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:03" (1/1) ... [2022-10-15 16:47:03,420 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:47:03,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:47:03,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:47:03,422 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:47:03,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:03" (1/1) ... [2022-10-15 16:47:03,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:47:03,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:47:03,468 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-10-15 16:47:03,502 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-10-15 16:47:03,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 16:47:03,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:47:03,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-15 16:47:03,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:47:03,552 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_queue [2022-10-15 16:47:03,552 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_queue [2022-10-15 16:47:03,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-15 16:47:03,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 16:47:03,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-15 16:47:03,553 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_charp [2022-10-15 16:47:03,553 INFO L130 BoogieDeclarations]: Found specification of procedure send [2022-10-15 16:47:03,553 INFO L138 BoogieDeclarations]: Found implementation of procedure send [2022-10-15 16:47:03,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 16:47:03,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-10-15 16:47:03,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:47:03,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:47:03,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:47:03,697 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:47:03,700 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:47:04,553 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:47:04,571 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:47:04,572 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-10-15 16:47:04,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:47:04 BoogieIcfgContainer [2022-10-15 16:47:04,577 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:47:04,581 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:47:04,582 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:47:04,587 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:47:04,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:47:02" (1/3) ... [2022-10-15 16:47:04,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e44a40c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:47:04, skipping insertion in model container [2022-10-15 16:47:04,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:03" (2/3) ... [2022-10-15 16:47:04,590 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e44a40c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:47:04, skipping insertion in model container [2022-10-15 16:47:04,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:47:04" (3/3) ... [2022-10-15 16:47:04,592 INFO L112 eAbstractionObserver]: Analyzing ICFG packet_filter.i [2022-10-15 16:47:04,619 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:47:04,620 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 103 error locations. [2022-10-15 16:47:04,727 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:47:04,741 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@445ede5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:47:04,742 INFO L358 AbstractCegarLoop]: Starting to check reachability of 103 error locations. [2022-10-15 16:47:04,751 INFO L276 IsEmpty]: Start isEmpty. Operand has 209 states, 98 states have (on average 2.193877551020408) internal successors, (215), 201 states have internal predecessors, (215), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-15 16:47:04,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:47:04,769 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:04,770 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:47:04,771 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [append_to_queueErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2022-10-15 16:47:04,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:04,781 INFO L85 PathProgramCache]: Analyzing trace with hash 2221702, now seen corresponding path program 1 times [2022-10-15 16:47:04,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:04,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420027830] [2022-10-15 16:47:04,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:04,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:05,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:05,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:05,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420027830] [2022-10-15 16:47:05,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420027830] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:05,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:05,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:47:05,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772959535] [2022-10-15 16:47:05,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:05,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-15 16:47:05,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:05,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-15 16:47:05,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-15 16:47:05,102 INFO L87 Difference]: Start difference. First operand has 209 states, 98 states have (on average 2.193877551020408) internal successors, (215), 201 states have internal predecessors, (215), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:05,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:05,143 INFO L93 Difference]: Finished difference Result 209 states and 220 transitions. [2022-10-15 16:47:05,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-15 16:47:05,147 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-15 16:47:05,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:05,168 INFO L225 Difference]: With dead ends: 209 [2022-10-15 16:47:05,168 INFO L226 Difference]: Without dead ends: 207 [2022-10-15 16:47:05,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-15 16:47:05,181 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:05,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:47:05,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-10-15 16:47:05,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2022-10-15 16:47:05,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 97 states have (on average 2.1443298969072164) internal successors, (208), 199 states have internal predecessors, (208), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-15 16:47:05,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 218 transitions. [2022-10-15 16:47:05,269 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 218 transitions. Word has length 4 [2022-10-15 16:47:05,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:05,269 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 218 transitions. [2022-10-15 16:47:05,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:05,270 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 218 transitions. [2022-10-15 16:47:05,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 16:47:05,270 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:05,273 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 16:47:05,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:47:05,273 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [append_to_queueErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2022-10-15 16:47:05,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:05,274 INFO L85 PathProgramCache]: Analyzing trace with hash 68776687, now seen corresponding path program 1 times [2022-10-15 16:47:05,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:05,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674256557] [2022-10-15 16:47:05,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:05,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:05,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:05,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:05,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:05,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674256557] [2022-10-15 16:47:05,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674256557] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:05,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:05,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:47:05,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693746584] [2022-10-15 16:47:05,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:05,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:47:05,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:05,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:47:05,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:47:05,578 INFO L87 Difference]: Start difference. First operand 207 states and 218 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:05,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:05,905 INFO L93 Difference]: Finished difference Result 286 states and 305 transitions. [2022-10-15 16:47:05,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:47:05,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-10-15 16:47:05,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:05,910 INFO L225 Difference]: With dead ends: 286 [2022-10-15 16:47:05,911 INFO L226 Difference]: Without dead ends: 286 [2022-10-15 16:47:05,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:47:05,913 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 79 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:05,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 281 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 16:47:05,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-10-15 16:47:05,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 210. [2022-10-15 16:47:05,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 100 states have (on average 2.13) internal successors, (213), 202 states have internal predecessors, (213), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-15 16:47:05,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 223 transitions. [2022-10-15 16:47:05,938 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 223 transitions. Word has length 5 [2022-10-15 16:47:05,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:05,939 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 223 transitions. [2022-10-15 16:47:05,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:05,939 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 223 transitions. [2022-10-15 16:47:05,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 16:47:05,940 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:05,940 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 16:47:05,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:47:05,941 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [append_to_queueErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2022-10-15 16:47:05,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:05,942 INFO L85 PathProgramCache]: Analyzing trace with hash 68776688, now seen corresponding path program 1 times [2022-10-15 16:47:05,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:05,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778427421] [2022-10-15 16:47:05,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:05,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:06,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:06,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:06,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778427421] [2022-10-15 16:47:06,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778427421] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:06,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:06,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:47:06,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589434269] [2022-10-15 16:47:06,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:06,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:47:06,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:06,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:47:06,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:47:06,145 INFO L87 Difference]: Start difference. First operand 210 states and 223 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:06,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:06,452 INFO L93 Difference]: Finished difference Result 334 states and 360 transitions. [2022-10-15 16:47:06,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:47:06,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-10-15 16:47:06,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:06,456 INFO L225 Difference]: With dead ends: 334 [2022-10-15 16:47:06,456 INFO L226 Difference]: Without dead ends: 334 [2022-10-15 16:47:06,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:47:06,458 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 124 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:06,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 266 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 16:47:06,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2022-10-15 16:47:06,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 228. [2022-10-15 16:47:06,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 118 states have (on average 2.1016949152542375) internal successors, (248), 220 states have internal predecessors, (248), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-15 16:47:06,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 258 transitions. [2022-10-15 16:47:06,478 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 258 transitions. Word has length 5 [2022-10-15 16:47:06,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:06,479 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 258 transitions. [2022-10-15 16:47:06,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:06,479 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 258 transitions. [2022-10-15 16:47:06,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 16:47:06,480 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:06,480 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 16:47:06,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:47:06,481 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [append_to_queueErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2022-10-15 16:47:06,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:06,481 INFO L85 PathProgramCache]: Analyzing trace with hash 68776656, now seen corresponding path program 1 times [2022-10-15 16:47:06,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:06,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088089820] [2022-10-15 16:47:06,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:06,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:06,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:06,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:06,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088089820] [2022-10-15 16:47:06,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088089820] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:06,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:06,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:47:06,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23067552] [2022-10-15 16:47:06,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:06,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:47:06,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:06,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:47:06,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:47:06,544 INFO L87 Difference]: Start difference. First operand 228 states and 258 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:06,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:06,708 INFO L93 Difference]: Finished difference Result 222 states and 246 transitions. [2022-10-15 16:47:06,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:47:06,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-10-15 16:47:06,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:06,711 INFO L225 Difference]: With dead ends: 222 [2022-10-15 16:47:06,711 INFO L226 Difference]: Without dead ends: 222 [2022-10-15 16:47:06,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:47:06,713 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 17 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:06,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 294 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:47:06,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-10-15 16:47:06,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2022-10-15 16:47:06,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 118 states have (on average 2.0) internal successors, (236), 214 states have internal predecessors, (236), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-15 16:47:06,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 246 transitions. [2022-10-15 16:47:06,727 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 246 transitions. Word has length 5 [2022-10-15 16:47:06,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:06,727 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 246 transitions. [2022-10-15 16:47:06,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:06,728 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 246 transitions. [2022-10-15 16:47:06,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 16:47:06,728 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:06,728 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 16:47:06,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:47:06,729 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [append_to_queueErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2022-10-15 16:47:06,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:06,730 INFO L85 PathProgramCache]: Analyzing trace with hash 68776657, now seen corresponding path program 1 times [2022-10-15 16:47:06,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:06,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276858463] [2022-10-15 16:47:06,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:06,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:06,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:06,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:06,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276858463] [2022-10-15 16:47:06,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276858463] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:06,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:06,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:47:06,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496052907] [2022-10-15 16:47:06,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:06,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:47:06,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:06,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:47:06,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:47:06,855 INFO L87 Difference]: Start difference. First operand 222 states and 246 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:07,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:07,002 INFO L93 Difference]: Finished difference Result 216 states and 234 transitions. [2022-10-15 16:47:07,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:47:07,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-10-15 16:47:07,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:07,004 INFO L225 Difference]: With dead ends: 216 [2022-10-15 16:47:07,004 INFO L226 Difference]: Without dead ends: 216 [2022-10-15 16:47:07,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:47:07,006 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 11 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:07,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 299 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:47:07,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-10-15 16:47:07,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2022-10-15 16:47:07,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 118 states have (on average 1.8983050847457628) internal successors, (224), 208 states have internal predecessors, (224), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-15 16:47:07,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 234 transitions. [2022-10-15 16:47:07,017 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 234 transitions. Word has length 5 [2022-10-15 16:47:07,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:07,017 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 234 transitions. [2022-10-15 16:47:07,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:07,018 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 234 transitions. [2022-10-15 16:47:07,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-15 16:47:07,019 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:07,019 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:07,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 16:47:07,020 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [append_to_queueErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2022-10-15 16:47:07,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:07,020 INFO L85 PathProgramCache]: Analyzing trace with hash 227002635, now seen corresponding path program 1 times [2022-10-15 16:47:07,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:07,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901902277] [2022-10-15 16:47:07,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:07,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:07,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:07,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:07,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:07,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901902277] [2022-10-15 16:47:07,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901902277] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:07,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:07,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 16:47:07,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176044673] [2022-10-15 16:47:07,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:07,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:47:07,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:07,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:47:07,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:47:07,193 INFO L87 Difference]: Start difference. First operand 216 states and 234 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:07,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:07,365 INFO L93 Difference]: Finished difference Result 248 states and 269 transitions. [2022-10-15 16:47:07,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 16:47:07,366 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-10-15 16:47:07,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:07,368 INFO L225 Difference]: With dead ends: 248 [2022-10-15 16:47:07,368 INFO L226 Difference]: Without dead ends: 248 [2022-10-15 16:47:07,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-10-15 16:47:07,372 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 101 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:07,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 715 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:47:07,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-10-15 16:47:07,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 218. [2022-10-15 16:47:07,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 120 states have (on average 1.8833333333333333) internal successors, (226), 210 states have internal predecessors, (226), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-15 16:47:07,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 236 transitions. [2022-10-15 16:47:07,387 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 236 transitions. Word has length 8 [2022-10-15 16:47:07,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:07,388 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 236 transitions. [2022-10-15 16:47:07,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:07,388 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 236 transitions. [2022-10-15 16:47:07,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-15 16:47:07,389 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:07,389 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:07,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 16:47:07,389 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [append_to_queueErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2022-10-15 16:47:07,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:07,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1552853386, now seen corresponding path program 1 times [2022-10-15 16:47:07,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:07,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816063208] [2022-10-15 16:47:07,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:07,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:07,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:07,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:07,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816063208] [2022-10-15 16:47:07,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816063208] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:07,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:07,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:47:07,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95629227] [2022-10-15 16:47:07,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:07,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:47:07,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:07,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:47:07,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:47:07,479 INFO L87 Difference]: Start difference. First operand 218 states and 236 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:07,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:07,628 INFO L93 Difference]: Finished difference Result 256 states and 278 transitions. [2022-10-15 16:47:07,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:47:07,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-10-15 16:47:07,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:07,631 INFO L225 Difference]: With dead ends: 256 [2022-10-15 16:47:07,631 INFO L226 Difference]: Without dead ends: 256 [2022-10-15 16:47:07,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:47:07,633 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 38 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:07,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 281 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:47:07,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-10-15 16:47:07,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 220. [2022-10-15 16:47:07,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 122 states have (on average 1.8770491803278688) internal successors, (229), 212 states have internal predecessors, (229), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-15 16:47:07,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 239 transitions. [2022-10-15 16:47:07,643 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 239 transitions. Word has length 9 [2022-10-15 16:47:07,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:07,643 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 239 transitions. [2022-10-15 16:47:07,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:07,644 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 239 transitions. [2022-10-15 16:47:07,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-15 16:47:07,645 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:07,645 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:07,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 16:47:07,646 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [append_to_queueErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2022-10-15 16:47:07,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:07,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1552853385, now seen corresponding path program 1 times [2022-10-15 16:47:07,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:07,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450697418] [2022-10-15 16:47:07,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:07,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:07,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:07,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:07,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450697418] [2022-10-15 16:47:07,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450697418] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:07,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:07,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:47:07,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708053136] [2022-10-15 16:47:07,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:07,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:47:07,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:07,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:47:07,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:47:07,718 INFO L87 Difference]: Start difference. First operand 220 states and 239 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:07,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:07,943 INFO L93 Difference]: Finished difference Result 313 states and 339 transitions. [2022-10-15 16:47:07,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:47:07,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-10-15 16:47:07,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:07,947 INFO L225 Difference]: With dead ends: 313 [2022-10-15 16:47:07,947 INFO L226 Difference]: Without dead ends: 313 [2022-10-15 16:47:07,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:47:07,948 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 107 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:07,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 255 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:47:07,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-10-15 16:47:07,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 224. [2022-10-15 16:47:07,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 126 states have (on average 1.8571428571428572) internal successors, (234), 216 states have internal predecessors, (234), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-15 16:47:07,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 244 transitions. [2022-10-15 16:47:07,960 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 244 transitions. Word has length 9 [2022-10-15 16:47:07,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:07,960 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 244 transitions. [2022-10-15 16:47:07,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:07,961 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 244 transitions. [2022-10-15 16:47:07,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 16:47:07,961 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:07,962 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:07,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 16:47:07,962 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [append_to_queueErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2022-10-15 16:47:07,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:07,963 INFO L85 PathProgramCache]: Analyzing trace with hash 37696922, now seen corresponding path program 1 times [2022-10-15 16:47:07,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:07,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898266214] [2022-10-15 16:47:07,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:07,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:08,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:08,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:08,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898266214] [2022-10-15 16:47:08,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898266214] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:08,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:08,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 16:47:08,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032973214] [2022-10-15 16:47:08,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:08,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:47:08,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:08,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:47:08,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:47:08,073 INFO L87 Difference]: Start difference. First operand 224 states and 244 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:08,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:08,186 INFO L93 Difference]: Finished difference Result 228 states and 248 transitions. [2022-10-15 16:47:08,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 16:47:08,187 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-15 16:47:08,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:08,188 INFO L225 Difference]: With dead ends: 228 [2022-10-15 16:47:08,189 INFO L226 Difference]: Without dead ends: 228 [2022-10-15 16:47:08,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:47:08,191 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 9 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:08,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 752 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:47:08,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-10-15 16:47:08,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 226. [2022-10-15 16:47:08,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 128 states have (on average 1.84375) internal successors, (236), 218 states have internal predecessors, (236), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-15 16:47:08,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 246 transitions. [2022-10-15 16:47:08,201 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 246 transitions. Word has length 12 [2022-10-15 16:47:08,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:08,202 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 246 transitions. [2022-10-15 16:47:08,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:08,202 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 246 transitions. [2022-10-15 16:47:08,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 16:47:08,203 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:08,203 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:08,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 16:47:08,204 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [append_to_queueErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2022-10-15 16:47:08,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:08,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1168604157, now seen corresponding path program 1 times [2022-10-15 16:47:08,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:08,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796057911] [2022-10-15 16:47:08,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:08,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:08,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:08,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:08,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796057911] [2022-10-15 16:47:08,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796057911] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:08,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:08,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:47:08,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406323149] [2022-10-15 16:47:08,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:08,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:47:08,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:08,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:47:08,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:47:08,422 INFO L87 Difference]: Start difference. First operand 226 states and 246 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:08,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:08,617 INFO L93 Difference]: Finished difference Result 228 states and 247 transitions. [2022-10-15 16:47:08,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:47:08,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-10-15 16:47:08,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:08,619 INFO L225 Difference]: With dead ends: 228 [2022-10-15 16:47:08,620 INFO L226 Difference]: Without dead ends: 219 [2022-10-15 16:47:08,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:47:08,621 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 0 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:08,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 397 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:47:08,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-10-15 16:47:08,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2022-10-15 16:47:08,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 121 states have (on average 1.884297520661157) internal successors, (228), 211 states have internal predecessors, (228), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-15 16:47:08,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 238 transitions. [2022-10-15 16:47:08,629 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 238 transitions. Word has length 13 [2022-10-15 16:47:08,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:08,629 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 238 transitions. [2022-10-15 16:47:08,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:08,630 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 238 transitions. [2022-10-15 16:47:08,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-15 16:47:08,630 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:08,630 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:08,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 16:47:08,631 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [append_to_queueErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2022-10-15 16:47:08,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:08,632 INFO L85 PathProgramCache]: Analyzing trace with hash -564551008, now seen corresponding path program 1 times [2022-10-15 16:47:08,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:08,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839636663] [2022-10-15 16:47:08,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:08,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:08,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:08,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:08,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:08,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839636663] [2022-10-15 16:47:08,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839636663] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:08,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:08,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:47:08,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125879994] [2022-10-15 16:47:08,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:08,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:47:08,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:08,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:47:08,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:47:08,831 INFO L87 Difference]: Start difference. First operand 219 states and 238 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:08,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:08,990 INFO L93 Difference]: Finished difference Result 208 states and 226 transitions. [2022-10-15 16:47:08,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:47:08,990 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-10-15 16:47:08,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:08,993 INFO L225 Difference]: With dead ends: 208 [2022-10-15 16:47:08,993 INFO L226 Difference]: Without dead ends: 208 [2022-10-15 16:47:08,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:47:08,994 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 42 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:08,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 237 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:47:08,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-10-15 16:47:09,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 207. [2022-10-15 16:47:09,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 121 states have (on average 1.7768595041322315) internal successors, (215), 199 states have internal predecessors, (215), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-15 16:47:09,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 225 transitions. [2022-10-15 16:47:09,003 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 225 transitions. Word has length 17 [2022-10-15 16:47:09,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:09,003 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 225 transitions. [2022-10-15 16:47:09,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:09,004 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 225 transitions. [2022-10-15 16:47:09,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-15 16:47:09,004 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:09,004 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:09,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 16:47:09,005 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [append_to_queueErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2022-10-15 16:47:09,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:09,005 INFO L85 PathProgramCache]: Analyzing trace with hash -564551007, now seen corresponding path program 1 times [2022-10-15 16:47:09,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:09,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452282787] [2022-10-15 16:47:09,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:09,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:09,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:09,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:09,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:09,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452282787] [2022-10-15 16:47:09,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452282787] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:09,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:09,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:47:09,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882106898] [2022-10-15 16:47:09,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:09,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:47:09,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:09,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:47:09,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:47:09,170 INFO L87 Difference]: Start difference. First operand 207 states and 225 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:09,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:09,342 INFO L93 Difference]: Finished difference Result 196 states and 213 transitions. [2022-10-15 16:47:09,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:47:09,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-10-15 16:47:09,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:09,345 INFO L225 Difference]: With dead ends: 196 [2022-10-15 16:47:09,345 INFO L226 Difference]: Without dead ends: 196 [2022-10-15 16:47:09,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:47:09,346 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 30 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:09,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 241 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:47:09,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-10-15 16:47:09,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 195. [2022-10-15 16:47:09,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 121 states have (on average 1.6694214876033058) internal successors, (202), 187 states have internal predecessors, (202), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-15 16:47:09,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 212 transitions. [2022-10-15 16:47:09,355 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 212 transitions. Word has length 17 [2022-10-15 16:47:09,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:09,355 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 212 transitions. [2022-10-15 16:47:09,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:09,356 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 212 transitions. [2022-10-15 16:47:09,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-15 16:47:09,357 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:09,357 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:09,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-15 16:47:09,359 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [append_to_queueErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2022-10-15 16:47:09,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:09,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1178507631, now seen corresponding path program 1 times [2022-10-15 16:47:09,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:09,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214499401] [2022-10-15 16:47:09,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:09,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:09,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 16:47:09,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:09,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214499401] [2022-10-15 16:47:09,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214499401] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:09,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:09,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:47:09,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885908915] [2022-10-15 16:47:09,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:09,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:47:09,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:09,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:47:09,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:47:09,738 INFO L87 Difference]: Start difference. First operand 195 states and 212 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:09,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:09,961 INFO L93 Difference]: Finished difference Result 263 states and 290 transitions. [2022-10-15 16:47:09,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:47:09,962 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-10-15 16:47:09,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:09,964 INFO L225 Difference]: With dead ends: 263 [2022-10-15 16:47:09,964 INFO L226 Difference]: Without dead ends: 263 [2022-10-15 16:47:09,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:47:09,965 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 112 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:09,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 297 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:47:09,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-10-15 16:47:09,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 195. [2022-10-15 16:47:09,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 121 states have (on average 1.6611570247933884) internal successors, (201), 187 states have internal predecessors, (201), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-15 16:47:09,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 211 transitions. [2022-10-15 16:47:09,974 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 211 transitions. Word has length 22 [2022-10-15 16:47:09,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:09,975 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 211 transitions. [2022-10-15 16:47:09,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:09,975 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 211 transitions. [2022-10-15 16:47:09,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-15 16:47:09,976 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:09,976 INFO L195 NwaCegarLoop]: 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] [2022-10-15 16:47:09,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-15 16:47:09,977 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting append_to_queueErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [append_to_queueErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2022-10-15 16:47:09,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:09,978 INFO L85 PathProgramCache]: Analyzing trace with hash -140229129, now seen corresponding path program 1 times [2022-10-15 16:47:09,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:09,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771194561] [2022-10-15 16:47:09,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:09,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:10,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:10,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:10,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771194561] [2022-10-15 16:47:10,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771194561] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:10,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:10,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:47:10,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648578758] [2022-10-15 16:47:10,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:10,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:47:10,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:10,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:47:10,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:47:10,086 INFO L87 Difference]: Start difference. First operand 195 states and 211 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:10,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:10,189 INFO L93 Difference]: Finished difference Result 189 states and 205 transitions. [2022-10-15 16:47:10,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:47:10,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-10-15 16:47:10,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:10,194 INFO L225 Difference]: With dead ends: 189 [2022-10-15 16:47:10,194 INFO L226 Difference]: Without dead ends: 189 [2022-10-15 16:47:10,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:47:10,197 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 32 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:10,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 224 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:47:10,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-10-15 16:47:10,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2022-10-15 16:47:10,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 121 states have (on average 1.6115702479338843) internal successors, (195), 181 states have internal predecessors, (195), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-15 16:47:10,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 205 transitions. [2022-10-15 16:47:10,208 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 205 transitions. Word has length 26 [2022-10-15 16:47:10,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:10,209 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 205 transitions. [2022-10-15 16:47:10,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:10,210 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 205 transitions. [2022-10-15 16:47:10,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-15 16:47:10,215 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:10,215 INFO L195 NwaCegarLoop]: 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] [2022-10-15 16:47:10,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-15 16:47:10,216 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting append_to_queueErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [append_to_queueErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2022-10-15 16:47:10,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:10,216 INFO L85 PathProgramCache]: Analyzing trace with hash -140229128, now seen corresponding path program 1 times [2022-10-15 16:47:10,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:10,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254063885] [2022-10-15 16:47:10,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:10,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:10,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:10,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:10,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:10,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254063885] [2022-10-15 16:47:10,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254063885] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:10,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:10,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-15 16:47:10,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869029458] [2022-10-15 16:47:10,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:10,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 16:47:10,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:10,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 16:47:10,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-15 16:47:10,552 INFO L87 Difference]: Start difference. First operand 189 states and 205 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:10,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:10,766 INFO L93 Difference]: Finished difference Result 305 states and 335 transitions. [2022-10-15 16:47:10,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 16:47:10,767 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-10-15 16:47:10,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:10,769 INFO L225 Difference]: With dead ends: 305 [2022-10-15 16:47:10,769 INFO L226 Difference]: Without dead ends: 305 [2022-10-15 16:47:10,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-10-15 16:47:10,770 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 102 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:10,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 1139 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:47:10,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-10-15 16:47:10,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 213. [2022-10-15 16:47:10,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 145 states have (on average 1.5241379310344827) internal successors, (221), 205 states have internal predecessors, (221), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-15 16:47:10,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 231 transitions. [2022-10-15 16:47:10,781 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 231 transitions. Word has length 26 [2022-10-15 16:47:10,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:10,781 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 231 transitions. [2022-10-15 16:47:10,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:10,782 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 231 transitions. [2022-10-15 16:47:10,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-15 16:47:10,783 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:10,783 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:10,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-15 16:47:10,783 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [append_to_queueErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2022-10-15 16:47:10,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:10,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1858037207, now seen corresponding path program 1 times [2022-10-15 16:47:10,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:10,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548450218] [2022-10-15 16:47:10,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:10,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:10,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:11,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:11,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:11,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548450218] [2022-10-15 16:47:11,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548450218] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:47:11,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351136387] [2022-10-15 16:47:11,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:11,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:47:11,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:47:11,387 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-10-15 16:47:11,394 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-10-15 16:47:11,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:11,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 37 conjunts are in the unsatisfiable core [2022-10-15 16:47:11,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:47:11,608 INFO L390 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 10 treesize of output 8 [2022-10-15 16:47:11,655 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 16:47:11,656 INFO L390 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-10-15 16:47:11,675 INFO L390 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 5 treesize of output 3 [2022-10-15 16:47:11,694 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 16:47:11,694 INFO L390 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-10-15 16:47:11,702 INFO L390 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 5 treesize of output 3 [2022-10-15 16:47:11,788 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 16:47:11,788 INFO L390 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 1 case distinctions, treesize of input 18 treesize of output 24 [2022-10-15 16:47:11,814 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 16:47:11,814 INFO L390 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 1 case distinctions, treesize of input 18 treesize of output 24 [2022-10-15 16:47:11,862 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 16:47:11,862 INFO L390 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 1 case distinctions, treesize of input 18 treesize of output 24 [2022-10-15 16:47:11,906 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 16:47:11,907 INFO L390 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 1 case distinctions, treesize of input 18 treesize of output 24 [2022-10-15 16:47:12,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 16:47:12,292 INFO L356 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-10-15 16:47:12,293 INFO L390 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 3 case distinctions, treesize of input 42 treesize of output 55 [2022-10-15 16:47:12,445 INFO L390 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 15 treesize of output 7 [2022-10-15 16:47:12,451 INFO L390 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 15 treesize of output 7 [2022-10-15 16:47:12,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:12,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:47:12,598 INFO L390 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 84 treesize of output 80 [2022-10-15 16:47:12,815 INFO L390 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 10 treesize of output 8 [2022-10-15 16:47:12,838 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_receive_~#packet~0#1.base_24| Int)) (or (forall ((v_ArrVal_279 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_receive_~#packet~0#1.base_24| v_ArrVal_279) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (= |v_ULTIMATE.start_receive_~#packet~0#1.base_24| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|))) (forall ((|v_ULTIMATE.start_receive_~#packet~0#1.base_24| Int)) (or (= |v_ULTIMATE.start_receive_~#packet~0#1.base_24| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) (forall ((v_ArrVal_278 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_receive_~#packet~0#1.base_24| v_ArrVal_278) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))))) is different from false [2022-10-15 16:47:12,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-10-15 16:47:12,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351136387] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:47:12,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:47:12,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 17 [2022-10-15 16:47:12,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634584652] [2022-10-15 16:47:12,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:47:12,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-10-15 16:47:12,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:12,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-10-15 16:47:12,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=187, Unknown=2, NotChecked=28, Total=272 [2022-10-15 16:47:12,889 INFO L87 Difference]: Start difference. First operand 213 states and 231 transitions. Second operand has 17 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:12,903 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (forall ((|v_ULTIMATE.start_receive_~#packet~0#1.base_24| Int)) (or (forall ((v_ArrVal_279 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_receive_~#packet~0#1.base_24| v_ArrVal_279) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (= |v_ULTIMATE.start_receive_~#packet~0#1.base_24| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (forall ((|v_ULTIMATE.start_receive_~#packet~0#1.base_24| Int)) (or (= |v_ULTIMATE.start_receive_~#packet~0#1.base_24| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) (forall ((v_ArrVal_278 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_receive_~#packet~0#1.base_24| v_ArrVal_278) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) 1)) is different from false [2022-10-15 16:47:13,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:13,314 INFO L93 Difference]: Finished difference Result 247 states and 269 transitions. [2022-10-15 16:47:13,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-15 16:47:13,315 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-10-15 16:47:13,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:13,316 INFO L225 Difference]: With dead ends: 247 [2022-10-15 16:47:13,317 INFO L226 Difference]: Without dead ends: 247 [2022-10-15 16:47:13,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=266, Unknown=3, NotChecked=70, Total=420 [2022-10-15 16:47:13,318 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 67 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 412 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:13,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 1325 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 309 Invalid, 0 Unknown, 412 Unchecked, 0.3s Time] [2022-10-15 16:47:13,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-10-15 16:47:13,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 244. [2022-10-15 16:47:13,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 176 states have (on average 1.4545454545454546) internal successors, (256), 236 states have internal predecessors, (256), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-15 16:47:13,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 266 transitions. [2022-10-15 16:47:13,326 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 266 transitions. Word has length 25 [2022-10-15 16:47:13,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:13,327 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 266 transitions. [2022-10-15 16:47:13,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:13,327 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 266 transitions. [2022-10-15 16:47:13,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-15 16:47:13,328 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:13,328 INFO L195 NwaCegarLoop]: 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] [2022-10-15 16:47:13,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-10-15 16:47:13,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-10-15 16:47:13,543 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting append_to_queueErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [append_to_queueErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2022-10-15 16:47:13,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:13,544 INFO L85 PathProgramCache]: Analyzing trace with hash -957877578, now seen corresponding path program 1 times [2022-10-15 16:47:13,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:13,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710155342] [2022-10-15 16:47:13,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:13,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:13,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:13,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:13,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710155342] [2022-10-15 16:47:13,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710155342] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:13,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:13,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:47:13,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843289976] [2022-10-15 16:47:13,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:13,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:47:13,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:13,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:47:13,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:47:13,670 INFO L87 Difference]: Start difference. First operand 244 states and 266 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:13,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:13,786 INFO L93 Difference]: Finished difference Result 241 states and 263 transitions. [2022-10-15 16:47:13,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:47:13,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-10-15 16:47:13,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:13,788 INFO L225 Difference]: With dead ends: 241 [2022-10-15 16:47:13,788 INFO L226 Difference]: Without dead ends: 241 [2022-10-15 16:47:13,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:47:13,790 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 3 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:13,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 256 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:47:13,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-10-15 16:47:13,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2022-10-15 16:47:13,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 176 states have (on average 1.4375) internal successors, (253), 233 states have internal predecessors, (253), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-15 16:47:13,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 263 transitions. [2022-10-15 16:47:13,799 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 263 transitions. Word has length 26 [2022-10-15 16:47:13,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:13,799 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 263 transitions. [2022-10-15 16:47:13,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:13,799 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 263 transitions. [2022-10-15 16:47:13,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-15 16:47:13,802 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:13,803 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-15 16:47:13,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-10-15 16:47:13,803 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [append_to_queueErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2022-10-15 16:47:13,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:13,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1764579048, now seen corresponding path program 1 times [2022-10-15 16:47:13,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:13,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321813875] [2022-10-15 16:47:13,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:13,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:13,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:14,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 16:47:14,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:14,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321813875] [2022-10-15 16:47:14,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321813875] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:14,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:14,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:47:14,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422710412] [2022-10-15 16:47:14,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:14,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:47:14,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:14,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:47:14,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:47:14,055 INFO L87 Difference]: Start difference. First operand 241 states and 263 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:14,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:14,306 INFO L93 Difference]: Finished difference Result 305 states and 336 transitions. [2022-10-15 16:47:14,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:47:14,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-10-15 16:47:14,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:14,309 INFO L225 Difference]: With dead ends: 305 [2022-10-15 16:47:14,309 INFO L226 Difference]: Without dead ends: 305 [2022-10-15 16:47:14,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:47:14,310 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 80 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:14,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 295 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:47:14,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-10-15 16:47:14,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 241. [2022-10-15 16:47:14,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 176 states have (on average 1.4318181818181819) internal successors, (252), 233 states have internal predecessors, (252), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-15 16:47:14,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 262 transitions. [2022-10-15 16:47:14,319 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 262 transitions. Word has length 26 [2022-10-15 16:47:14,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:14,320 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 262 transitions. [2022-10-15 16:47:14,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:14,320 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 262 transitions. [2022-10-15 16:47:14,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-15 16:47:14,321 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:14,321 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-15 16:47:14,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-10-15 16:47:14,322 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [append_to_queueErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2022-10-15 16:47:14,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:14,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1825458104, now seen corresponding path program 1 times [2022-10-15 16:47:14,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:14,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78822587] [2022-10-15 16:47:14,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:14,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:14,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:14,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:14,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78822587] [2022-10-15 16:47:14,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78822587] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:47:14,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094366994] [2022-10-15 16:47:14,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:14,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:47:14,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:47:14,721 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-10-15 16:47:14,740 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-10-15 16:47:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:14,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 38 conjunts are in the unsatisfiable core [2022-10-15 16:47:14,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:47:14,855 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 16:47:14,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-10-15 16:47:14,877 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-15 16:47:14,878 INFO L390 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-10-15 16:47:14,911 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 16:47:14,912 INFO L390 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-10-15 16:47:14,917 INFO L390 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 5 treesize of output 3 [2022-10-15 16:47:14,934 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 16:47:14,934 INFO L390 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-10-15 16:47:14,942 INFO L390 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 5 treesize of output 3 [2022-10-15 16:47:15,007 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 16:47:15,008 INFO L390 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 1 case distinctions, treesize of input 18 treesize of output 24 [2022-10-15 16:47:15,025 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 16:47:15,025 INFO L390 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 1 case distinctions, treesize of input 18 treesize of output 24 [2022-10-15 16:47:15,065 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 16:47:15,066 INFO L390 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 1 case distinctions, treesize of input 18 treesize of output 24 [2022-10-15 16:47:15,084 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 16:47:15,084 INFO L390 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 1 case distinctions, treesize of input 18 treesize of output 24 [2022-10-15 16:47:15,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-10-15 16:47:15,294 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-10-15 16:47:15,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 42 [2022-10-15 16:47:15,377 INFO L390 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 15 treesize of output 7 [2022-10-15 16:47:15,380 INFO L390 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 15 treesize of output 7 [2022-10-15 16:47:15,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:15,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:47:15,515 INFO L390 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 84 treesize of output 80 [2022-10-15 16:47:15,703 WARN L833 $PredicateComparison]: unable to prove that (and (or (and (forall ((v_ArrVal_410 (Array Int Int)) (|ULTIMATE.start_receive_~#packet~0#1.base| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_410) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (forall ((v_ArrVal_409 (Array Int Int)) (|ULTIMATE.start_receive_~#packet~0#1.base| Int)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_409) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) (not (= |c_ULTIMATE.start_main_~#new_packet~0#1.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|))) (forall ((|ULTIMATE.start_receive_~#packet~0#1.base| Int)) (or (forall ((v_ArrVal_409 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_409) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |ULTIMATE.start_receive_~#packet~0#1.base|))) (forall ((|ULTIMATE.start_receive_~#packet~0#1.base| Int)) (or (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |ULTIMATE.start_receive_~#packet~0#1.base|) (forall ((v_ArrVal_410 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_410) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))))) is different from false [2022-10-15 16:47:15,751 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((|v_ULTIMATE.start_main_~#new_packet~0#1.base_46| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#new_packet~0#1.base_46|) 0))))) (and (or (forall ((v_ArrVal_410 (Array Int Int)) (|ULTIMATE.start_receive_~#packet~0#1.base| Int)) (or (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |ULTIMATE.start_receive_~#packet~0#1.base|) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_410) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) .cse0) (or (forall ((v_ArrVal_409 (Array Int Int)) (|ULTIMATE.start_receive_~#packet~0#1.base| Int)) (or (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |ULTIMATE.start_receive_~#packet~0#1.base|) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_409) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) .cse0) (or (and (forall ((v_ArrVal_410 (Array Int Int)) (|ULTIMATE.start_receive_~#packet~0#1.base| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_410) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (forall ((v_ArrVal_409 (Array Int Int)) (|ULTIMATE.start_receive_~#packet~0#1.base| Int)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_409) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) 0))))) is different from false [2022-10-15 16:47:15,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-10-15 16:47:15,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094366994] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:47:15,820 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:47:15,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 10] total 17 [2022-10-15 16:47:15,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269091516] [2022-10-15 16:47:15,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:47:15,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-10-15 16:47:15,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:15,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-10-15 16:47:15,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=164, Unknown=2, NotChecked=54, Total=272 [2022-10-15 16:47:15,822 INFO L87 Difference]: Start difference. First operand 241 states and 262 transitions. Second operand has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:15,850 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_main_~#new_packet~0#1.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|))) (let ((.cse1 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (.cse0 (not .cse4)) (.cse3 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (.cse2 (= |c_ULTIMATE.start_receive_~#packet~0#1.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) 1) (or (and (forall ((v_ArrVal_410 (Array Int Int)) (|ULTIMATE.start_receive_~#packet~0#1.base| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_410) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (forall ((v_ArrVal_409 (Array Int Int)) (|ULTIMATE.start_receive_~#packet~0#1.base| Int)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_409) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) .cse0) .cse1 (or .cse2 (and .cse1 .cse3)) (forall ((|ULTIMATE.start_receive_~#packet~0#1.base| Int)) (or (forall ((v_ArrVal_409 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_409) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |ULTIMATE.start_receive_~#packet~0#1.base|))) .cse0 (forall ((|ULTIMATE.start_receive_~#packet~0#1.base| Int)) (or (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |ULTIMATE.start_receive_~#packet~0#1.base|) (forall ((v_ArrVal_410 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_410) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)))) .cse3 (or (not .cse2) .cse4)))) is different from false [2022-10-15 16:47:16,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:16,222 INFO L93 Difference]: Finished difference Result 248 states and 269 transitions. [2022-10-15 16:47:16,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-15 16:47:16,223 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-10-15 16:47:16,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:16,225 INFO L225 Difference]: With dead ends: 248 [2022-10-15 16:47:16,225 INFO L226 Difference]: Without dead ends: 248 [2022-10-15 16:47:16,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=255, Unknown=3, NotChecked=108, Total=462 [2022-10-15 16:47:16,227 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 60 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 181 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:16,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 992 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 239 Invalid, 0 Unknown, 181 Unchecked, 0.2s Time] [2022-10-15 16:47:16,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-10-15 16:47:16,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 245. [2022-10-15 16:47:16,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 180 states have (on average 1.4222222222222223) internal successors, (256), 237 states have internal predecessors, (256), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-15 16:47:16,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 266 transitions. [2022-10-15 16:47:16,235 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 266 transitions. Word has length 29 [2022-10-15 16:47:16,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:16,236 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 266 transitions. [2022-10-15 16:47:16,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:16,236 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 266 transitions. [2022-10-15 16:47:16,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-15 16:47:16,237 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:16,237 INFO L195 NwaCegarLoop]: 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] [2022-10-15 16:47:16,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-15 16:47:16,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:47:16,451 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting append_to_queueErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [append_to_queueErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2022-10-15 16:47:16,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:16,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1468622266, now seen corresponding path program 1 times [2022-10-15 16:47:16,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:16,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605818548] [2022-10-15 16:47:16,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:16,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:16,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:16,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:16,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605818548] [2022-10-15 16:47:16,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605818548] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:16,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:16,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:47:16,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875200175] [2022-10-15 16:47:16,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:16,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:47:16,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:16,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:47:16,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:47:16,647 INFO L87 Difference]: Start difference. First operand 245 states and 266 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:16,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:16,770 INFO L93 Difference]: Finished difference Result 242 states and 263 transitions. [2022-10-15 16:47:16,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:47:16,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-10-15 16:47:16,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:16,772 INFO L225 Difference]: With dead ends: 242 [2022-10-15 16:47:16,772 INFO L226 Difference]: Without dead ends: 242 [2022-10-15 16:47:16,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:47:16,773 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 49 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:16,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 223 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:47:16,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-10-15 16:47:16,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2022-10-15 16:47:16,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 180 states have (on average 1.4055555555555554) internal successors, (253), 234 states have internal predecessors, (253), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-15 16:47:16,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 263 transitions. [2022-10-15 16:47:16,781 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 263 transitions. Word has length 30 [2022-10-15 16:47:16,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:16,781 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 263 transitions. [2022-10-15 16:47:16,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:16,782 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 263 transitions. [2022-10-15 16:47:16,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-15 16:47:16,783 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:16,783 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-15 16:47:16,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-10-15 16:47:16,783 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [append_to_queueErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2022-10-15 16:47:16,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:16,784 INFO L85 PathProgramCache]: Analyzing trace with hash 754625951, now seen corresponding path program 1 times [2022-10-15 16:47:16,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:16,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929062596] [2022-10-15 16:47:16,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:16,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:16,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:17,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:17,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:17,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929062596] [2022-10-15 16:47:17,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929062596] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:47:17,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119531173] [2022-10-15 16:47:17,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:17,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:47:17,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:47:17,514 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-10-15 16:47:17,542 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-10-15 16:47:17,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:17,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 37 conjunts are in the unsatisfiable core [2022-10-15 16:47:17,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:47:18,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:18,377 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 16:47:18,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119531173] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:18,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 16:47:18,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 15 [2022-10-15 16:47:18,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282522058] [2022-10-15 16:47:18,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:18,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 16:47:18,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:18,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 16:47:18,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-10-15 16:47:18,379 INFO L87 Difference]: Start difference. First operand 242 states and 263 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:18,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:18,390 INFO L93 Difference]: Finished difference Result 252 states and 275 transitions. [2022-10-15 16:47:18,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 16:47:18,391 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-10-15 16:47:18,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:18,392 INFO L225 Difference]: With dead ends: 252 [2022-10-15 16:47:18,392 INFO L226 Difference]: Without dead ends: 243 [2022-10-15 16:47:18,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-10-15 16:47:18,393 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 14 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 314 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:18,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 547 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 314 Unchecked, 0.0s Time] [2022-10-15 16:47:18,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-10-15 16:47:18,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 237. [2022-10-15 16:47:18,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 175 states have (on average 1.4114285714285715) internal successors, (247), 229 states have internal predecessors, (247), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-15 16:47:18,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 257 transitions. [2022-10-15 16:47:18,401 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 257 transitions. Word has length 30 [2022-10-15 16:47:18,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:18,401 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 257 transitions. [2022-10-15 16:47:18,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:18,401 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 257 transitions. [2022-10-15 16:47:18,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-10-15 16:47:18,402 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:18,402 INFO L195 NwaCegarLoop]: 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] [2022-10-15 16:47:18,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-10-15 16:47:18,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:47:18,618 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting append_to_queueErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [append_to_queueErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2022-10-15 16:47:18,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:18,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1105963526, now seen corresponding path program 1 times [2022-10-15 16:47:18,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:18,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237783585] [2022-10-15 16:47:18,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:18,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:18,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:18,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:18,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:18,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237783585] [2022-10-15 16:47:18,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237783585] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:18,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:18,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:47:18,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842696945] [2022-10-15 16:47:18,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:18,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:47:18,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:18,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:47:18,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:47:18,710 INFO L87 Difference]: Start difference. First operand 237 states and 257 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:18,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:18,824 INFO L93 Difference]: Finished difference Result 233 states and 253 transitions. [2022-10-15 16:47:18,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:47:18,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-10-15 16:47:18,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:18,827 INFO L225 Difference]: With dead ends: 233 [2022-10-15 16:47:18,827 INFO L226 Difference]: Without dead ends: 233 [2022-10-15 16:47:18,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:47:18,828 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 16 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:18,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 224 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:47:18,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-10-15 16:47:18,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2022-10-15 16:47:18,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 175 states have (on average 1.3885714285714286) internal successors, (243), 225 states have internal predecessors, (243), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-15 16:47:18,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 253 transitions. [2022-10-15 16:47:18,836 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 253 transitions. Word has length 33 [2022-10-15 16:47:18,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:18,836 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 253 transitions. [2022-10-15 16:47:18,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:18,837 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 253 transitions. [2022-10-15 16:47:18,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-10-15 16:47:18,837 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:18,837 INFO L195 NwaCegarLoop]: 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] [2022-10-15 16:47:18,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-10-15 16:47:18,838 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting append_to_queueErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [append_to_queueErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2022-10-15 16:47:18,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:18,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1105963525, now seen corresponding path program 1 times [2022-10-15 16:47:18,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:18,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376222897] [2022-10-15 16:47:18,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:18,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:18,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:18,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:18,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:18,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376222897] [2022-10-15 16:47:18,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376222897] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:18,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:18,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:47:18,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173318268] [2022-10-15 16:47:18,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:18,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:47:18,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:18,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:47:18,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:47:18,980 INFO L87 Difference]: Start difference. First operand 233 states and 253 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:19,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:19,095 INFO L93 Difference]: Finished difference Result 229 states and 249 transitions. [2022-10-15 16:47:19,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:47:19,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-10-15 16:47:19,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:19,097 INFO L225 Difference]: With dead ends: 229 [2022-10-15 16:47:19,097 INFO L226 Difference]: Without dead ends: 229 [2022-10-15 16:47:19,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:47:19,098 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 14 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:19,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 226 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:47:19,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-10-15 16:47:19,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2022-10-15 16:47:19,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 175 states have (on average 1.3657142857142857) internal successors, (239), 221 states have internal predecessors, (239), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-15 16:47:19,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 249 transitions. [2022-10-15 16:47:19,106 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 249 transitions. Word has length 33 [2022-10-15 16:47:19,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:19,106 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 249 transitions. [2022-10-15 16:47:19,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:19,106 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 249 transitions. [2022-10-15 16:47:19,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-10-15 16:47:19,107 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:19,107 INFO L195 NwaCegarLoop]: 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] [2022-10-15 16:47:19,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-10-15 16:47:19,108 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting append_to_queueErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [append_to_queueErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2022-10-15 16:47:19,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:19,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1335987007, now seen corresponding path program 1 times [2022-10-15 16:47:19,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:19,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090323221] [2022-10-15 16:47:19,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:19,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:19,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:19,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:19,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:19,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090323221] [2022-10-15 16:47:19,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090323221] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:19,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:19,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 16:47:19,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730926692] [2022-10-15 16:47:19,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:19,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 16:47:19,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:19,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 16:47:19,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-15 16:47:19,966 INFO L87 Difference]: Start difference. First operand 229 states and 249 transitions. Second operand has 8 states, 6 states have (on average 6.0) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:20,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:20,717 INFO L93 Difference]: Finished difference Result 374 states and 413 transitions. [2022-10-15 16:47:20,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 16:47:20,718 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 6.0) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-10-15 16:47:20,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:20,721 INFO L225 Difference]: With dead ends: 374 [2022-10-15 16:47:20,721 INFO L226 Difference]: Without dead ends: 374 [2022-10-15 16:47:20,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-10-15 16:47:20,723 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 172 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:20,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 474 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-10-15 16:47:20,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-10-15 16:47:20,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 293. [2022-10-15 16:47:20,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 236 states have (on average 1.3093220338983051) internal successors, (309), 282 states have internal predecessors, (309), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-10-15 16:47:20,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 323 transitions. [2022-10-15 16:47:20,737 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 323 transitions. Word has length 37 [2022-10-15 16:47:20,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:20,738 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 323 transitions. [2022-10-15 16:47:20,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 6.0) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:20,738 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 323 transitions. [2022-10-15 16:47:20,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-10-15 16:47:20,739 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:20,739 INFO L195 NwaCegarLoop]: 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] [2022-10-15 16:47:20,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-10-15 16:47:20,740 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting append_to_queueErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [append_to_queueErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2022-10-15 16:47:20,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:20,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1335987006, now seen corresponding path program 1 times [2022-10-15 16:47:20,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:20,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185004354] [2022-10-15 16:47:20,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:20,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:21,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:21,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:21,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185004354] [2022-10-15 16:47:21,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185004354] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:21,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:21,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-10-15 16:47:21,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738272665] [2022-10-15 16:47:21,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:21,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-15 16:47:21,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:21,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-15 16:47:21,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-10-15 16:47:21,435 INFO L87 Difference]: Start difference. First operand 293 states and 323 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:22,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:22,013 INFO L93 Difference]: Finished difference Result 371 states and 409 transitions. [2022-10-15 16:47:22,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 16:47:22,014 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-10-15 16:47:22,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:22,016 INFO L225 Difference]: With dead ends: 371 [2022-10-15 16:47:22,017 INFO L226 Difference]: Without dead ends: 371 [2022-10-15 16:47:22,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-10-15 16:47:22,018 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 150 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:22,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 533 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-15 16:47:22,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2022-10-15 16:47:22,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 319. [2022-10-15 16:47:22,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 261 states have (on average 1.2796934865900382) internal successors, (334), 307 states have internal predecessors, (334), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-10-15 16:47:22,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 352 transitions. [2022-10-15 16:47:22,028 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 352 transitions. Word has length 37 [2022-10-15 16:47:22,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:22,028 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 352 transitions. [2022-10-15 16:47:22,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:22,028 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 352 transitions. [2022-10-15 16:47:22,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-10-15 16:47:22,029 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:22,029 INFO L195 NwaCegarLoop]: 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] [2022-10-15 16:47:22,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-10-15 16:47:22,030 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting append_to_queueErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [append_to_queueErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2022-10-15 16:47:22,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:22,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1134586010, now seen corresponding path program 1 times [2022-10-15 16:47:22,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:22,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894047017] [2022-10-15 16:47:22,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:22,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:22,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:22,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:22,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894047017] [2022-10-15 16:47:22,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894047017] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:22,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:22,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 16:47:22,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859955413] [2022-10-15 16:47:22,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:22,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 16:47:22,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:22,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 16:47:22,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-15 16:47:22,786 INFO L87 Difference]: Start difference. First operand 319 states and 352 transitions. Second operand has 8 states, 6 states have (on average 6.333333333333333) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:23,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:23,582 INFO L93 Difference]: Finished difference Result 469 states and 519 transitions. [2022-10-15 16:47:23,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 16:47:23,587 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 6.333333333333333) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-10-15 16:47:23,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:23,590 INFO L225 Difference]: With dead ends: 469 [2022-10-15 16:47:23,591 INFO L226 Difference]: Without dead ends: 469 [2022-10-15 16:47:23,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-10-15 16:47:23,592 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 193 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:23,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 571 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-10-15 16:47:23,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2022-10-15 16:47:23,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 382. [2022-10-15 16:47:23,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 322 states have (on average 1.2608695652173914) internal successors, (406), 368 states have internal predecessors, (406), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-10-15 16:47:23,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 426 transitions. [2022-10-15 16:47:23,604 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 426 transitions. Word has length 39 [2022-10-15 16:47:23,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:23,605 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 426 transitions. [2022-10-15 16:47:23,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 6.333333333333333) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:23,605 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 426 transitions. [2022-10-15 16:47:23,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-10-15 16:47:23,606 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:23,606 INFO L195 NwaCegarLoop]: 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] [2022-10-15 16:47:23,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-10-15 16:47:23,606 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting append_to_queueErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [append_to_queueErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2022-10-15 16:47:23,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:23,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1134586009, now seen corresponding path program 1 times [2022-10-15 16:47:23,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:23,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688372320] [2022-10-15 16:47:23,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:23,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:24,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:24,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:24,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688372320] [2022-10-15 16:47:24,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688372320] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:24,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:24,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-10-15 16:47:24,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492915240] [2022-10-15 16:47:24,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:24,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-15 16:47:24,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:24,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-15 16:47:24,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-10-15 16:47:24,191 INFO L87 Difference]: Start difference. First operand 382 states and 426 transitions. Second operand has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:24,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:24,803 INFO L93 Difference]: Finished difference Result 449 states and 499 transitions. [2022-10-15 16:47:24,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 16:47:24,803 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-10-15 16:47:24,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:24,806 INFO L225 Difference]: With dead ends: 449 [2022-10-15 16:47:24,806 INFO L226 Difference]: Without dead ends: 449 [2022-10-15 16:47:24,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-10-15 16:47:24,809 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 133 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:24,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 633 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-15 16:47:24,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2022-10-15 16:47:24,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 399. [2022-10-15 16:47:24,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 338 states have (on average 1.2485207100591715) internal successors, (422), 384 states have internal predecessors, (422), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-10-15 16:47:24,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 444 transitions. [2022-10-15 16:47:24,839 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 444 transitions. Word has length 39 [2022-10-15 16:47:24,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:24,840 INFO L495 AbstractCegarLoop]: Abstraction has 399 states and 444 transitions. [2022-10-15 16:47:24,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:24,840 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 444 transitions. [2022-10-15 16:47:24,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-10-15 16:47:24,845 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:24,845 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:24,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-10-15 16:47:24,846 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [append_to_queueErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2022-10-15 16:47:24,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:24,846 INFO L85 PathProgramCache]: Analyzing trace with hash 389834955, now seen corresponding path program 2 times [2022-10-15 16:47:24,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:24,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489163885] [2022-10-15 16:47:24,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:24,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:24,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:25,818 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 16:47:25,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:25,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489163885] [2022-10-15 16:47:25,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489163885] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:47:25,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389184673] [2022-10-15 16:47:25,819 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 16:47:25,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:47:25,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:47:25,821 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-10-15 16:47:25,844 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-10-15 16:47:25,973 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-15 16:47:25,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 16:47:25,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 63 conjunts are in the unsatisfiable core [2022-10-15 16:47:25,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:47:25,998 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-15 16:47:25,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 19 treesize of output 18 [2022-10-15 16:47:26,024 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-15 16:47:26,024 INFO L390 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 15 treesize of output 15 [2022-10-15 16:47:26,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-15 16:47:26,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-15 16:47:26,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-15 16:47:26,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-15 16:47:26,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-15 16:47:26,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-15 16:47:26,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 16:47:26,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-15 16:47:26,299 INFO L390 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 10 treesize of output 8 [2022-10-15 16:47:26,330 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 16:47:26,331 INFO L390 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-10-15 16:47:26,335 INFO L390 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 5 treesize of output 3 [2022-10-15 16:47:26,349 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 16:47:26,350 INFO L390 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-10-15 16:47:26,357 INFO L390 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 5 treesize of output 3 [2022-10-15 16:47:26,439 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 16:47:26,439 INFO L390 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 1 case distinctions, treesize of input 18 treesize of output 24 [2022-10-15 16:47:26,455 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 16:47:26,456 INFO L390 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 1 case distinctions, treesize of input 18 treesize of output 24 [2022-10-15 16:47:26,490 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 16:47:26,490 INFO L390 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 1 case distinctions, treesize of input 18 treesize of output 24 [2022-10-15 16:47:26,507 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 16:47:26,507 INFO L390 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 1 case distinctions, treesize of input 18 treesize of output 24 [2022-10-15 16:47:26,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 16:47:26,687 INFO L356 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-10-15 16:47:26,688 INFO L390 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 3 case distinctions, treesize of input 42 treesize of output 55 [2022-10-15 16:47:26,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2022-10-15 16:47:26,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2022-10-15 16:47:26,847 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:26,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:47:26,935 INFO L390 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 84 treesize of output 80 [2022-10-15 16:47:27,110 INFO L390 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 10 treesize of output 8 [2022-10-15 16:47:27,127 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_receive_~#packet~0#1.base_30| Int)) (or (forall ((v_ArrVal_1045 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_receive_~#packet~0#1.base_30| v_ArrVal_1045) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (= |v_ULTIMATE.start_receive_~#packet~0#1.base_30| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|))) (forall ((|v_ULTIMATE.start_receive_~#packet~0#1.base_30| Int)) (or (forall ((v_ArrVal_1044 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_receive_~#packet~0#1.base_30| v_ArrVal_1044) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (= |v_ULTIMATE.start_receive_~#packet~0#1.base_30| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)))) is different from false [2022-10-15 16:47:27,275 INFO L390 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 10 treesize of output 8 [2022-10-15 16:47:27,280 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((|v_ULTIMATE.start_receive_~#packet~0#1.base_30| Int)) (or (forall ((v_ArrVal_1045 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_receive_~#packet~0#1.base_30| v_ArrVal_1045) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (= |v_ULTIMATE.start_receive_~#packet~0#1.base_30| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|))) (forall ((|v_ULTIMATE.start_receive_~#packet~0#1.base_30| Int)) (or (forall ((v_ArrVal_1044 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_receive_~#packet~0#1.base_30| v_ArrVal_1044) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (= |v_ULTIMATE.start_receive_~#packet~0#1.base_30| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)))) (= |c_ULTIMATE.start_receive_~#packet~0#1.base| |c_ULTIMATE.start_main_~#new_packet~0#1.base|)) is different from false [2022-10-15 16:47:27,802 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-10-15 16:47:27,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389184673] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:47:27,802 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:47:27,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 13] total 25 [2022-10-15 16:47:27,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983234200] [2022-10-15 16:47:27,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:47:27,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-10-15 16:47:27,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:27,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-10-15 16:47:27,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=390, Unknown=8, NotChecked=86, Total=600 [2022-10-15 16:47:27,806 INFO L87 Difference]: Start difference. First operand 399 states and 444 transitions. Second operand has 25 states, 25 states have (on average 4.44) internal successors, (111), 25 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:27,851 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_receive_~#packet~0#1.base| |c_ULTIMATE.start_main_~#new_packet~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (or (and (forall ((|v_ULTIMATE.start_receive_~#packet~0#1.base_30| Int)) (or (forall ((v_ArrVal_1045 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_receive_~#packet~0#1.base_30| v_ArrVal_1045) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (= |v_ULTIMATE.start_receive_~#packet~0#1.base_30| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|))) (forall ((|v_ULTIMATE.start_receive_~#packet~0#1.base_30| Int)) (or (forall ((v_ArrVal_1044 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_receive_~#packet~0#1.base_30| v_ArrVal_1044) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (= |v_ULTIMATE.start_receive_~#packet~0#1.base_30| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)))) .cse0) (not (= |c_ULTIMATE.start_main_~#new_packet~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (not (= |c_ULTIMATE.start_receive_~#packet~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (not .cse0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) 1))) is different from false [2022-10-15 16:47:27,874 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (.cse1 (not (= |c_ULTIMATE.start_main_~#new_packet~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|))) (.cse2 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (.cse3 (select |c_#valid| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|))) (and .cse0 .cse1 (or (and .cse0 .cse2 (exists ((|v_ULTIMATE.start_receive_~#packet~0#1.base_29| Int)) (and (not (= |c_ULTIMATE.start_main_~#new_packet~0#1.base| |v_ULTIMATE.start_receive_~#packet~0#1.base_29|)) (= (select |c_#valid| |v_ULTIMATE.start_receive_~#packet~0#1.base_29|) 0)))) (and .cse1 (= .cse3 0))) (forall ((|v_ULTIMATE.start_receive_~#packet~0#1.base_30| Int)) (or (forall ((v_ArrVal_1045 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_receive_~#packet~0#1.base_30| v_ArrVal_1045) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (= |v_ULTIMATE.start_receive_~#packet~0#1.base_30| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|))) .cse2 (forall ((|v_ULTIMATE.start_receive_~#packet~0#1.base_30| Int)) (or (forall ((v_ArrVal_1044 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_receive_~#packet~0#1.base_30| v_ArrVal_1044) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (= |v_ULTIMATE.start_receive_~#packet~0#1.base_30| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|))) (= .cse3 1))) is different from false [2022-10-15 16:47:27,884 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (.cse1 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (.cse2 (select |c_#valid| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|))) (and .cse0 (or (and .cse0 (exists ((|v_ULTIMATE.start_receive_~#packet~0#1.base_29| Int)) (and (not (= |v_ULTIMATE.start_receive_~#packet~0#1.base_29| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (= (select |c_#valid| |v_ULTIMATE.start_receive_~#packet~0#1.base_29|) 0))) .cse1) (= .cse2 0)) (forall ((|v_ULTIMATE.start_receive_~#packet~0#1.base_30| Int)) (or (forall ((v_ArrVal_1045 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_receive_~#packet~0#1.base_30| v_ArrVal_1045) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (= |v_ULTIMATE.start_receive_~#packet~0#1.base_30| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|))) .cse1 (forall ((|v_ULTIMATE.start_receive_~#packet~0#1.base_30| Int)) (or (forall ((v_ArrVal_1044 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_receive_~#packet~0#1.base_30| v_ArrVal_1044) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (= |v_ULTIMATE.start_receive_~#packet~0#1.base_30| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|))) (= .cse2 1))) is different from false [2022-10-15 16:47:28,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:28,194 INFO L93 Difference]: Finished difference Result 399 states and 443 transitions. [2022-10-15 16:47:28,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-15 16:47:28,194 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.44) internal successors, (111), 25 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-10-15 16:47:28,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:28,197 INFO L225 Difference]: With dead ends: 399 [2022-10-15 16:47:28,197 INFO L226 Difference]: Without dead ends: 399 [2022-10-15 16:47:28,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=159, Invalid=499, Unknown=12, NotChecked=260, Total=930 [2022-10-15 16:47:28,199 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 57 mSDsluCounter, 1378 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1521 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 674 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:28,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1521 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 363 Invalid, 0 Unknown, 674 Unchecked, 0.3s Time] [2022-10-15 16:47:28,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2022-10-15 16:47:28,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2022-10-15 16:47:28,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 338 states have (on average 1.2455621301775148) internal successors, (421), 384 states have internal predecessors, (421), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-10-15 16:47:28,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 443 transitions. [2022-10-15 16:47:28,211 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 443 transitions. Word has length 42 [2022-10-15 16:47:28,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:28,211 INFO L495 AbstractCegarLoop]: Abstraction has 399 states and 443 transitions. [2022-10-15 16:47:28,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.44) internal successors, (111), 25 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:28,211 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 443 transitions. [2022-10-15 16:47:28,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-10-15 16:47:28,212 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:28,212 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-10-15 16:47:28,264 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-10-15 16:47:28,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-10-15 16:47:28,427 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [append_to_queueErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2022-10-15 16:47:28,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:28,428 INFO L85 PathProgramCache]: Analyzing trace with hash -585239206, now seen corresponding path program 2 times [2022-10-15 16:47:28,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:28,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596900871] [2022-10-15 16:47:28,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:28,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:28,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:29,310 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 16:47:29,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:29,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596900871] [2022-10-15 16:47:29,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596900871] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:47:29,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132489909] [2022-10-15 16:47:29,311 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 16:47:29,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:47:29,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:47:29,312 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-10-15 16:47:29,329 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-10-15 16:47:29,461 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-15 16:47:29,461 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 16:47:29,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 52 conjunts are in the unsatisfiable core [2022-10-15 16:47:29,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:47:29,484 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 16:47:29,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-10-15 16:47:29,512 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-10-15 16:47:29,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-10-15 16:47:29,539 INFO L390 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 14 treesize of output 16 [2022-10-15 16:47:29,545 INFO L390 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 14 treesize of output 16 [2022-10-15 16:47:29,570 INFO L390 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 14 treesize of output 16 [2022-10-15 16:47:29,576 INFO L390 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 14 treesize of output 16 [2022-10-15 16:47:29,594 INFO L390 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 14 treesize of output 16 [2022-10-15 16:47:29,601 INFO L390 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 14 treesize of output 16 [2022-10-15 16:47:29,658 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 16:47:29,659 INFO L390 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-10-15 16:47:29,670 INFO L390 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 5 treesize of output 3 [2022-10-15 16:47:29,682 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 16:47:29,682 INFO L390 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-10-15 16:47:29,691 INFO L390 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 5 treesize of output 3 [2022-10-15 16:47:29,742 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 16:47:29,743 INFO L390 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 1 case distinctions, treesize of input 18 treesize of output 24 [2022-10-15 16:47:29,760 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 16:47:29,760 INFO L390 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 1 case distinctions, treesize of input 18 treesize of output 24 [2022-10-15 16:47:29,791 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 16:47:29,792 INFO L390 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 1 case distinctions, treesize of input 18 treesize of output 24 [2022-10-15 16:47:29,807 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 16:47:29,808 INFO L390 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 1 case distinctions, treesize of input 18 treesize of output 24 [2022-10-15 16:47:29,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-10-15 16:47:30,015 INFO L356 Elim1Store]: treesize reduction 28, result has 55.6 percent of original size [2022-10-15 16:47:30,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 65 [2022-10-15 16:47:30,175 INFO L390 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 15 treesize of output 7 [2022-10-15 16:47:30,183 INFO L390 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 15 treesize of output 7 [2022-10-15 16:47:30,194 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:30,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:47:30,370 INFO L390 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 10 treesize of output 8 [2022-10-15 16:47:30,438 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_receive_~#packet~0#1.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|))) (and (or .cse0 (forall ((v_ArrVal_1172 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1172) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) (or .cse0 (forall ((v_ArrVal_1173 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1173) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))))) is different from false [2022-10-15 16:47:30,518 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_receive_~#packet~0#1.base| Int)) (or (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |ULTIMATE.start_receive_~#packet~0#1.base|) (forall ((v_ArrVal_1172 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1172) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)))) (forall ((|ULTIMATE.start_receive_~#packet~0#1.base| Int)) (or (forall ((v_ArrVal_1173 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1173) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |ULTIMATE.start_receive_~#packet~0#1.base|)))) is different from false [2022-10-15 16:47:30,683 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1166 (Array Int Int)) (v_subst_1 Int)) (or (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_subst_1) (forall ((v_ArrVal_1173 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1166) v_subst_1 v_ArrVal_1173) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)))) (forall ((v_ArrVal_1167 (Array Int Int)) (v_subst_2 Int)) (or (forall ((v_ArrVal_1172 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1167) v_subst_2 v_ArrVal_1172) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_subst_2)))) is different from false [2022-10-15 16:47:31,005 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 19 not checked. [2022-10-15 16:47:31,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132489909] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:47:31,005 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:47:31,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 22 [2022-10-15 16:47:31,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464272017] [2022-10-15 16:47:31,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:47:31,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-10-15 16:47:31,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:31,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-10-15 16:47:31,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=272, Unknown=3, NotChecked=108, Total=462 [2022-10-15 16:47:31,008 INFO L87 Difference]: Start difference. First operand 399 states and 443 transitions. Second operand has 22 states, 22 states have (on average 5.545454545454546) internal successors, (122), 22 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:31,617 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_receive_~#packet~0#1.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|)) (.cse6 (= |c_ULTIMATE.start_main_~#new_packet~0#1.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|))) (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) 1)) (.cse1 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (.cse3 (not .cse6)) (.cse5 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (.cse2 (not .cse4))) (and .cse0 .cse1 .cse2 .cse3 (forall ((v_ArrVal_1166 (Array Int Int)) (v_subst_1 Int)) (or (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_subst_1) (forall ((v_ArrVal_1173 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1166) v_subst_1 v_ArrVal_1173) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)))) (or .cse4 (and .cse0 .cse1 .cse3 .cse5)) .cse5 (or .cse2 .cse6) (forall ((v_ArrVal_1167 (Array Int Int)) (v_subst_2 Int)) (or (forall ((v_ArrVal_1172 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1167) v_subst_2 v_ArrVal_1172) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_subst_2)))))) is different from false [2022-10-15 16:47:32,184 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_receive_~#packet~0#1.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (.cse4 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (.cse1 (not .cse2)) (.cse3 (= |c_ULTIMATE.start_main_~#new_packet~0#1.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|))) (and .cse0 .cse1 (forall ((v_ArrVal_1166 (Array Int Int)) (v_subst_1 Int)) (or (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_subst_1) (forall ((v_ArrVal_1173 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1166) v_subst_1 v_ArrVal_1173) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)))) (or .cse2 (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) 1) .cse0 (not .cse3) .cse4)) .cse4 (or .cse1 .cse3) (forall ((v_ArrVal_1167 (Array Int Int)) (v_subst_2 Int)) (or (forall ((v_ArrVal_1172 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1167) v_subst_2 v_ArrVal_1172) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_subst_2)))))) is different from false [2022-10-15 16:47:32,189 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (.cse3 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (.cse1 (= |c_ULTIMATE.start_receive_~#packet~0#1.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|)) (.cse2 (= |c_ULTIMATE.start_main_~#new_packet~0#1.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|))) (and (forall ((|ULTIMATE.start_receive_~#packet~0#1.base| Int)) (or (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |ULTIMATE.start_receive_~#packet~0#1.base|) (forall ((v_ArrVal_1172 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1172) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)))) .cse0 (forall ((|ULTIMATE.start_receive_~#packet~0#1.base| Int)) (or (forall ((v_ArrVal_1173 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1173) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |ULTIMATE.start_receive_~#packet~0#1.base|))) (or .cse1 (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) 1) .cse0 (not .cse2) .cse3)) .cse3 (or (not .cse1) .cse2))) is different from false [2022-10-15 16:47:32,195 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#valid| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|)) (.cse0 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (.cse1 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) (and (or (and .cse0 (exists ((|v_ULTIMATE.start_receive_~#packet~0#1.base_32| Int)) (= 0 (select |c_#valid| |v_ULTIMATE.start_receive_~#packet~0#1.base_32|))) .cse1) (= .cse2 0)) (let ((.cse3 (= |c_ULTIMATE.start_main_~#new_packet~0#1.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|))) (or (and (= .cse2 1) .cse0 (not .cse3) .cse1) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#new_packet~0#1.base|) 0) .cse3))) (forall ((|ULTIMATE.start_receive_~#packet~0#1.base| Int)) (or (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |ULTIMATE.start_receive_~#packet~0#1.base|) (forall ((v_ArrVal_1172 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1172) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)))) .cse0 (forall ((|ULTIMATE.start_receive_~#packet~0#1.base| Int)) (or (forall ((v_ArrVal_1173 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1173) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |ULTIMATE.start_receive_~#packet~0#1.base|))) .cse1)) is different from false [2022-10-15 16:47:32,200 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|)) (.cse1 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (.cse2 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) (and (= .cse0 1) (or (and .cse1 (exists ((|v_ULTIMATE.start_receive_~#packet~0#1.base_32| Int)) (= 0 (select |c_#valid| |v_ULTIMATE.start_receive_~#packet~0#1.base_32|))) .cse2) (= .cse0 0)) (forall ((|ULTIMATE.start_receive_~#packet~0#1.base| Int)) (or (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |ULTIMATE.start_receive_~#packet~0#1.base|) (forall ((v_ArrVal_1172 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1172) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)))) .cse1 (= (select |c_#valid| |c_ULTIMATE.start_main_~#new_packet~0#1.base|) 1) (forall ((|ULTIMATE.start_receive_~#packet~0#1.base| Int)) (or (forall ((v_ArrVal_1173 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1173) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |ULTIMATE.start_receive_~#packet~0#1.base|))) (not (= |c_ULTIMATE.start_main_~#new_packet~0#1.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|)) .cse2)) is different from false [2022-10-15 16:47:32,208 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|)) (.cse1 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (.cse2 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) (and (= .cse0 1) (or (and .cse1 (exists ((|v_ULTIMATE.start_receive_~#packet~0#1.base_32| Int)) (= 0 (select |c_#valid| |v_ULTIMATE.start_receive_~#packet~0#1.base_32|))) .cse2) (= .cse0 0)) (forall ((|ULTIMATE.start_receive_~#packet~0#1.base| Int)) (or (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |ULTIMATE.start_receive_~#packet~0#1.base|) (forall ((v_ArrVal_1172 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1172) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)))) .cse1 (forall ((|ULTIMATE.start_receive_~#packet~0#1.base| Int)) (or (forall ((v_ArrVal_1173 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1173) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |ULTIMATE.start_receive_~#packet~0#1.base|))) .cse2)) is different from false [2022-10-15 16:47:32,217 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_receive_~#packet~0#1.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (.cse4 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (.cse1 (not .cse2)) (.cse3 (= |c_ULTIMATE.start_main_~#new_packet~0#1.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|))) (and (forall ((|ULTIMATE.start_receive_~#packet~0#1.base| Int)) (or (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |ULTIMATE.start_receive_~#packet~0#1.base|) (forall ((v_ArrVal_1172 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1172) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)))) .cse0 (forall ((|ULTIMATE.start_receive_~#packet~0#1.base| Int)) (or (forall ((v_ArrVal_1173 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1173) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |ULTIMATE.start_receive_~#packet~0#1.base|))) .cse1 (or .cse2 (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) 1) .cse0 (not .cse3) .cse4)) .cse4 (or .cse1 .cse3)))) is different from false [2022-10-15 16:47:32,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:32,749 INFO L93 Difference]: Finished difference Result 455 states and 505 transitions. [2022-10-15 16:47:32,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-10-15 16:47:32,750 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.545454545454546) internal successors, (122), 22 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-10-15 16:47:32,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:32,753 INFO L225 Difference]: With dead ends: 455 [2022-10-15 16:47:32,753 INFO L226 Difference]: Without dead ends: 447 [2022-10-15 16:47:32,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 89 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=181, Invalid=551, Unknown=10, NotChecked=590, Total=1332 [2022-10-15 16:47:32,759 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 34 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 216 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:32,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1151 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 282 Invalid, 0 Unknown, 216 Unchecked, 0.2s Time] [2022-10-15 16:47:32,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2022-10-15 16:47:32,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 433. [2022-10-15 16:47:32,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 372 states have (on average 1.2338709677419355) internal successors, (459), 418 states have internal predecessors, (459), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-10-15 16:47:32,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 481 transitions. [2022-10-15 16:47:32,775 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 481 transitions. Word has length 46 [2022-10-15 16:47:32,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:32,775 INFO L495 AbstractCegarLoop]: Abstraction has 433 states and 481 transitions. [2022-10-15 16:47:32,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.545454545454546) internal successors, (122), 22 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:32,775 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 481 transitions. [2022-10-15 16:47:32,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-10-15 16:47:32,776 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:32,776 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-10-15 16:47:32,823 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-10-15 16:47:32,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-10-15 16:47:32,985 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [append_to_queueErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2022-10-15 16:47:32,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:32,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1957046504, now seen corresponding path program 1 times [2022-10-15 16:47:32,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:32,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650629876] [2022-10-15 16:47:32,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:32,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:33,717 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 16:47:33,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:33,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650629876] [2022-10-15 16:47:33,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650629876] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:47:33,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271594633] [2022-10-15 16:47:33,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:33,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:47:33,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:47:33,720 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-10-15 16:47:33,730 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-10-15 16:47:33,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:33,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 50 conjunts are in the unsatisfiable core [2022-10-15 16:47:33,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:47:33,906 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 16:47:33,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-10-15 16:47:33,926 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-15 16:47:33,926 INFO L390 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 15 treesize of output 15 [2022-10-15 16:47:33,949 INFO L390 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 14 treesize of output 16 [2022-10-15 16:47:33,954 INFO L390 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 14 treesize of output 16 [2022-10-15 16:47:33,973 INFO L390 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 14 treesize of output 16 [2022-10-15 16:47:33,979 INFO L390 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 14 treesize of output 16 [2022-10-15 16:47:33,994 INFO L390 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 14 treesize of output 16 [2022-10-15 16:47:33,998 INFO L390 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 14 treesize of output 16 [2022-10-15 16:47:34,048 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 16:47:34,049 INFO L390 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-10-15 16:47:34,053 INFO L390 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 5 treesize of output 3 [2022-10-15 16:47:34,067 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 16:47:34,067 INFO L390 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-10-15 16:47:34,072 INFO L390 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 5 treesize of output 3 [2022-10-15 16:47:34,120 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 16:47:34,121 INFO L390 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 1 case distinctions, treesize of input 18 treesize of output 24 [2022-10-15 16:47:34,137 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 16:47:34,137 INFO L390 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 1 case distinctions, treesize of input 18 treesize of output 24 [2022-10-15 16:47:34,166 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 16:47:34,167 INFO L390 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 1 case distinctions, treesize of input 18 treesize of output 24 [2022-10-15 16:47:34,194 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 16:47:34,194 INFO L390 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 1 case distinctions, treesize of input 18 treesize of output 24 [2022-10-15 16:47:34,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-10-15 16:47:34,363 INFO L356 Elim1Store]: treesize reduction 28, result has 55.6 percent of original size [2022-10-15 16:47:34,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 65 [2022-10-15 16:47:34,488 INFO L390 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 15 treesize of output 7 [2022-10-15 16:47:34,492 INFO L390 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 15 treesize of output 7 [2022-10-15 16:47:34,500 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:34,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:47:34,666 INFO L390 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 10 treesize of output 8 [2022-10-15 16:47:34,724 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_receive_~#packet~0#1.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|))) (and (or .cse0 (forall ((v_ArrVal_1301 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1301) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) (or (forall ((v_ArrVal_1300 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1300) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) .cse0))) is different from false [2022-10-15 16:47:34,777 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_receive_~#packet~0#1.base| Int)) (or (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |ULTIMATE.start_receive_~#packet~0#1.base|) (forall ((v_ArrVal_1301 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1301) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)))) (forall ((|ULTIMATE.start_receive_~#packet~0#1.base| Int)) (or (forall ((v_ArrVal_1300 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1300) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |ULTIMATE.start_receive_~#packet~0#1.base|)))) is different from false [2022-10-15 16:47:35,972 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 19 not checked. [2022-10-15 16:47:35,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271594633] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:47:35,973 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:47:35,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 21 [2022-10-15 16:47:35,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538922012] [2022-10-15 16:47:35,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:47:35,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-10-15 16:47:35,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:35,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-10-15 16:47:35,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=251, Unknown=13, NotChecked=70, Total=420 [2022-10-15 16:47:35,975 INFO L87 Difference]: Start difference. First operand 433 states and 481 transitions. Second operand has 21 states, 21 states have (on average 5.809523809523809) internal successors, (122), 21 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:35,995 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (forall ((|ULTIMATE.start_receive_~#packet~0#1.base| Int)) (or (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |ULTIMATE.start_receive_~#packet~0#1.base|) (forall ((v_ArrVal_1301 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1301) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)))) (not (= |c_ULTIMATE.start_receive_~#packet~0#1.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#new_packet~0#1.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|)) (forall ((|ULTIMATE.start_receive_~#packet~0#1.base| Int)) (or (forall ((v_ArrVal_1300 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1300) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |ULTIMATE.start_receive_~#packet~0#1.base|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) is different from false [2022-10-15 16:47:36,001 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (.cse0 (select |c_#valid| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|)) (.cse2 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) (and (= .cse0 1) .cse1 (or (and .cse1 (exists ((|v_ULTIMATE.start_receive_~#packet~0#1.base_35| Int)) (= (select |c_#valid| |v_ULTIMATE.start_receive_~#packet~0#1.base_35|) 0)) .cse2) (= .cse0 0)) (forall ((|ULTIMATE.start_receive_~#packet~0#1.base| Int)) (or (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |ULTIMATE.start_receive_~#packet~0#1.base|) (forall ((v_ArrVal_1301 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1301) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)))) (not (= |c_ULTIMATE.start_main_~#new_packet~0#1.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|)) (forall ((|ULTIMATE.start_receive_~#packet~0#1.base| Int)) (or (forall ((v_ArrVal_1300 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1300) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |ULTIMATE.start_receive_~#packet~0#1.base|))) .cse2)) is different from false [2022-10-15 16:47:36,007 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (.cse0 (select |c_#valid| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|)) (.cse2 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) (and (= .cse0 1) .cse1 (= (select |c_#valid| |c_ULTIMATE.start_main_~#new_packet~0#1.base|) 1) (or (and .cse1 (exists ((|v_ULTIMATE.start_receive_~#packet~0#1.base_35| Int)) (= (select |c_#valid| |v_ULTIMATE.start_receive_~#packet~0#1.base_35|) 0)) .cse2) (= .cse0 0)) (forall ((|ULTIMATE.start_receive_~#packet~0#1.base| Int)) (or (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |ULTIMATE.start_receive_~#packet~0#1.base|) (forall ((v_ArrVal_1301 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1301) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)))) (not (= |c_ULTIMATE.start_main_~#new_packet~0#1.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|)) (forall ((|ULTIMATE.start_receive_~#packet~0#1.base| Int)) (or (forall ((v_ArrVal_1300 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1300) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |ULTIMATE.start_receive_~#packet~0#1.base|))) .cse2)) is different from false [2022-10-15 16:47:36,015 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (.cse0 (select |c_#valid| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|)) (.cse2 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) (and (= .cse0 1) .cse1 (or (and .cse1 (exists ((|v_ULTIMATE.start_receive_~#packet~0#1.base_35| Int)) (= (select |c_#valid| |v_ULTIMATE.start_receive_~#packet~0#1.base_35|) 0)) .cse2) (= .cse0 0)) (forall ((|ULTIMATE.start_receive_~#packet~0#1.base| Int)) (or (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |ULTIMATE.start_receive_~#packet~0#1.base|) (forall ((v_ArrVal_1301 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1301) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)))) (forall ((|ULTIMATE.start_receive_~#packet~0#1.base| Int)) (or (forall ((v_ArrVal_1300 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1300) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |ULTIMATE.start_receive_~#packet~0#1.base|))) .cse2)) is different from false [2022-10-15 16:47:37,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:37,058 INFO L93 Difference]: Finished difference Result 433 states and 480 transitions. [2022-10-15 16:47:37,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-15 16:47:37,058 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.809523809523809) internal successors, (122), 21 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-10-15 16:47:37,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:37,061 INFO L225 Difference]: With dead ends: 433 [2022-10-15 16:47:37,061 INFO L226 Difference]: Without dead ends: 426 [2022-10-15 16:47:37,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 89 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=113, Invalid=353, Unknown=20, NotChecked=270, Total=756 [2022-10-15 16:47:37,062 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 27 mSDsluCounter, 1274 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1417 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 294 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:37,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1417 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 294 Unchecked, 0.1s Time] [2022-10-15 16:47:37,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2022-10-15 16:47:37,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 362. [2022-10-15 16:47:37,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 301 states have (on average 1.2624584717607974) internal successors, (380), 347 states have internal predecessors, (380), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-10-15 16:47:37,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 402 transitions. [2022-10-15 16:47:37,082 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 402 transitions. Word has length 46 [2022-10-15 16:47:37,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:37,082 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 402 transitions. [2022-10-15 16:47:37,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.809523809523809) internal successors, (122), 21 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:37,083 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 402 transitions. [2022-10-15 16:47:37,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-10-15 16:47:37,083 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:37,084 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-15 16:47:37,125 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-10-15 16:47:37,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:47:37,298 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [append_to_queueErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2022-10-15 16:47:37,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:37,300 INFO L85 PathProgramCache]: Analyzing trace with hash 821830041, now seen corresponding path program 1 times [2022-10-15 16:47:37,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:37,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131384024] [2022-10-15 16:47:37,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:37,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:37,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 16:47:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:38,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 16:47:38,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:38,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131384024] [2022-10-15 16:47:38,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131384024] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:38,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:38,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-10-15 16:47:38,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879869715] [2022-10-15 16:47:38,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:38,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-15 16:47:38,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:38,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-15 16:47:38,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-10-15 16:47:38,087 INFO L87 Difference]: Start difference. First operand 362 states and 402 transitions. Second operand has 11 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 16:47:38,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:38,655 INFO L93 Difference]: Finished difference Result 418 states and 464 transitions. [2022-10-15 16:47:38,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-15 16:47:38,656 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-10-15 16:47:38,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:38,658 INFO L225 Difference]: With dead ends: 418 [2022-10-15 16:47:38,658 INFO L226 Difference]: Without dead ends: 418 [2022-10-15 16:47:38,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-10-15 16:47:38,659 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 170 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:38,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 552 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-15 16:47:38,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2022-10-15 16:47:38,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 362. [2022-10-15 16:47:38,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 301 states have (on average 1.2591362126245846) internal successors, (379), 347 states have internal predecessors, (379), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-10-15 16:47:38,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 401 transitions. [2022-10-15 16:47:38,670 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 401 transitions. Word has length 48 [2022-10-15 16:47:38,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:38,671 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 401 transitions. [2022-10-15 16:47:38,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 16:47:38,671 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 401 transitions. [2022-10-15 16:47:38,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-10-15 16:47:38,672 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:38,672 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-15 16:47:38,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-10-15 16:47:38,672 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [append_to_queueErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2022-10-15 16:47:38,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:38,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1833091078, now seen corresponding path program 1 times [2022-10-15 16:47:38,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:38,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897050903] [2022-10-15 16:47:38,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:38,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:39,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-10-15 16:47:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:39,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:39,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:39,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897050903] [2022-10-15 16:47:39,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897050903] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:47:39,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668306149] [2022-10-15 16:47:39,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:39,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:47:39,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:47:39,544 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-10-15 16:47:39,548 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-10-15 16:47:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:39,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 34 conjunts are in the unsatisfiable core [2022-10-15 16:47:39,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:47:39,756 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-15 16:47:39,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 19 treesize of output 18 [2022-10-15 16:47:39,806 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-10-15 16:47:39,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-10-15 16:47:39,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2022-10-15 16:47:40,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-10-15 16:47:48,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:47:48,766 INFO L356 Elim1Store]: treesize reduction 89, result has 33.1 percent of original size [2022-10-15 16:47:48,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 33 treesize of output 61 [2022-10-15 16:47:48,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-10-15 16:47:48,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:48,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:47:49,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668306149] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:47:49,078 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-15 16:47:49,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2022-10-15 16:47:49,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210658667] [2022-10-15 16:47:49,079 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-15 16:47:49,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-10-15 16:47:49,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:49,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-10-15 16:47:49,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=339, Unknown=4, NotChecked=0, Total=420 [2022-10-15 16:47:49,080 INFO L87 Difference]: Start difference. First operand 362 states and 401 transitions. Second operand has 20 states, 19 states have (on average 4.842105263157895) internal successors, (92), 18 states have internal predecessors, (92), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:47:49,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:49,870 INFO L93 Difference]: Finished difference Result 461 states and 514 transitions. [2022-10-15 16:47:49,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-15 16:47:49,871 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.842105263157895) internal successors, (92), 18 states have internal predecessors, (92), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2022-10-15 16:47:49,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:49,873 INFO L225 Difference]: With dead ends: 461 [2022-10-15 16:47:49,873 INFO L226 Difference]: Without dead ends: 461 [2022-10-15 16:47:49,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 36 SyntacticMatches, 14 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=103, Invalid=445, Unknown=4, NotChecked=0, Total=552 [2022-10-15 16:47:49,875 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 142 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 389 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:49,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1112 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 512 Invalid, 0 Unknown, 389 Unchecked, 0.6s Time] [2022-10-15 16:47:49,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2022-10-15 16:47:49,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 404. [2022-10-15 16:47:49,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 342 states have (on average 1.2485380116959064) internal successors, (427), 388 states have internal predecessors, (427), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2022-10-15 16:47:49,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 451 transitions. [2022-10-15 16:47:49,886 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 451 transitions. Word has length 50 [2022-10-15 16:47:49,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:49,886 INFO L495 AbstractCegarLoop]: Abstraction has 404 states and 451 transitions. [2022-10-15 16:47:49,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.842105263157895) internal successors, (92), 18 states have internal predecessors, (92), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:47:49,887 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 451 transitions. [2022-10-15 16:47:49,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-10-15 16:47:49,887 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:49,888 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-15 16:47:49,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-10-15 16:47:50,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:47:50,104 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [append_to_queueErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, append_to_queueErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2022-10-15 16:47:50,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:50,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1833091077, now seen corresponding path program 1 times [2022-10-15 16:47:50,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:50,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873760500] [2022-10-15 16:47:50,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:50,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:50,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:50,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-10-15 16:47:50,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:51,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:51,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:51,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873760500] [2022-10-15 16:47:51,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873760500] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:47:51,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383936522] [2022-10-15 16:47:51,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:51,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:47:51,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:47:51,179 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-10-15 16:47:51,201 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-10-15 16:47:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:51,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 25 conjunts are in the unsatisfiable core [2022-10-15 16:47:51,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:47:51,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:47:51,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-10-15 16:47:51,404 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-15 16:47:51,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 19 treesize of output 18 [2022-10-15 16:47:51,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:47:51,470 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-10-15 16:47:51,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 15 treesize of output 27 [2022-10-15 16:47:51,480 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-15 16:47:51,481 INFO L390 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