./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d54b671-ba6a-46a3-a539-aafdae71d4b1/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d54b671-ba6a-46a3-a539-aafdae71d4b1/bin/utaipan-verify-t7M7D8N6sZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d54b671-ba6a-46a3-a539-aafdae71d4b1/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d54b671-ba6a-46a3-a539-aafdae71d4b1/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d54b671-ba6a-46a3-a539-aafdae71d4b1/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d54b671-ba6a-46a3-a539-aafdae71d4b1/bin/utaipan-verify-t7M7D8N6sZ --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 74e63e86abbcab22438f70ee6d7d7ef12eaada509b0f0a56fb5cf815aaf53aab --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 04:45:41,688 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 04:45:41,788 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d54b671-ba6a-46a3-a539-aafdae71d4b1/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-19 04:45:41,796 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 04:45:41,796 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 04:45:41,834 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 04:45:41,846 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 04:45:41,847 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 04:45:41,848 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 04:45:41,851 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 04:45:41,852 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 04:45:41,853 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 04:45:41,854 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 04:45:41,860 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 04:45:41,861 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 04:45:41,861 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 04:45:41,862 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 04:45:41,862 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 04:45:41,863 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 04:45:41,863 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 04:45:41,864 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 04:45:41,864 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 04:45:41,865 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 04:45:41,865 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 04:45:41,866 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 04:45:41,867 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 04:45:41,867 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 04:45:41,868 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 04:45:41,868 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 04:45:41,868 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 04:45:41,870 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 04:45:41,870 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 04:45:41,870 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 04:45:41,871 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 04:45:41,871 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 04:45:41,871 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 04:45:41,871 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 04:45:41,872 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 04:45:41,872 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 04:45:41,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:45:41,872 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 04:45:41,873 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 04:45:41,873 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 04:45:41,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 04:45:41,874 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 04:45:41,874 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 04:45:41,875 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d54b671-ba6a-46a3-a539-aafdae71d4b1/bin/utaipan-verify-t7M7D8N6sZ/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d54b671-ba6a-46a3-a539-aafdae71d4b1/bin/utaipan-verify-t7M7D8N6sZ Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 74e63e86abbcab22438f70ee6d7d7ef12eaada509b0f0a56fb5cf815aaf53aab [2023-11-19 04:45:42,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 04:45:42,214 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 04:45:42,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 04:45:42,218 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 04:45:42,219 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 04:45:42,220 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d54b671-ba6a-46a3-a539-aafdae71d4b1/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i [2023-11-19 04:45:45,375 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 04:45:45,690 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 04:45:45,690 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d54b671-ba6a-46a3-a539-aafdae71d4b1/sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i [2023-11-19 04:45:45,711 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d54b671-ba6a-46a3-a539-aafdae71d4b1/bin/utaipan-verify-t7M7D8N6sZ/data/6cb0f3575/1fd910dc2fda421caefcefd61392a71d/FLAGd361ed24e [2023-11-19 04:45:45,727 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d54b671-ba6a-46a3-a539-aafdae71d4b1/bin/utaipan-verify-t7M7D8N6sZ/data/6cb0f3575/1fd910dc2fda421caefcefd61392a71d [2023-11-19 04:45:45,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 04:45:45,731 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 04:45:45,733 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 04:45:45,733 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 04:45:45,745 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 04:45:45,745 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:45:45" (1/1) ... [2023-11-19 04:45:45,747 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f214366 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:45:45, skipping insertion in model container [2023-11-19 04:45:45,747 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:45:45" (1/1) ... [2023-11-19 04:45:45,809 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 04:45:46,394 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:45:46,415 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 04:45:46,481 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:45:46,519 WARN L675 CHandler]: The function strncpy is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 04:45:46,527 INFO L206 MainTranslator]: Completed translation [2023-11-19 04:45:46,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:45:46 WrapperNode [2023-11-19 04:45:46,528 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 04:45:46,530 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 04:45:46,530 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 04:45:46,530 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 04:45:46,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:45:46" (1/1) ... [2023-11-19 04:45:46,563 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:45:46" (1/1) ... [2023-11-19 04:45:46,622 INFO L138 Inliner]: procedures = 184, calls = 150, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 229 [2023-11-19 04:45:46,622 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 04:45:46,623 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 04:45:46,623 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 04:45:46,624 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 04:45:46,635 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:45:46" (1/1) ... [2023-11-19 04:45:46,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:45:46" (1/1) ... [2023-11-19 04:45:46,661 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:45:46" (1/1) ... [2023-11-19 04:45:46,662 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:45:46" (1/1) ... [2023-11-19 04:45:46,698 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:45:46" (1/1) ... [2023-11-19 04:45:46,716 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:45:46" (1/1) ... [2023-11-19 04:45:46,719 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:45:46" (1/1) ... [2023-11-19 04:45:46,722 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:45:46" (1/1) ... [2023-11-19 04:45:46,728 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 04:45:46,729 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 04:45:46,729 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 04:45:46,729 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 04:45:46,730 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:45:46" (1/1) ... [2023-11-19 04:45:46,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:45:46,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d54b671-ba6a-46a3-a539-aafdae71d4b1/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:45:46,776 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d54b671-ba6a-46a3-a539-aafdae71d4b1/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 04:45:46,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d54b671-ba6a-46a3-a539-aafdae71d4b1/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 04:45:46,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 04:45:46,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2023-11-19 04:45:46,816 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2023-11-19 04:45:46,816 INFO L130 BoogieDeclarations]: Found specification of procedure event_precess [2023-11-19 04:45:46,817 INFO L138 BoogieDeclarations]: Found implementation of procedure event_precess [2023-11-19 04:45:46,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 04:45:46,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 04:45:46,819 INFO L130 BoogieDeclarations]: Found specification of procedure ASNull [2023-11-19 04:45:46,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ASNull [2023-11-19 04:45:46,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 04:45:46,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-19 04:45:46,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 04:45:46,820 INFO L130 BoogieDeclarations]: Found specification of procedure ASStart [2023-11-19 04:45:46,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStart [2023-11-19 04:45:46,821 INFO L130 BoogieDeclarations]: Found specification of procedure status_update [2023-11-19 04:45:46,821 INFO L138 BoogieDeclarations]: Found implementation of procedure status_update [2023-11-19 04:45:46,821 INFO L130 BoogieDeclarations]: Found specification of procedure message_send [2023-11-19 04:45:46,821 INFO L138 BoogieDeclarations]: Found implementation of procedure message_send [2023-11-19 04:45:46,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-19 04:45:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure ASIdle [2023-11-19 04:45:46,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ASIdle [2023-11-19 04:45:46,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 04:45:46,856 INFO L130 BoogieDeclarations]: Found specification of procedure system_initialize [2023-11-19 04:45:46,857 INFO L138 BoogieDeclarations]: Found implementation of procedure system_initialize [2023-11-19 04:45:46,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 04:45:46,858 INFO L130 BoogieDeclarations]: Found specification of procedure ASStop [2023-11-19 04:45:46,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStop [2023-11-19 04:45:46,858 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2023-11-19 04:45:46,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 04:45:46,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 04:45:47,048 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 04:45:47,051 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 04:45:47,957 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 04:45:48,046 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 04:45:48,046 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 04:45:48,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:45:48 BoogieIcfgContainer [2023-11-19 04:45:48,060 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 04:45:48,063 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 04:45:48,063 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 04:45:48,066 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 04:45:48,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 04:45:45" (1/3) ... [2023-11-19 04:45:48,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@180d3340 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:45:48, skipping insertion in model container [2023-11-19 04:45:48,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:45:46" (2/3) ... [2023-11-19 04:45:48,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@180d3340 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:45:48, skipping insertion in model container [2023-11-19 04:45:48,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:45:48" (3/3) ... [2023-11-19 04:45:48,071 INFO L112 eAbstractionObserver]: Analyzing ICFG system-with-recursion.i [2023-11-19 04:45:48,089 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 04:45:48,090 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 162 error locations. [2023-11-19 04:45:48,175 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 04:45:48,181 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;@697393dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 04:45:48,182 INFO L358 AbstractCegarLoop]: Starting to check reachability of 162 error locations. [2023-11-19 04:45:48,187 INFO L276 IsEmpty]: Start isEmpty. Operand has 358 states, 157 states have (on average 2.1910828025477707) internal successors, (344), 319 states have internal predecessors, (344), 29 states have call successors, (29), 9 states have call predecessors, (29), 9 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2023-11-19 04:45:48,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-19 04:45:48,193 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:45:48,194 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 04:45:48,195 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-19 04:45:48,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:45:48,200 INFO L85 PathProgramCache]: Analyzing trace with hash 589464126, now seen corresponding path program 1 times [2023-11-19 04:45:48,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:45:48,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472155797] [2023-11-19 04:45:48,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:45:48,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:45:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:45:48,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:45:48,498 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:45:48,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472155797] [2023-11-19 04:45:48,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472155797] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:45:48,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:45:48,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 04:45:48,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753211558] [2023-11-19 04:45:48,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:45:48,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:45:48,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:45:48,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:45:48,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:45:48,538 INFO L87 Difference]: Start difference. First operand has 358 states, 157 states have (on average 2.1910828025477707) internal successors, (344), 319 states have internal predecessors, (344), 29 states have call successors, (29), 9 states have call predecessors, (29), 9 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2023-11-19 04:45:48,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:45:48,928 INFO L93 Difference]: Finished difference Result 382 states and 443 transitions. [2023-11-19 04:45:48,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:45:48,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 5 [2023-11-19 04:45:48,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:45:48,946 INFO L225 Difference]: With dead ends: 382 [2023-11-19 04:45:48,947 INFO L226 Difference]: Without dead ends: 381 [2023-11-19 04:45:48,948 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 [2023-11-19 04:45:48,952 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 356 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 04:45:48,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 235 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 04:45:48,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2023-11-19 04:45:49,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 352. [2023-11-19 04:45:49,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 170 states have (on average 2.0) internal successors, (340), 308 states have internal predecessors, (340), 32 states have call successors, (32), 11 states have call predecessors, (32), 11 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2023-11-19 04:45:49,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 409 transitions. [2023-11-19 04:45:49,027 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 409 transitions. Word has length 5 [2023-11-19 04:45:49,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:45:49,027 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 409 transitions. [2023-11-19 04:45:49,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2023-11-19 04:45:49,028 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 409 transitions. [2023-11-19 04:45:49,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-19 04:45:49,029 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:45:49,029 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 04:45:49,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 04:45:49,030 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-19 04:45:49,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:45:49,031 INFO L85 PathProgramCache]: Analyzing trace with hash 589464127, now seen corresponding path program 1 times [2023-11-19 04:45:49,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:45:49,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902830191] [2023-11-19 04:45:49,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:45:49,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:45:49,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:45:49,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:45:49,267 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:45:49,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902830191] [2023-11-19 04:45:49,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902830191] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:45:49,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:45:49,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:45:49,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798218822] [2023-11-19 04:45:49,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:45:49,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:45:49,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:45:49,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:45:49,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:45:49,273 INFO L87 Difference]: Start difference. First operand 352 states and 409 transitions. Second operand has 4 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2023-11-19 04:45:50,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:45:50,006 INFO L93 Difference]: Finished difference Result 433 states and 517 transitions. [2023-11-19 04:45:50,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 04:45:50,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 5 [2023-11-19 04:45:50,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:45:50,012 INFO L225 Difference]: With dead ends: 433 [2023-11-19 04:45:50,012 INFO L226 Difference]: Without dead ends: 433 [2023-11-19 04:45:50,013 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 [2023-11-19 04:45:50,015 INFO L413 NwaCegarLoop]: 302 mSDtfsCounter, 114 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-19 04:45:50,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 642 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-19 04:45:50,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2023-11-19 04:45:50,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 412. [2023-11-19 04:45:50,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 219 states have (on average 1.8721461187214612) internal successors, (410), 353 states have internal predecessors, (410), 42 states have call successors, (42), 18 states have call predecessors, (42), 18 states have return successors, (54), 40 states have call predecessors, (54), 42 states have call successors, (54) [2023-11-19 04:45:50,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 506 transitions. [2023-11-19 04:45:50,074 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 506 transitions. Word has length 5 [2023-11-19 04:45:50,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:45:50,074 INFO L495 AbstractCegarLoop]: Abstraction has 412 states and 506 transitions. [2023-11-19 04:45:50,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2023-11-19 04:45:50,075 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 506 transitions. [2023-11-19 04:45:50,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-19 04:45:50,075 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:45:50,076 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:45:50,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 04:45:50,077 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-19 04:45:50,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:45:50,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1395036813, now seen corresponding path program 1 times [2023-11-19 04:45:50,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:45:50,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877591761] [2023-11-19 04:45:50,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:45:50,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:45:50,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:45:50,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:45:50,345 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:45:50,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877591761] [2023-11-19 04:45:50,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877591761] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:45:50,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:45:50,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 04:45:50,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087718321] [2023-11-19 04:45:50,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:45:50,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 04:45:50,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:45:50,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 04:45:50,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:45:50,356 INFO L87 Difference]: Start difference. First operand 412 states and 506 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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) [2023-11-19 04:45:50,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:45:50,891 INFO L93 Difference]: Finished difference Result 411 states and 505 transitions. [2023-11-19 04:45:50,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 04:45:50,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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 8 [2023-11-19 04:45:50,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:45:50,899 INFO L225 Difference]: With dead ends: 411 [2023-11-19 04:45:50,901 INFO L226 Difference]: Without dead ends: 411 [2023-11-19 04:45:50,901 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 [2023-11-19 04:45:50,903 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 10 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 04:45:50,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 899 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-19 04:45:50,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2023-11-19 04:45:50,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2023-11-19 04:45:50,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 219 states have (on average 1.8675799086757991) internal successors, (409), 352 states have internal predecessors, (409), 42 states have call successors, (42), 18 states have call predecessors, (42), 18 states have return successors, (54), 40 states have call predecessors, (54), 42 states have call successors, (54) [2023-11-19 04:45:50,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 505 transitions. [2023-11-19 04:45:50,934 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 505 transitions. Word has length 8 [2023-11-19 04:45:50,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:45:50,934 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 505 transitions. [2023-11-19 04:45:50,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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) [2023-11-19 04:45:50,935 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 505 transitions. [2023-11-19 04:45:50,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-19 04:45:50,935 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:45:50,935 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:45:50,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 04:45:50,936 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-19 04:45:50,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:45:50,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1395036812, now seen corresponding path program 1 times [2023-11-19 04:45:50,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:45:50,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052652839] [2023-11-19 04:45:50,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:45:50,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:45:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:45:51,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:45:51,173 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:45:51,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052652839] [2023-11-19 04:45:51,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052652839] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:45:51,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:45:51,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 04:45:51,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402509467] [2023-11-19 04:45:51,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:45:51,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 04:45:51,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:45:51,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 04:45:51,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:45:51,176 INFO L87 Difference]: Start difference. First operand 411 states and 505 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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) [2023-11-19 04:45:51,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:45:51,754 INFO L93 Difference]: Finished difference Result 410 states and 504 transitions. [2023-11-19 04:45:51,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 04:45:51,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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 8 [2023-11-19 04:45:51,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:45:51,760 INFO L225 Difference]: With dead ends: 410 [2023-11-19 04:45:51,761 INFO L226 Difference]: Without dead ends: 410 [2023-11-19 04:45:51,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:45:51,765 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 7 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 04:45:51,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 877 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-19 04:45:51,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2023-11-19 04:45:51,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2023-11-19 04:45:51,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 219 states have (on average 1.8630136986301369) internal successors, (408), 351 states have internal predecessors, (408), 42 states have call successors, (42), 18 states have call predecessors, (42), 18 states have return successors, (54), 40 states have call predecessors, (54), 42 states have call successors, (54) [2023-11-19 04:45:51,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 504 transitions. [2023-11-19 04:45:51,802 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 504 transitions. Word has length 8 [2023-11-19 04:45:51,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:45:51,802 INFO L495 AbstractCegarLoop]: Abstraction has 410 states and 504 transitions. [2023-11-19 04:45:51,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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) [2023-11-19 04:45:51,803 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 504 transitions. [2023-11-19 04:45:51,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-19 04:45:51,804 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:45:51,804 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:45:51,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 04:45:51,804 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-19 04:45:51,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:45:51,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1515620074, now seen corresponding path program 1 times [2023-11-19 04:45:51,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:45:51,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900817428] [2023-11-19 04:45:51,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:45:51,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:45:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:45:51,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:45:51,917 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:45:51,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900817428] [2023-11-19 04:45:51,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900817428] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:45:51,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:45:51,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 04:45:51,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636198734] [2023-11-19 04:45:51,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:45:51,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:45:51,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:45:51,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:45:51,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:45:51,920 INFO L87 Difference]: Start difference. First operand 410 states and 504 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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) [2023-11-19 04:45:52,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:45:52,192 INFO L93 Difference]: Finished difference Result 409 states and 503 transitions. [2023-11-19 04:45:52,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:45:52,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 12 [2023-11-19 04:45:52,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:45:52,195 INFO L225 Difference]: With dead ends: 409 [2023-11-19 04:45:52,195 INFO L226 Difference]: Without dead ends: 409 [2023-11-19 04:45:52,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 [2023-11-19 04:45:52,197 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 2 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 04:45:52,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 518 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 04:45:52,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2023-11-19 04:45:52,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2023-11-19 04:45:52,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 219 states have (on average 1.8584474885844748) internal successors, (407), 350 states have internal predecessors, (407), 42 states have call successors, (42), 18 states have call predecessors, (42), 18 states have return successors, (54), 40 states have call predecessors, (54), 42 states have call successors, (54) [2023-11-19 04:45:52,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 503 transitions. [2023-11-19 04:45:52,231 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 503 transitions. Word has length 12 [2023-11-19 04:45:52,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:45:52,232 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 503 transitions. [2023-11-19 04:45:52,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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) [2023-11-19 04:45:52,232 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 503 transitions. [2023-11-19 04:45:52,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-19 04:45:52,233 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:45:52,233 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:45:52,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 04:45:52,233 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-19 04:45:52,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:45:52,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1515620073, now seen corresponding path program 1 times [2023-11-19 04:45:52,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:45:52,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442578713] [2023-11-19 04:45:52,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:45:52,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:45:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:45:52,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:45:52,339 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:45:52,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442578713] [2023-11-19 04:45:52,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442578713] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:45:52,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:45:52,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 04:45:52,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572187475] [2023-11-19 04:45:52,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:45:52,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:45:52,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:45:52,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:45:52,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:45:52,342 INFO L87 Difference]: Start difference. First operand 409 states and 503 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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) [2023-11-19 04:45:52,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:45:52,624 INFO L93 Difference]: Finished difference Result 408 states and 502 transitions. [2023-11-19 04:45:52,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:45:52,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 12 [2023-11-19 04:45:52,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:45:52,634 INFO L225 Difference]: With dead ends: 408 [2023-11-19 04:45:52,634 INFO L226 Difference]: Without dead ends: 408 [2023-11-19 04:45:52,635 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 [2023-11-19 04:45:52,635 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 1 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 04:45:52,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 504 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 04:45:52,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2023-11-19 04:45:52,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2023-11-19 04:45:52,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 219 states have (on average 1.8538812785388128) internal successors, (406), 349 states have internal predecessors, (406), 42 states have call successors, (42), 18 states have call predecessors, (42), 18 states have return successors, (54), 40 states have call predecessors, (54), 42 states have call successors, (54) [2023-11-19 04:45:52,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 502 transitions. [2023-11-19 04:45:52,669 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 502 transitions. Word has length 12 [2023-11-19 04:45:52,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:45:52,669 INFO L495 AbstractCegarLoop]: Abstraction has 408 states and 502 transitions. [2023-11-19 04:45:52,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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) [2023-11-19 04:45:52,669 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 502 transitions. [2023-11-19 04:45:52,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-19 04:45:52,671 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:45:52,671 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] [2023-11-19 04:45:52,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 04:45:52,672 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-19 04:45:52,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:45:52,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1434793994, now seen corresponding path program 1 times [2023-11-19 04:45:52,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:45:52,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46938471] [2023-11-19 04:45:52,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:45:52,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:45:52,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:45:52,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:45:52,958 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:45:52,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46938471] [2023-11-19 04:45:52,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46938471] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:45:52,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:45:52,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 04:45:52,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233479155] [2023-11-19 04:45:52,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:45:52,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 04:45:52,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:45:52,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 04:45:52,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:45:52,961 INFO L87 Difference]: Start difference. First operand 408 states and 502 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 04:45:53,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:45:53,662 INFO L93 Difference]: Finished difference Result 438 states and 547 transitions. [2023-11-19 04:45:53,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 04:45:53,663 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2023-11-19 04:45:53,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:45:53,666 INFO L225 Difference]: With dead ends: 438 [2023-11-19 04:45:53,667 INFO L226 Difference]: Without dead ends: 438 [2023-11-19 04:45:53,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-19 04:45:53,668 INFO L413 NwaCegarLoop]: 311 mSDtfsCounter, 44 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-19 04:45:53,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1244 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-19 04:45:53,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2023-11-19 04:45:53,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 427. [2023-11-19 04:45:53,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 234 states have (on average 1.829059829059829) internal successors, (428), 365 states have internal predecessors, (428), 43 states have call successors, (43), 20 states have call predecessors, (43), 21 states have return successors, (58), 41 states have call predecessors, (58), 43 states have call successors, (58) [2023-11-19 04:45:53,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 529 transitions. [2023-11-19 04:45:53,691 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 529 transitions. Word has length 20 [2023-11-19 04:45:53,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:45:53,693 INFO L495 AbstractCegarLoop]: Abstraction has 427 states and 529 transitions. [2023-11-19 04:45:53,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 04:45:53,693 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 529 transitions. [2023-11-19 04:45:53,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-19 04:45:53,694 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:45:53,694 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] [2023-11-19 04:45:53,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 04:45:53,695 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ASNullErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-19 04:45:53,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:45:53,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1434793993, now seen corresponding path program 1 times [2023-11-19 04:45:53,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:45:53,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010560921] [2023-11-19 04:45:53,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:45:53,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:45:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:45:54,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:45:54,128 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:45:54,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010560921] [2023-11-19 04:45:54,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010560921] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:45:54,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:45:54,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 04:45:54,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928474121] [2023-11-19 04:45:54,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:45:54,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 04:45:54,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:45:54,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 04:45:54,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:45:54,131 INFO L87 Difference]: Start difference. First operand 427 states and 529 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 04:45:55,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:45:55,012 INFO L93 Difference]: Finished difference Result 437 states and 546 transitions. [2023-11-19 04:45:55,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 04:45:55,013 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2023-11-19 04:45:55,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:45:55,017 INFO L225 Difference]: With dead ends: 437 [2023-11-19 04:45:55,018 INFO L226 Difference]: Without dead ends: 437 [2023-11-19 04:45:55,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-19 04:45:55,020 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 38 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-19 04:45:55,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 1184 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-19 04:45:55,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2023-11-19 04:45:55,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 427. [2023-11-19 04:45:55,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 234 states have (on average 1.8247863247863247) internal successors, (427), 365 states have internal predecessors, (427), 43 states have call successors, (43), 20 states have call predecessors, (43), 21 states have return successors, (58), 41 states have call predecessors, (58), 43 states have call successors, (58) [2023-11-19 04:45:55,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 528 transitions. [2023-11-19 04:45:55,047 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 528 transitions. Word has length 20 [2023-11-19 04:45:55,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:45:55,048 INFO L495 AbstractCegarLoop]: Abstraction has 427 states and 528 transitions. [2023-11-19 04:45:55,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 04:45:55,048 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 528 transitions. [2023-11-19 04:45:55,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-19 04:45:55,053 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:45:55,054 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] [2023-11-19 04:45:55,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 04:45:55,054 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-19 04:45:55,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:45:55,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1540239653, now seen corresponding path program 1 times [2023-11-19 04:45:55,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:45:55,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135821521] [2023-11-19 04:45:55,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:45:55,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:45:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:45:55,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:45:55,259 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:45:55,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135821521] [2023-11-19 04:45:55,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135821521] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:45:55,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:45:55,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 04:45:55,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336870329] [2023-11-19 04:45:55,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:45:55,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 04:45:55,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:45:55,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 04:45:55,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:45:55,263 INFO L87 Difference]: Start difference. First operand 427 states and 528 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 04:45:56,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:45:56,069 INFO L93 Difference]: Finished difference Result 523 states and 664 transitions. [2023-11-19 04:45:56,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 04:45:56,070 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-11-19 04:45:56,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:45:56,074 INFO L225 Difference]: With dead ends: 523 [2023-11-19 04:45:56,074 INFO L226 Difference]: Without dead ends: 523 [2023-11-19 04:45:56,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-19 04:45:56,075 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 160 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-19 04:45:56,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 1186 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 941 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-19 04:45:56,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2023-11-19 04:45:56,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 459. [2023-11-19 04:45:56,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 257 states have (on average 1.8054474708171206) internal successors, (464), 391 states have internal predecessors, (464), 49 states have call successors, (49), 24 states have call predecessors, (49), 24 states have return successors, (70), 43 states have call predecessors, (70), 49 states have call successors, (70) [2023-11-19 04:45:56,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 583 transitions. [2023-11-19 04:45:56,113 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 583 transitions. Word has length 21 [2023-11-19 04:45:56,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:45:56,113 INFO L495 AbstractCegarLoop]: Abstraction has 459 states and 583 transitions. [2023-11-19 04:45:56,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 04:45:56,113 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 583 transitions. [2023-11-19 04:45:56,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-19 04:45:56,114 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:45:56,114 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] [2023-11-19 04:45:56,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 04:45:56,115 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-19 04:45:56,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:45:56,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1540239652, now seen corresponding path program 1 times [2023-11-19 04:45:56,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:45:56,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381985614] [2023-11-19 04:45:56,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:45:56,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:45:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:45:56,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:45:56,482 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:45:56,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381985614] [2023-11-19 04:45:56,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381985614] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:45:56,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:45:56,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 04:45:56,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897823043] [2023-11-19 04:45:56,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:45:56,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 04:45:56,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:45:56,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 04:45:56,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-19 04:45:56,484 INFO L87 Difference]: Start difference. First operand 459 states and 583 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 04:45:57,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:45:57,281 INFO L93 Difference]: Finished difference Result 442 states and 529 transitions. [2023-11-19 04:45:57,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-19 04:45:57,281 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-11-19 04:45:57,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:45:57,284 INFO L225 Difference]: With dead ends: 442 [2023-11-19 04:45:57,285 INFO L226 Difference]: Without dead ends: 442 [2023-11-19 04:45:57,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-11-19 04:45:57,286 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 426 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-19 04:45:57,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 715 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-19 04:45:57,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2023-11-19 04:45:57,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 392. [2023-11-19 04:45:57,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 206 states have (on average 1.8446601941747574) internal successors, (380), 339 states have internal predecessors, (380), 39 states have call successors, (39), 18 states have call predecessors, (39), 18 states have return successors, (51), 34 states have call predecessors, (51), 39 states have call successors, (51) [2023-11-19 04:45:57,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 470 transitions. [2023-11-19 04:45:57,301 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 470 transitions. Word has length 21 [2023-11-19 04:45:57,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:45:57,301 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 470 transitions. [2023-11-19 04:45:57,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 04:45:57,301 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 470 transitions. [2023-11-19 04:45:57,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-19 04:45:57,302 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:45:57,302 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] [2023-11-19 04:45:57,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 04:45:57,304 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting system_initializeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-19 04:45:57,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:45:57,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1632919712, now seen corresponding path program 1 times [2023-11-19 04:45:57,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:45:57,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510847655] [2023-11-19 04:45:57,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:45:57,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:45:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:45:57,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:45:57,435 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:45:57,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510847655] [2023-11-19 04:45:57,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510847655] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:45:57,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:45:57,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 04:45:57,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687712187] [2023-11-19 04:45:57,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:45:57,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:45:57,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:45:57,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:45:57,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:45:57,437 INFO L87 Difference]: Start difference. First operand 392 states and 470 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 04:45:57,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:45:57,616 INFO L93 Difference]: Finished difference Result 403 states and 481 transitions. [2023-11-19 04:45:57,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 04:45:57,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-11-19 04:45:57,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:45:57,621 INFO L225 Difference]: With dead ends: 403 [2023-11-19 04:45:57,621 INFO L226 Difference]: Without dead ends: 401 [2023-11-19 04:45:57,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:45:57,622 INFO L413 NwaCegarLoop]: 311 mSDtfsCounter, 20 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 04:45:57,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 907 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 04:45:57,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2023-11-19 04:45:57,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 399. [2023-11-19 04:45:57,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 212 states have (on average 1.8349056603773586) internal successors, (389), 345 states have internal predecessors, (389), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (51), 34 states have call predecessors, (51), 39 states have call successors, (51) [2023-11-19 04:45:57,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 479 transitions. [2023-11-19 04:45:57,640 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 479 transitions. Word has length 30 [2023-11-19 04:45:57,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:45:57,641 INFO L495 AbstractCegarLoop]: Abstraction has 399 states and 479 transitions. [2023-11-19 04:45:57,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 04:45:57,641 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 479 transitions. [2023-11-19 04:45:57,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-19 04:45:57,646 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:45:57,646 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] [2023-11-19 04:45:57,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 04:45:57,647 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-19 04:45:57,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:45:57,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1863406002, now seen corresponding path program 1 times [2023-11-19 04:45:57,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:45:57,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364424813] [2023-11-19 04:45:57,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:45:57,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:45:57,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:45:57,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:45:57,977 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:45:57,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364424813] [2023-11-19 04:45:57,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364424813] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:45:57,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:45:57,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-19 04:45:57,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712192198] [2023-11-19 04:45:57,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:45:57,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-19 04:45:57,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:45:57,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-19 04:45:57,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-19 04:45:57,980 INFO L87 Difference]: Start difference. First operand 399 states and 479 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 04:45:58,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:45:58,879 INFO L93 Difference]: Finished difference Result 442 states and 562 transitions. [2023-11-19 04:45:58,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 04:45:58,879 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2023-11-19 04:45:58,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:45:58,882 INFO L225 Difference]: With dead ends: 442 [2023-11-19 04:45:58,883 INFO L226 Difference]: Without dead ends: 436 [2023-11-19 04:45:58,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-11-19 04:45:58,884 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 133 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1907 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-19 04:45:58,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1907 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-19 04:45:58,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2023-11-19 04:45:58,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 399. [2023-11-19 04:45:58,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 212 states have (on average 1.830188679245283) internal successors, (388), 345 states have internal predecessors, (388), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (51), 34 states have call predecessors, (51), 39 states have call successors, (51) [2023-11-19 04:45:58,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 478 transitions. [2023-11-19 04:45:58,905 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 478 transitions. Word has length 29 [2023-11-19 04:45:58,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:45:58,905 INFO L495 AbstractCegarLoop]: Abstraction has 399 states and 478 transitions. [2023-11-19 04:45:58,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 04:45:58,905 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 478 transitions. [2023-11-19 04:45:58,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-19 04:45:58,908 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:45:58,908 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] [2023-11-19 04:45:58,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 04:45:58,908 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting system_initializeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-19 04:45:58,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:45:58,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1640573506, now seen corresponding path program 1 times [2023-11-19 04:45:58,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:45:58,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330972793] [2023-11-19 04:45:58,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:45:58,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:45:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:45:59,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:45:59,171 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:45:59,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330972793] [2023-11-19 04:45:59,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330972793] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:45:59,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:45:59,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-19 04:45:59,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069398365] [2023-11-19 04:45:59,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:45:59,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-19 04:45:59,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:45:59,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-19 04:45:59,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-19 04:45:59,173 INFO L87 Difference]: Start difference. First operand 399 states and 478 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 04:46:00,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:46:00,286 INFO L93 Difference]: Finished difference Result 600 states and 818 transitions. [2023-11-19 04:46:00,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-19 04:46:00,287 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2023-11-19 04:46:00,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:46:00,291 INFO L225 Difference]: With dead ends: 600 [2023-11-19 04:46:00,292 INFO L226 Difference]: Without dead ends: 594 [2023-11-19 04:46:00,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2023-11-19 04:46:00,293 INFO L413 NwaCegarLoop]: 376 mSDtfsCounter, 299 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 1421 SdHoareTripleChecker+Invalid, 1170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-19 04:46:00,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 1421 Invalid, 1170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1084 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-19 04:46:00,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2023-11-19 04:46:00,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 552. [2023-11-19 04:46:00,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 327 states have (on average 1.672782874617737) internal successors, (547), 453 states have internal predecessors, (547), 55 states have call successors, (55), 29 states have call predecessors, (55), 41 states have return successors, (178), 69 states have call predecessors, (178), 55 states have call successors, (178) [2023-11-19 04:46:00,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 780 transitions. [2023-11-19 04:46:00,322 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 780 transitions. Word has length 32 [2023-11-19 04:46:00,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:46:00,323 INFO L495 AbstractCegarLoop]: Abstraction has 552 states and 780 transitions. [2023-11-19 04:46:00,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 04:46:00,323 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 780 transitions. [2023-11-19 04:46:00,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-19 04:46:00,324 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:46:00,324 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] [2023-11-19 04:46:00,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 04:46:00,324 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting system_initializeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-19 04:46:00,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:46:00,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1069311814, now seen corresponding path program 1 times [2023-11-19 04:46:00,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:46:00,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738967886] [2023-11-19 04:46:00,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:46:00,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:46:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:46:00,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:46:00,702 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:46:00,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738967886] [2023-11-19 04:46:00,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738967886] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:46:00,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:46:00,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 04:46:00,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817453427] [2023-11-19 04:46:00,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:46:00,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 04:46:00,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:46:00,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 04:46:00,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-19 04:46:00,705 INFO L87 Difference]: Start difference. First operand 552 states and 780 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 04:46:01,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:46:01,478 INFO L93 Difference]: Finished difference Result 581 states and 842 transitions. [2023-11-19 04:46:01,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 04:46:01,479 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2023-11-19 04:46:01,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:46:01,486 INFO L225 Difference]: With dead ends: 581 [2023-11-19 04:46:01,486 INFO L226 Difference]: Without dead ends: 581 [2023-11-19 04:46:01,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-11-19 04:46:01,488 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 646 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-19 04:46:01,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 294 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-19 04:46:01,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2023-11-19 04:46:01,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 556. [2023-11-19 04:46:01,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 345 states have (on average 1.5478260869565217) internal successors, (534), 446 states have internal predecessors, (534), 55 states have call successors, (55), 29 states have call predecessors, (55), 46 states have return successors, (207), 80 states have call predecessors, (207), 55 states have call successors, (207) [2023-11-19 04:46:01,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 796 transitions. [2023-11-19 04:46:01,527 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 796 transitions. Word has length 33 [2023-11-19 04:46:01,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:46:01,528 INFO L495 AbstractCegarLoop]: Abstraction has 556 states and 796 transitions. [2023-11-19 04:46:01,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 04:46:01,529 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 796 transitions. [2023-11-19 04:46:01,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-19 04:46:01,530 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:46:01,531 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] [2023-11-19 04:46:01,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 04:46:01,533 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-19 04:46:01,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:46:01,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1211072226, now seen corresponding path program 1 times [2023-11-19 04:46:01,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:46:01,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178311791] [2023-11-19 04:46:01,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:46:01,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:46:01,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:46:02,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:46:02,508 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:46:02,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178311791] [2023-11-19 04:46:02,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178311791] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:46:02,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:46:02,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-19 04:46:02,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73251927] [2023-11-19 04:46:02,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:46:02,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-19 04:46:02,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:46:02,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-19 04:46:02,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-11-19 04:46:02,511 INFO L87 Difference]: Start difference. First operand 556 states and 796 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 04:46:04,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:46:04,018 INFO L93 Difference]: Finished difference Result 608 states and 899 transitions. [2023-11-19 04:46:04,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-19 04:46:04,019 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2023-11-19 04:46:04,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:46:04,024 INFO L225 Difference]: With dead ends: 608 [2023-11-19 04:46:04,024 INFO L226 Difference]: Without dead ends: 608 [2023-11-19 04:46:04,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2023-11-19 04:46:04,025 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 338 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 1593 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 1502 SdHoareTripleChecker+Invalid, 1705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-19 04:46:04,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 1502 Invalid, 1705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1593 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-19 04:46:04,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2023-11-19 04:46:04,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 561. [2023-11-19 04:46:04,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 349 states have (on average 1.5444126074498568) internal successors, (539), 449 states have internal predecessors, (539), 56 states have call successors, (56), 30 states have call predecessors, (56), 46 states have return successors, (209), 81 states have call predecessors, (209), 56 states have call successors, (209) [2023-11-19 04:46:04,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 804 transitions. [2023-11-19 04:46:04,059 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 804 transitions. Word has length 34 [2023-11-19 04:46:04,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:46:04,059 INFO L495 AbstractCegarLoop]: Abstraction has 561 states and 804 transitions. [2023-11-19 04:46:04,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 04:46:04,060 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 804 transitions. [2023-11-19 04:46:04,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-19 04:46:04,060 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:46:04,061 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] [2023-11-19 04:46:04,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 04:46:04,061 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting system_initializeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-19 04:46:04,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:46:04,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1211072227, now seen corresponding path program 1 times [2023-11-19 04:46:04,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:46:04,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174168693] [2023-11-19 04:46:04,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:46:04,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:46:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:46:05,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:46:05,435 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:46:05,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174168693] [2023-11-19 04:46:05,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174168693] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:46:05,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:46:05,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-19 04:46:05,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812560584] [2023-11-19 04:46:05,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:46:05,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-19 04:46:05,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:46:05,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-19 04:46:05,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-11-19 04:46:05,437 INFO L87 Difference]: Start difference. First operand 561 states and 804 transitions. Second operand has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 04:46:06,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:46:06,809 INFO L93 Difference]: Finished difference Result 607 states and 898 transitions. [2023-11-19 04:46:06,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-19 04:46:06,810 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2023-11-19 04:46:06,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:46:06,815 INFO L225 Difference]: With dead ends: 607 [2023-11-19 04:46:06,815 INFO L226 Difference]: Without dead ends: 607 [2023-11-19 04:46:06,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2023-11-19 04:46:06,817 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 352 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 1280 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 1396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-19 04:46:06,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 1082 Invalid, 1396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1280 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-19 04:46:06,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2023-11-19 04:46:06,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 561. [2023-11-19 04:46:06,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 349 states have (on average 1.5415472779369628) internal successors, (538), 449 states have internal predecessors, (538), 56 states have call successors, (56), 30 states have call predecessors, (56), 46 states have return successors, (209), 81 states have call predecessors, (209), 56 states have call successors, (209) [2023-11-19 04:46:06,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 803 transitions. [2023-11-19 04:46:06,857 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 803 transitions. Word has length 34 [2023-11-19 04:46:06,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:46:06,858 INFO L495 AbstractCegarLoop]: Abstraction has 561 states and 803 transitions. [2023-11-19 04:46:06,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 04:46:06,859 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 803 transitions. [2023-11-19 04:46:06,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-19 04:46:06,861 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:46:06,861 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] [2023-11-19 04:46:06,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-19 04:46:06,862 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting system_initializeErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-19 04:46:06,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:46:06,864 INFO L85 PathProgramCache]: Analyzing trace with hash -95723773, now seen corresponding path program 1 times [2023-11-19 04:46:06,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:46:06,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874964510] [2023-11-19 04:46:06,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:46:06,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:46:06,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:46:06,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:46:06,991 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:46:06,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874964510] [2023-11-19 04:46:06,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874964510] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:46:06,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:46:06,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 04:46:06,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197284514] [2023-11-19 04:46:06,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:46:06,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:46:06,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:46:06,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:46:06,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:46:06,995 INFO L87 Difference]: Start difference. First operand 561 states and 803 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 04:46:07,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:46:07,231 INFO L93 Difference]: Finished difference Result 559 states and 801 transitions. [2023-11-19 04:46:07,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:46:07,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2023-11-19 04:46:07,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:46:07,237 INFO L225 Difference]: With dead ends: 559 [2023-11-19 04:46:07,237 INFO L226 Difference]: Without dead ends: 559 [2023-11-19 04:46:07,237 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 [2023-11-19 04:46:07,238 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 7 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 04:46:07,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 467 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 04:46:07,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2023-11-19 04:46:07,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2023-11-19 04:46:07,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 349 states have (on average 1.5358166189111748) internal successors, (536), 447 states have internal predecessors, (536), 56 states have call successors, (56), 30 states have call predecessors, (56), 46 states have return successors, (209), 81 states have call predecessors, (209), 56 states have call successors, (209) [2023-11-19 04:46:07,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 801 transitions. [2023-11-19 04:46:07,268 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 801 transitions. Word has length 36 [2023-11-19 04:46:07,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:46:07,269 INFO L495 AbstractCegarLoop]: Abstraction has 559 states and 801 transitions. [2023-11-19 04:46:07,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 04:46:07,269 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 801 transitions. [2023-11-19 04:46:07,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-19 04:46:07,270 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:46:07,270 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] [2023-11-19 04:46:07,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-19 04:46:07,271 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting system_initializeErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-19 04:46:07,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:46:07,271 INFO L85 PathProgramCache]: Analyzing trace with hash -95723772, now seen corresponding path program 1 times [2023-11-19 04:46:07,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:46:07,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251234702] [2023-11-19 04:46:07,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:46:07,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:46:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:46:07,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:46:07,392 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:46:07,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251234702] [2023-11-19 04:46:07,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251234702] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:46:07,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:46:07,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 04:46:07,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488255821] [2023-11-19 04:46:07,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:46:07,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:46:07,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:46:07,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:46:07,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:46:07,395 INFO L87 Difference]: Start difference. First operand 559 states and 801 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 04:46:07,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:46:07,643 INFO L93 Difference]: Finished difference Result 557 states and 799 transitions. [2023-11-19 04:46:07,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:46:07,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2023-11-19 04:46:07,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:46:07,648 INFO L225 Difference]: With dead ends: 557 [2023-11-19 04:46:07,649 INFO L226 Difference]: Without dead ends: 557 [2023-11-19 04:46:07,649 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 [2023-11-19 04:46:07,650 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 5 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 04:46:07,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 473 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 04:46:07,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2023-11-19 04:46:07,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2023-11-19 04:46:07,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 349 states have (on average 1.5300859598853869) internal successors, (534), 445 states have internal predecessors, (534), 56 states have call successors, (56), 30 states have call predecessors, (56), 46 states have return successors, (209), 81 states have call predecessors, (209), 56 states have call successors, (209) [2023-11-19 04:46:07,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 799 transitions. [2023-11-19 04:46:07,689 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 799 transitions. Word has length 36 [2023-11-19 04:46:07,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:46:07,689 INFO L495 AbstractCegarLoop]: Abstraction has 557 states and 799 transitions. [2023-11-19 04:46:07,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 04:46:07,690 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 799 transitions. [2023-11-19 04:46:07,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-19 04:46:07,690 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:46:07,691 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:46:07,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-19 04:46:07,691 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-19 04:46:07,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:46:07,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1285346563, now seen corresponding path program 1 times [2023-11-19 04:46:07,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:46:07,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736720020] [2023-11-19 04:46:07,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:46:07,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:46:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:46:07,930 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:46:07,930 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:46:07,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736720020] [2023-11-19 04:46:07,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736720020] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:46:07,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:46:07,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 04:46:07,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870629406] [2023-11-19 04:46:07,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:46:07,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 04:46:07,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:46:07,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 04:46:07,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:46:07,934 INFO L87 Difference]: Start difference. First operand 557 states and 799 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 04:46:08,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:46:08,582 INFO L93 Difference]: Finished difference Result 585 states and 852 transitions. [2023-11-19 04:46:08,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 04:46:08,583 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2023-11-19 04:46:08,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:46:08,589 INFO L225 Difference]: With dead ends: 585 [2023-11-19 04:46:08,589 INFO L226 Difference]: Without dead ends: 585 [2023-11-19 04:46:08,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-19 04:46:08,590 INFO L413 NwaCegarLoop]: 296 mSDtfsCounter, 45 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-19 04:46:08,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 1149 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-19 04:46:08,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2023-11-19 04:46:08,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 577. [2023-11-19 04:46:08,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 365 states have (on average 1.526027397260274) internal successors, (557), 462 states have internal predecessors, (557), 57 states have call successors, (57), 32 states have call predecessors, (57), 49 states have return successors, (214), 82 states have call predecessors, (214), 57 states have call successors, (214) [2023-11-19 04:46:08,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 828 transitions. [2023-11-19 04:46:08,627 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 828 transitions. Word has length 44 [2023-11-19 04:46:08,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:46:08,628 INFO L495 AbstractCegarLoop]: Abstraction has 577 states and 828 transitions. [2023-11-19 04:46:08,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 04:46:08,628 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 828 transitions. [2023-11-19 04:46:08,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-19 04:46:08,629 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:46:08,629 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:46:08,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-19 04:46:08,629 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ASNullErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-19 04:46:08,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:46:08,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1285346564, now seen corresponding path program 1 times [2023-11-19 04:46:08,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:46:08,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070681883] [2023-11-19 04:46:08,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:46:08,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:46:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:46:09,063 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:46:09,063 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:46:09,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070681883] [2023-11-19 04:46:09,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070681883] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:46:09,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:46:09,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 04:46:09,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046451489] [2023-11-19 04:46:09,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:46:09,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 04:46:09,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:46:09,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 04:46:09,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:46:09,066 INFO L87 Difference]: Start difference. First operand 577 states and 828 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 04:46:09,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:46:09,766 INFO L93 Difference]: Finished difference Result 584 states and 851 transitions. [2023-11-19 04:46:09,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 04:46:09,766 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2023-11-19 04:46:09,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:46:09,771 INFO L225 Difference]: With dead ends: 584 [2023-11-19 04:46:09,771 INFO L226 Difference]: Without dead ends: 584 [2023-11-19 04:46:09,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-19 04:46:09,773 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 42 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 865 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-19 04:46:09,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 1201 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 865 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-19 04:46:09,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2023-11-19 04:46:09,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 577. [2023-11-19 04:46:09,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 365 states have (on average 1.5232876712328767) internal successors, (556), 462 states have internal predecessors, (556), 57 states have call successors, (57), 32 states have call predecessors, (57), 49 states have return successors, (214), 82 states have call predecessors, (214), 57 states have call successors, (214) [2023-11-19 04:46:09,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 827 transitions. [2023-11-19 04:46:09,808 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 827 transitions. Word has length 44 [2023-11-19 04:46:09,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:46:09,809 INFO L495 AbstractCegarLoop]: Abstraction has 577 states and 827 transitions. [2023-11-19 04:46:09,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 04:46:09,809 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 827 transitions. [2023-11-19 04:46:09,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-19 04:46:09,810 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:46:09,810 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:46:09,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-19 04:46:09,812 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-19 04:46:09,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:46:09,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1179738990, now seen corresponding path program 1 times [2023-11-19 04:46:09,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:46:09,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223487842] [2023-11-19 04:46:09,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:46:09,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:46:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:46:10,032 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:46:10,032 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:46:10,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223487842] [2023-11-19 04:46:10,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223487842] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:46:10,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:46:10,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 04:46:10,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100752001] [2023-11-19 04:46:10,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:46:10,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 04:46:10,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:46:10,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 04:46:10,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:46:10,035 INFO L87 Difference]: Start difference. First operand 577 states and 827 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 04:46:10,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:46:10,716 INFO L93 Difference]: Finished difference Result 651 states and 945 transitions. [2023-11-19 04:46:10,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 04:46:10,717 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2023-11-19 04:46:10,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:46:10,722 INFO L225 Difference]: With dead ends: 651 [2023-11-19 04:46:10,722 INFO L226 Difference]: Without dead ends: 651 [2023-11-19 04:46:10,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-19 04:46:10,723 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 162 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-19 04:46:10,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 1066 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 933 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-19 04:46:10,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2023-11-19 04:46:10,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 585. [2023-11-19 04:46:10,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 371 states have (on average 1.522911051212938) internal successors, (565), 468 states have internal predecessors, (565), 58 states have call successors, (58), 33 states have call predecessors, (58), 50 states have return successors, (218), 83 states have call predecessors, (218), 58 states have call successors, (218) [2023-11-19 04:46:10,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 841 transitions. [2023-11-19 04:46:10,755 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 841 transitions. Word has length 45 [2023-11-19 04:46:10,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:46:10,756 INFO L495 AbstractCegarLoop]: Abstraction has 585 states and 841 transitions. [2023-11-19 04:46:10,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 04:46:10,756 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 841 transitions. [2023-11-19 04:46:10,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-19 04:46:10,757 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:46:10,757 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:46:10,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-19 04:46:10,757 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-19 04:46:10,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:46:10,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1179738991, now seen corresponding path program 1 times [2023-11-19 04:46:10,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:46:10,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462209697] [2023-11-19 04:46:10,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:46:10,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:46:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:46:11,111 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:46:11,111 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:46:11,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462209697] [2023-11-19 04:46:11,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462209697] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:46:11,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:46:11,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 04:46:11,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41907046] [2023-11-19 04:46:11,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:46:11,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 04:46:11,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:46:11,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 04:46:11,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:46:11,114 INFO L87 Difference]: Start difference. First operand 585 states and 841 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 04:46:11,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:46:11,768 INFO L93 Difference]: Finished difference Result 591 states and 856 transitions. [2023-11-19 04:46:11,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 04:46:11,768 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2023-11-19 04:46:11,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:46:11,773 INFO L225 Difference]: With dead ends: 591 [2023-11-19 04:46:11,773 INFO L226 Difference]: Without dead ends: 591 [2023-11-19 04:46:11,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-19 04:46:11,774 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 39 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-19 04:46:11,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 1180 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-19 04:46:11,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2023-11-19 04:46:11,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 585. [2023-11-19 04:46:11,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 371 states have (on average 1.5202156334231807) internal successors, (564), 468 states have internal predecessors, (564), 58 states have call successors, (58), 33 states have call predecessors, (58), 50 states have return successors, (218), 83 states have call predecessors, (218), 58 states have call successors, (218) [2023-11-19 04:46:11,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 840 transitions. [2023-11-19 04:46:11,808 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 840 transitions. Word has length 45 [2023-11-19 04:46:11,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:46:11,808 INFO L495 AbstractCegarLoop]: Abstraction has 585 states and 840 transitions. [2023-11-19 04:46:11,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 04:46:11,809 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 840 transitions. [2023-11-19 04:46:11,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-19 04:46:11,809 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:46:11,809 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:46:11,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-19 04:46:11,810 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ASIdleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-19 04:46:11,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:46:11,810 INFO L85 PathProgramCache]: Analyzing trace with hash -2093585023, now seen corresponding path program 1 times [2023-11-19 04:46:11,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:46:11,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717361593] [2023-11-19 04:46:11,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:46:11,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:46:11,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:46:12,162 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:46:12,163 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:46:12,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717361593] [2023-11-19 04:46:12,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717361593] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:46:12,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:46:12,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 04:46:12,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722567235] [2023-11-19 04:46:12,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:46:12,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 04:46:12,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:46:12,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 04:46:12,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:46:12,165 INFO L87 Difference]: Start difference. First operand 585 states and 840 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 04:46:12,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:46:12,839 INFO L93 Difference]: Finished difference Result 629 states and 926 transitions. [2023-11-19 04:46:12,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 04:46:12,840 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2023-11-19 04:46:12,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:46:12,845 INFO L225 Difference]: With dead ends: 629 [2023-11-19 04:46:12,845 INFO L226 Difference]: Without dead ends: 629 [2023-11-19 04:46:12,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-19 04:46:12,846 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 54 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-19 04:46:12,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1160 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-19 04:46:12,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2023-11-19 04:46:12,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 618. [2023-11-19 04:46:12,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 395 states have (on average 1.5113924050632912) internal successors, (597), 494 states have internal predecessors, (597), 62 states have call successors, (62), 35 states have call predecessors, (62), 55 states have return successors, (246), 88 states have call predecessors, (246), 62 states have call successors, (246) [2023-11-19 04:46:12,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 905 transitions. [2023-11-19 04:46:12,878 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 905 transitions. Word has length 46 [2023-11-19 04:46:12,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:46:12,879 INFO L495 AbstractCegarLoop]: Abstraction has 618 states and 905 transitions. [2023-11-19 04:46:12,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 04:46:12,879 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 905 transitions. [2023-11-19 04:46:12,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-19 04:46:12,880 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:46:12,880 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:46:12,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-19 04:46:12,880 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ASIdleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-19 04:46:12,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:46:12,881 INFO L85 PathProgramCache]: Analyzing trace with hash -2093585024, now seen corresponding path program 1 times [2023-11-19 04:46:12,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:46:12,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829682574] [2023-11-19 04:46:12,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:46:12,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:46:12,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:46:13,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:46:13,076 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:46:13,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829682574] [2023-11-19 04:46:13,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829682574] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:46:13,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:46:13,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 04:46:13,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071608611] [2023-11-19 04:46:13,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:46:13,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 04:46:13,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:46:13,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 04:46:13,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:46:13,078 INFO L87 Difference]: Start difference. First operand 618 states and 905 transitions. Second operand has 7 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 04:46:13,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:46:13,702 INFO L93 Difference]: Finished difference Result 708 states and 1076 transitions. [2023-11-19 04:46:13,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 04:46:13,702 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2023-11-19 04:46:13,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:46:13,710 INFO L225 Difference]: With dead ends: 708 [2023-11-19 04:46:13,710 INFO L226 Difference]: Without dead ends: 708 [2023-11-19 04:46:13,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-19 04:46:13,712 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 113 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-19 04:46:13,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 1095 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-19 04:46:13,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2023-11-19 04:46:13,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 669. [2023-11-19 04:46:13,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 435 states have (on average 1.5011494252873563) internal successors, (653), 537 states have internal predecessors, (653), 64 states have call successors, (64), 38 states have call predecessors, (64), 64 states have return successors, (271), 93 states have call predecessors, (271), 64 states have call successors, (271) [2023-11-19 04:46:13,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 988 transitions. [2023-11-19 04:46:13,765 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 988 transitions. Word has length 46 [2023-11-19 04:46:13,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:46:13,765 INFO L495 AbstractCegarLoop]: Abstraction has 669 states and 988 transitions. [2023-11-19 04:46:13,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 04:46:13,766 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 988 transitions. [2023-11-19 04:46:13,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-19 04:46:13,766 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:46:13,767 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:46:13,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-19 04:46:13,767 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ASStopErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-19 04:46:13,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:46:13,768 INFO L85 PathProgramCache]: Analyzing trace with hash -487633301, now seen corresponding path program 1 times [2023-11-19 04:46:13,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:46:13,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395555658] [2023-11-19 04:46:13,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:46:13,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:46:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:46:13,942 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:46:13,942 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:46:13,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395555658] [2023-11-19 04:46:13,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395555658] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:46:13,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:46:13,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 04:46:13,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846049692] [2023-11-19 04:46:13,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:46:13,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 04:46:13,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:46:13,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 04:46:13,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:46:13,945 INFO L87 Difference]: Start difference. First operand 669 states and 988 transitions. Second operand has 7 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 04:46:14,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:46:14,581 INFO L93 Difference]: Finished difference Result 730 states and 1117 transitions. [2023-11-19 04:46:14,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 04:46:14,582 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2023-11-19 04:46:14,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:46:14,588 INFO L225 Difference]: With dead ends: 730 [2023-11-19 04:46:14,588 INFO L226 Difference]: Without dead ends: 730 [2023-11-19 04:46:14,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-19 04:46:14,589 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 85 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-19 04:46:14,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 1099 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-19 04:46:14,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2023-11-19 04:46:14,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 705. [2023-11-19 04:46:14,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 464 states have (on average 1.4978448275862069) internal successors, (695), 569 states have internal predecessors, (695), 65 states have call successors, (65), 40 states have call predecessors, (65), 70 states have return successors, (286), 95 states have call predecessors, (286), 65 states have call successors, (286) [2023-11-19 04:46:14,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1046 transitions. [2023-11-19 04:46:14,626 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1046 transitions. Word has length 47 [2023-11-19 04:46:14,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:46:14,626 INFO L495 AbstractCegarLoop]: Abstraction has 705 states and 1046 transitions. [2023-11-19 04:46:14,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 04:46:14,627 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1046 transitions. [2023-11-19 04:46:14,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-19 04:46:14,628 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:46:14,628 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:46:14,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-19 04:46:14,628 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ASStopErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-19 04:46:14,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:46:14,629 INFO L85 PathProgramCache]: Analyzing trace with hash -487633300, now seen corresponding path program 1 times [2023-11-19 04:46:14,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:46:14,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780670932] [2023-11-19 04:46:14,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:46:14,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:46:14,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:46:14,932 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:46:14,932 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:46:14,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780670932] [2023-11-19 04:46:14,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780670932] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:46:14,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:46:14,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 04:46:14,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535144335] [2023-11-19 04:46:14,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:46:14,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 04:46:14,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:46:14,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 04:46:14,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:46:14,935 INFO L87 Difference]: Start difference. First operand 705 states and 1046 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 04:46:15,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:46:15,580 INFO L93 Difference]: Finished difference Result 763 states and 1162 transitions. [2023-11-19 04:46:15,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 04:46:15,581 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2023-11-19 04:46:15,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:46:15,592 INFO L225 Difference]: With dead ends: 763 [2023-11-19 04:46:15,592 INFO L226 Difference]: Without dead ends: 763 [2023-11-19 04:46:15,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-19 04:46:15,593 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 65 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-19 04:46:15,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 1174 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-19 04:46:15,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2023-11-19 04:46:15,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 747. [2023-11-19 04:46:15,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 496 states have (on average 1.4899193548387097) internal successors, (739), 603 states have internal predecessors, (739), 69 states have call successors, (69), 42 states have call predecessors, (69), 76 states have return successors, (313), 101 states have call predecessors, (313), 69 states have call successors, (313) [2023-11-19 04:46:15,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1121 transitions. [2023-11-19 04:46:15,640 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1121 transitions. Word has length 47 [2023-11-19 04:46:15,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:46:15,640 INFO L495 AbstractCegarLoop]: Abstraction has 747 states and 1121 transitions. [2023-11-19 04:46:15,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 04:46:15,641 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1121 transitions. [2023-11-19 04:46:15,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-19 04:46:15,642 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:46:15,642 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:46:15,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-19 04:46:15,643 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-19 04:46:15,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:46:15,643 INFO L85 PathProgramCache]: Analyzing trace with hash 643745775, now seen corresponding path program 1 times [2023-11-19 04:46:15,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:46:15,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185709642] [2023-11-19 04:46:15,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:46:15,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:46:15,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:46:15,750 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-19 04:46:15,750 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:46:15,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185709642] [2023-11-19 04:46:15,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185709642] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:46:15,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:46:15,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:46:15,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584496996] [2023-11-19 04:46:15,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:46:15,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:46:15,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:46:15,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:46:15,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:46:15,752 INFO L87 Difference]: Start difference. First operand 747 states and 1121 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 04:46:16,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:46:16,059 INFO L93 Difference]: Finished difference Result 745 states and 1119 transitions. [2023-11-19 04:46:16,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 04:46:16,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2023-11-19 04:46:16,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:46:16,065 INFO L225 Difference]: With dead ends: 745 [2023-11-19 04:46:16,066 INFO L226 Difference]: Without dead ends: 745 [2023-11-19 04:46:16,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:46:16,066 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 33 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 04:46:16,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 623 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 04:46:16,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2023-11-19 04:46:16,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 745. [2023-11-19 04:46:16,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 496 states have (on average 1.4858870967741935) internal successors, (737), 601 states have internal predecessors, (737), 69 states have call successors, (69), 42 states have call predecessors, (69), 76 states have return successors, (313), 101 states have call predecessors, (313), 69 states have call successors, (313) [2023-11-19 04:46:16,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1119 transitions. [2023-11-19 04:46:16,102 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1119 transitions. Word has length 51 [2023-11-19 04:46:16,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:46:16,103 INFO L495 AbstractCegarLoop]: Abstraction has 745 states and 1119 transitions. [2023-11-19 04:46:16,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 04:46:16,103 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1119 transitions. [2023-11-19 04:46:16,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-19 04:46:16,104 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:46:16,104 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:46:16,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-19 04:46:16,104 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-19 04:46:16,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:46:16,105 INFO L85 PathProgramCache]: Analyzing trace with hash 643745776, now seen corresponding path program 1 times [2023-11-19 04:46:16,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:46:16,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533411472] [2023-11-19 04:46:16,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:46:16,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:46:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:46:17,422 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 04:46:17,422 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:46:17,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533411472] [2023-11-19 04:46:17,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533411472] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:46:17,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64336359] [2023-11-19 04:46:17,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:46:17,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:46:17,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d54b671-ba6a-46a3-a539-aafdae71d4b1/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:46:17,428 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d54b671-ba6a-46a3-a539-aafdae71d4b1/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:46:17,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d54b671-ba6a-46a3-a539-aafdae71d4b1/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 04:46:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:46:17,734 INFO L262 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 72 conjunts are in the unsatisfiable core [2023-11-19 04:46:17,748 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:46:17,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-19 04:46:17,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-11-19 04:46:17,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2023-11-19 04:46:17,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-11-19 04:46:17,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2023-11-19 04:46:17,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-11-19 04:46:18,083 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-19 04:46:18,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 58 [2023-11-19 04:46:18,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2023-11-19 04:46:18,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 28 [2023-11-19 04:46:18,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-11-19 04:46:18,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 28 [2023-11-19 04:46:18,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-11-19 04:46:18,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 28 [2023-11-19 04:46:18,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-11-19 04:46:18,281 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-19 04:46:18,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-19 04:46:18,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2023-11-19 04:46:18,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-11-19 04:46:18,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2023-11-19 04:46:18,680 INFO L378 Elim1Store]: Elim1 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 11 treesize of output 9 [2023-11-19 04:46:18,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2023-11-19 04:46:18,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-11-19 04:46:18,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2023-11-19 04:46:18,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2023-11-19 04:46:18,904 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:46:18,904 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 04:46:18,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64336359] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:46:18,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-19 04:46:18,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [16] total 31 [2023-11-19 04:46:18,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963989431] [2023-11-19 04:46:18,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:46:18,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-19 04:46:18,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:46:18,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-19 04:46:18,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=807, Unknown=0, NotChecked=0, Total=930 [2023-11-19 04:46:18,908 INFO L87 Difference]: Start difference. First operand 745 states and 1119 transitions. Second operand has 18 states, 16 states have (on average 2.5) internal successors, (40), 13 states have internal predecessors, (40), 5 states have call successors, (8), 6 states have call predecessors, (8), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 04:46:21,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:46:21,428 INFO L93 Difference]: Finished difference Result 779 states and 1216 transitions. [2023-11-19 04:46:21,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-19 04:46:21,428 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.5) internal successors, (40), 13 states have internal predecessors, (40), 5 states have call successors, (8), 6 states have call predecessors, (8), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 51 [2023-11-19 04:46:21,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:46:21,438 INFO L225 Difference]: With dead ends: 779 [2023-11-19 04:46:21,438 INFO L226 Difference]: Without dead ends: 779 [2023-11-19 04:46:21,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=298, Invalid=1508, Unknown=0, NotChecked=0, Total=1806 [2023-11-19 04:46:21,439 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 355 mSDsluCounter, 2355 mSDsCounter, 0 mSdLazyCounter, 2185 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 2595 SdHoareTripleChecker+Invalid, 2257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-19 04:46:21,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 2595 Invalid, 2257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 2185 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-11-19 04:46:21,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2023-11-19 04:46:21,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 746. [2023-11-19 04:46:21,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 497 states have (on average 1.4849094567404426) internal successors, (738), 602 states have internal predecessors, (738), 69 states have call successors, (69), 42 states have call predecessors, (69), 76 states have return successors, (313), 101 states have call predecessors, (313), 69 states have call successors, (313) [2023-11-19 04:46:21,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1120 transitions. [2023-11-19 04:46:21,484 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1120 transitions. Word has length 51 [2023-11-19 04:46:21,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:46:21,484 INFO L495 AbstractCegarLoop]: Abstraction has 746 states and 1120 transitions. [2023-11-19 04:46:21,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.5) internal successors, (40), 13 states have internal predecessors, (40), 5 states have call successors, (8), 6 states have call predecessors, (8), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 04:46:21,485 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1120 transitions. [2023-11-19 04:46:21,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-19 04:46:21,490 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:46:21,490 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:46:21,522 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d54b671-ba6a-46a3-a539-aafdae71d4b1/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 04:46:21,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d54b671-ba6a-46a3-a539-aafdae71d4b1/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-11-19 04:46:21,704 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-19 04:46:21,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:46:21,705 INFO L85 PathProgramCache]: Analyzing trace with hash 724835472, now seen corresponding path program 1 times [2023-11-19 04:46:21,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:46:21,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796787359] [2023-11-19 04:46:21,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:46:21,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:46:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:46:22,088 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 04:46:22,089 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:46:22,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796787359] [2023-11-19 04:46:22,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796787359] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:46:22,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:46:22,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 04:46:22,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271567593] [2023-11-19 04:46:22,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:46:22,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 04:46:22,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:46:22,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 04:46:22,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-19 04:46:22,092 INFO L87 Difference]: Start difference. First operand 746 states and 1120 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 04:46:22,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:46:22,575 INFO L93 Difference]: Finished difference Result 804 states and 1248 transitions. [2023-11-19 04:46:22,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 04:46:22,576 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2023-11-19 04:46:22,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:46:22,583 INFO L225 Difference]: With dead ends: 804 [2023-11-19 04:46:22,583 INFO L226 Difference]: Without dead ends: 804 [2023-11-19 04:46:22,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-11-19 04:46:22,584 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 43 mSDsluCounter, 1501 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1794 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 04:46:22,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 1794 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 04:46:22,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2023-11-19 04:46:22,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 785. [2023-11-19 04:46:22,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 529 states have (on average 1.4820415879017013) internal successors, (784), 634 states have internal predecessors, (784), 72 states have call successors, (72), 47 states have call predecessors, (72), 80 states have return successors, (332), 103 states have call predecessors, (332), 72 states have call successors, (332) [2023-11-19 04:46:22,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1188 transitions. [2023-11-19 04:46:22,622 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1188 transitions. Word has length 51 [2023-11-19 04:46:22,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:46:22,623 INFO L495 AbstractCegarLoop]: Abstraction has 785 states and 1188 transitions. [2023-11-19 04:46:22,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 04:46:22,639 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1188 transitions. [2023-11-19 04:46:22,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-19 04:46:22,640 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:46:22,640 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:46:22,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-19 04:46:22,641 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ASIdleErr12ASSERT_VIOLATIONMEMORY_LEAK === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-19 04:46:22,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:46:22,641 INFO L85 PathProgramCache]: Analyzing trace with hash -514926275, now seen corresponding path program 1 times [2023-11-19 04:46:22,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:46:22,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317546181] [2023-11-19 04:46:22,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:46:22,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:46:22,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:46:22,995 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:46:22,996 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:46:22,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317546181] [2023-11-19 04:46:22,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317546181] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:46:22,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:46:22,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-19 04:46:22,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718812184] [2023-11-19 04:46:22,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:46:22,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-19 04:46:22,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:46:22,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-19 04:46:22,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-19 04:46:23,001 INFO L87 Difference]: Start difference. First operand 785 states and 1188 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 04:46:23,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:46:23,494 INFO L93 Difference]: Finished difference Result 829 states and 1263 transitions. [2023-11-19 04:46:23,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-19 04:46:23,495 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2023-11-19 04:46:23,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:46:23,502 INFO L225 Difference]: With dead ends: 829 [2023-11-19 04:46:23,503 INFO L226 Difference]: Without dead ends: 829 [2023-11-19 04:46:23,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-11-19 04:46:23,504 INFO L413 NwaCegarLoop]: 291 mSDtfsCounter, 46 mSDsluCounter, 1792 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 2083 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 04:46:23,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 2083 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 04:46:23,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2023-11-19 04:46:23,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 814. [2023-11-19 04:46:23,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 548 states have (on average 1.467153284671533) internal successors, (804), 654 states have internal predecessors, (804), 76 states have call successors, (76), 48 states have call predecessors, (76), 86 states have return successors, (356), 111 states have call predecessors, (356), 76 states have call successors, (356) [2023-11-19 04:46:23,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1236 transitions. [2023-11-19 04:46:23,542 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1236 transitions. Word has length 50 [2023-11-19 04:46:23,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:46:23,543 INFO L495 AbstractCegarLoop]: Abstraction has 814 states and 1236 transitions. [2023-11-19 04:46:23,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 04:46:23,543 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1236 transitions. [2023-11-19 04:46:23,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-19 04:46:23,544 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:46:23,544 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:46:23,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-19 04:46:23,545 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ASStopErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-19 04:46:23,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:46:23,545 INFO L85 PathProgramCache]: Analyzing trace with hash 2114069806, now seen corresponding path program 1 times [2023-11-19 04:46:23,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:46:23,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589736557] [2023-11-19 04:46:23,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:46:23,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:46:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:46:23,666 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 04:46:23,667 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:46:23,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589736557] [2023-11-19 04:46:23,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589736557] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:46:23,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:46:23,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:46:23,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781231094] [2023-11-19 04:46:23,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:46:23,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:46:23,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:46:23,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:46:23,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:46:23,669 INFO L87 Difference]: Start difference. First operand 814 states and 1236 transitions. Second operand has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 04:46:24,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:46:24,115 INFO L93 Difference]: Finished difference Result 841 states and 1296 transitions. [2023-11-19 04:46:24,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 04:46:24,116 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2023-11-19 04:46:24,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:46:24,123 INFO L225 Difference]: With dead ends: 841 [2023-11-19 04:46:24,123 INFO L226 Difference]: Without dead ends: 841 [2023-11-19 04:46:24,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:46:24,124 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 313 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 04:46:24,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 359 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 04:46:24,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2023-11-19 04:46:24,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 813. [2023-11-19 04:46:24,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 548 states have (on average 1.4598540145985401) internal successors, (800), 653 states have internal predecessors, (800), 76 states have call successors, (76), 48 states have call predecessors, (76), 86 states have return successors, (356), 111 states have call predecessors, (356), 76 states have call successors, (356) [2023-11-19 04:46:24,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1232 transitions. [2023-11-19 04:46:24,164 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1232 transitions. Word has length 50 [2023-11-19 04:46:24,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:46:24,164 INFO L495 AbstractCegarLoop]: Abstraction has 813 states and 1232 transitions. [2023-11-19 04:46:24,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 04:46:24,164 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1232 transitions. [2023-11-19 04:46:24,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-19 04:46:24,165 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:46:24,165 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:46:24,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-19 04:46:24,166 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ASStartErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-19 04:46:24,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:46:24,167 INFO L85 PathProgramCache]: Analyzing trace with hash -827523551, now seen corresponding path program 1 times [2023-11-19 04:46:24,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:46:24,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41959038] [2023-11-19 04:46:24,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:46:24,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:46:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:46:24,273 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-19 04:46:24,273 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:46:24,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41959038] [2023-11-19 04:46:24,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41959038] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:46:24,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:46:24,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:46:24,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217891077] [2023-11-19 04:46:24,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:46:24,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:46:24,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:46:24,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:46:24,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:46:24,276 INFO L87 Difference]: Start difference. First operand 813 states and 1232 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 04:46:24,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:46:24,568 INFO L93 Difference]: Finished difference Result 811 states and 1230 transitions. [2023-11-19 04:46:24,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 04:46:24,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 52 [2023-11-19 04:46:24,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:46:24,577 INFO L225 Difference]: With dead ends: 811 [2023-11-19 04:46:24,577 INFO L226 Difference]: Without dead ends: 811 [2023-11-19 04:46:24,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:46:24,579 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 33 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 04:46:24,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 620 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 04:46:24,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2023-11-19 04:46:24,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 811. [2023-11-19 04:46:24,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 548 states have (on average 1.4562043795620438) internal successors, (798), 651 states have internal predecessors, (798), 76 states have call successors, (76), 48 states have call predecessors, (76), 86 states have return successors, (356), 111 states have call predecessors, (356), 76 states have call successors, (356) [2023-11-19 04:46:24,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1230 transitions. [2023-11-19 04:46:24,622 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1230 transitions. Word has length 52 [2023-11-19 04:46:24,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:46:24,623 INFO L495 AbstractCegarLoop]: Abstraction has 811 states and 1230 transitions. [2023-11-19 04:46:24,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 04:46:24,623 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1230 transitions. [2023-11-19 04:46:24,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-19 04:46:24,624 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:46:24,624 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:46:24,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-11-19 04:46:24,625 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ASStartErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-19 04:46:24,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:46:24,625 INFO L85 PathProgramCache]: Analyzing trace with hash -827523550, now seen corresponding path program 1 times [2023-11-19 04:46:24,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:46:24,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997738624] [2023-11-19 04:46:24,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:46:24,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:46:24,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 04:46:24,676 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 04:46:24,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 04:46:24,755 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-19 04:46:24,755 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 04:46:24,756 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ASStartErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (161 of 162 remaining) [2023-11-19 04:46:24,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (160 of 162 remaining) [2023-11-19 04:46:24,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (159 of 162 remaining) [2023-11-19 04:46:24,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (158 of 162 remaining) [2023-11-19 04:46:24,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (157 of 162 remaining) [2023-11-19 04:46:24,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (156 of 162 remaining) [2023-11-19 04:46:24,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (155 of 162 remaining) [2023-11-19 04:46:24,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (154 of 162 remaining) [2023-11-19 04:46:24,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (153 of 162 remaining) [2023-11-19 04:46:24,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (152 of 162 remaining) [2023-11-19 04:46:24,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (151 of 162 remaining) [2023-11-19 04:46:24,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (150 of 162 remaining) [2023-11-19 04:46:24,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (149 of 162 remaining) [2023-11-19 04:46:24,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (148 of 162 remaining) [2023-11-19 04:46:24,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (147 of 162 remaining) [2023-11-19 04:46:24,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (146 of 162 remaining) [2023-11-19 04:46:24,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (145 of 162 remaining) [2023-11-19 04:46:24,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (144 of 162 remaining) [2023-11-19 04:46:24,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (143 of 162 remaining) [2023-11-19 04:46:24,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (142 of 162 remaining) [2023-11-19 04:46:24,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (141 of 162 remaining) [2023-11-19 04:46:24,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (140 of 162 remaining) [2023-11-19 04:46:24,764 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (139 of 162 remaining) [2023-11-19 04:46:24,764 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (138 of 162 remaining) [2023-11-19 04:46:24,764 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (137 of 162 remaining) [2023-11-19 04:46:24,764 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (136 of 162 remaining) [2023-11-19 04:46:24,764 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (135 of 162 remaining) [2023-11-19 04:46:24,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (134 of 162 remaining) [2023-11-19 04:46:24,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (133 of 162 remaining) [2023-11-19 04:46:24,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (132 of 162 remaining) [2023-11-19 04:46:24,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (131 of 162 remaining) [2023-11-19 04:46:24,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (130 of 162 remaining) [2023-11-19 04:46:24,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (129 of 162 remaining) [2023-11-19 04:46:24,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (128 of 162 remaining) [2023-11-19 04:46:24,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (127 of 162 remaining) [2023-11-19 04:46:24,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (126 of 162 remaining) [2023-11-19 04:46:24,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (125 of 162 remaining) [2023-11-19 04:46:24,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (124 of 162 remaining) [2023-11-19 04:46:24,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (123 of 162 remaining) [2023-11-19 04:46:24,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (122 of 162 remaining) [2023-11-19 04:46:24,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (121 of 162 remaining) [2023-11-19 04:46:24,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (120 of 162 remaining) [2023-11-19 04:46:24,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (119 of 162 remaining) [2023-11-19 04:46:24,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (118 of 162 remaining) [2023-11-19 04:46:24,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (117 of 162 remaining) [2023-11-19 04:46:24,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (116 of 162 remaining) [2023-11-19 04:46:24,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (115 of 162 remaining) [2023-11-19 04:46:24,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (114 of 162 remaining) [2023-11-19 04:46:24,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (113 of 162 remaining) [2023-11-19 04:46:24,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (112 of 162 remaining) [2023-11-19 04:46:24,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (111 of 162 remaining) [2023-11-19 04:46:24,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (110 of 162 remaining) [2023-11-19 04:46:24,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (109 of 162 remaining) [2023-11-19 04:46:24,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (108 of 162 remaining) [2023-11-19 04:46:24,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (107 of 162 remaining) [2023-11-19 04:46:24,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 162 remaining) [2023-11-19 04:46:24,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 162 remaining) [2023-11-19 04:46:24,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 162 remaining) [2023-11-19 04:46:24,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 162 remaining) [2023-11-19 04:46:24,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 162 remaining) [2023-11-19 04:46:24,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 162 remaining) [2023-11-19 04:46:24,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 162 remaining) [2023-11-19 04:46:24,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 162 remaining) [2023-11-19 04:46:24,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 162 remaining) [2023-11-19 04:46:24,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 162 remaining) [2023-11-19 04:46:24,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 162 remaining) [2023-11-19 04:46:24,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 162 remaining) [2023-11-19 04:46:24,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 162 remaining) [2023-11-19 04:46:24,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 162 remaining) [2023-11-19 04:46:24,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 162 remaining) [2023-11-19 04:46:24,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 162 remaining) [2023-11-19 04:46:24,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 162 remaining) [2023-11-19 04:46:24,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 162 remaining) [2023-11-19 04:46:24,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 162 remaining) [2023-11-19 04:46:24,774 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 162 remaining) [2023-11-19 04:46:24,774 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 162 remaining) [2023-11-19 04:46:24,774 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 162 remaining) [2023-11-19 04:46:24,774 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 162 remaining) [2023-11-19 04:46:24,774 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 162 remaining) [2023-11-19 04:46:24,775 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 162 remaining) [2023-11-19 04:46:24,775 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 162 remaining) [2023-11-19 04:46:24,775 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 162 remaining) [2023-11-19 04:46:24,775 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 162 remaining) [2023-11-19 04:46:24,775 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 162 remaining) [2023-11-19 04:46:24,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 162 remaining) [2023-11-19 04:46:24,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 162 remaining) [2023-11-19 04:46:24,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 162 remaining) [2023-11-19 04:46:24,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 162 remaining) [2023-11-19 04:46:24,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 162 remaining) [2023-11-19 04:46:24,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 162 remaining) [2023-11-19 04:46:24,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 162 remaining) [2023-11-19 04:46:24,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 162 remaining) [2023-11-19 04:46:24,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 162 remaining) [2023-11-19 04:46:24,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 162 remaining) [2023-11-19 04:46:24,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 162 remaining) [2023-11-19 04:46:24,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 162 remaining) [2023-11-19 04:46:24,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 162 remaining) [2023-11-19 04:46:24,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 162 remaining) [2023-11-19 04:46:24,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 162 remaining) [2023-11-19 04:46:24,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 162 remaining) [2023-11-19 04:46:24,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 162 remaining) [2023-11-19 04:46:24,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 162 remaining) [2023-11-19 04:46:24,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 162 remaining) [2023-11-19 04:46:24,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 162 remaining) [2023-11-19 04:46:24,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 162 remaining) [2023-11-19 04:46:24,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 162 remaining) [2023-11-19 04:46:24,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 162 remaining) [2023-11-19 04:46:24,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 162 remaining) [2023-11-19 04:46:24,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 162 remaining) [2023-11-19 04:46:24,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 162 remaining) [2023-11-19 04:46:24,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 162 remaining) [2023-11-19 04:46:24,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 162 remaining) [2023-11-19 04:46:24,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 162 remaining) [2023-11-19 04:46:24,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 162 remaining) [2023-11-19 04:46:24,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 162 remaining) [2023-11-19 04:46:24,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 162 remaining) [2023-11-19 04:46:24,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 162 remaining) [2023-11-19 04:46:24,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 162 remaining) [2023-11-19 04:46:24,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 162 remaining) [2023-11-19 04:46:24,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 162 remaining) [2023-11-19 04:46:24,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 162 remaining) [2023-11-19 04:46:24,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 162 remaining) [2023-11-19 04:46:24,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 162 remaining) [2023-11-19 04:46:24,784 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 162 remaining) [2023-11-19 04:46:24,785 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 162 remaining) [2023-11-19 04:46:24,785 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 162 remaining) [2023-11-19 04:46:24,785 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 162 remaining) [2023-11-19 04:46:24,785 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 162 remaining) [2023-11-19 04:46:24,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 162 remaining) [2023-11-19 04:46:24,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 162 remaining) [2023-11-19 04:46:24,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 162 remaining) [2023-11-19 04:46:24,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASNullErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 162 remaining) [2023-11-19 04:46:24,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 162 remaining) [2023-11-19 04:46:24,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 162 remaining) [2023-11-19 04:46:24,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 162 remaining) [2023-11-19 04:46:24,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 162 remaining) [2023-11-19 04:46:24,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 162 remaining) [2023-11-19 04:46:24,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 162 remaining) [2023-11-19 04:46:24,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 162 remaining) [2023-11-19 04:46:24,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 162 remaining) [2023-11-19 04:46:24,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 162 remaining) [2023-11-19 04:46:24,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 162 remaining) [2023-11-19 04:46:24,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 162 remaining) [2023-11-19 04:46:24,790 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 162 remaining) [2023-11-19 04:46:24,790 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr12ASSERT_VIOLATIONMEMORY_LEAK (17 of 162 remaining) [2023-11-19 04:46:24,790 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 162 remaining) [2023-11-19 04:46:24,790 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 162 remaining) [2023-11-19 04:46:24,790 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 162 remaining) [2023-11-19 04:46:24,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 162 remaining) [2023-11-19 04:46:24,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 162 remaining) [2023-11-19 04:46:24,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 162 remaining) [2023-11-19 04:46:24,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 162 remaining) [2023-11-19 04:46:24,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 162 remaining) [2023-11-19 04:46:24,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 162 remaining) [2023-11-19 04:46:24,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 162 remaining) [2023-11-19 04:46:24,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 162 remaining) [2023-11-19 04:46:24,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 162 remaining) [2023-11-19 04:46:24,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 162 remaining) [2023-11-19 04:46:24,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 162 remaining) [2023-11-19 04:46:24,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 162 remaining) [2023-11-19 04:46:24,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 162 remaining) [2023-11-19 04:46:24,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (0 of 162 remaining) [2023-11-19 04:46:24,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-11-19 04:46:24,797 INFO L445 BasicCegarLoop]: Path program 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] [2023-11-19 04:46:24,803 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 04:46:24,844 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc78 [2023-11-19 04:46:24,845 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc78 [2023-11-19 04:46:24,845 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc78 [2023-11-19 04:46:24,846 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc78 [2023-11-19 04:46:24,846 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem79 [2023-11-19 04:46:24,846 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc78 [2023-11-19 04:46:24,847 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc78 [2023-11-19 04:46:24,851 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch73 could not be translated [2023-11-19 04:46:24,851 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem33 could not be translated [2023-11-19 04:46:24,852 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret39 could not be translated [2023-11-19 04:46:24,852 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem35 [2023-11-19 04:46:24,852 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem35 [2023-11-19 04:46:24,853 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem36 could not be translated [2023-11-19 04:46:24,859 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch73 could not be translated [2023-11-19 04:46:24,861 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch54 could not be translated [2023-11-19 04:46:24,861 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc59 [2023-11-19 04:46:24,862 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc59 [2023-11-19 04:46:24,862 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch54 could not be translated [2023-11-19 04:46:24,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 04:46:24 BoogieIcfgContainer [2023-11-19 04:46:24,885 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 04:46:24,885 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 04:46:24,886 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 04:46:24,886 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 04:46:24,886 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:45:48" (3/4) ... [2023-11-19 04:46:24,887 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-19 04:46:24,900 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc78 [2023-11-19 04:46:24,905 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc78 [2023-11-19 04:46:24,905 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc78 [2023-11-19 04:46:24,905 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc78 [2023-11-19 04:46:24,905 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem79 [2023-11-19 04:46:24,906 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc78 [2023-11-19 04:46:24,906 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc78 [2023-11-19 04:46:24,906 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch73 could not be translated [2023-11-19 04:46:24,907 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem33 could not be translated [2023-11-19 04:46:24,907 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret39 could not be translated [2023-11-19 04:46:24,907 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem35 [2023-11-19 04:46:24,908 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem35 [2023-11-19 04:46:24,908 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem36 could not be translated [2023-11-19 04:46:24,908 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch73 could not be translated [2023-11-19 04:46:24,909 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch54 could not be translated [2023-11-19 04:46:24,909 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc59 [2023-11-19 04:46:24,909 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch54 could not be translated [2023-11-19 04:46:24,909 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc59 [2023-11-19 04:46:24,943 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d54b671-ba6a-46a3-a539-aafdae71d4b1/bin/utaipan-verify-t7M7D8N6sZ/witness.graphml [2023-11-19 04:46:24,943 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 04:46:24,944 INFO L158 Benchmark]: Toolchain (without parser) took 39212.62ms. Allocated memory was 148.9MB in the beginning and 490.7MB in the end (delta: 341.8MB). Free memory was 102.5MB in the beginning and 321.0MB in the end (delta: -218.5MB). Peak memory consumption was 126.4MB. Max. memory is 16.1GB. [2023-11-19 04:46:24,944 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 117.4MB. Free memory is still 67.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 04:46:24,944 INFO L158 Benchmark]: CACSL2BoogieTranslator took 796.00ms. Allocated memory is still 148.9MB. Free memory was 102.5MB in the beginning and 76.7MB in the end (delta: 25.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-11-19 04:46:24,945 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.93ms. Allocated memory is still 148.9MB. Free memory was 76.7MB in the beginning and 73.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 04:46:24,945 INFO L158 Benchmark]: Boogie Preprocessor took 105.02ms. Allocated memory is still 148.9MB. Free memory was 73.6MB in the beginning and 70.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-19 04:46:24,945 INFO L158 Benchmark]: RCFGBuilder took 1331.62ms. Allocated memory is still 148.9MB. Free memory was 70.5MB in the beginning and 54.3MB in the end (delta: 16.2MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2023-11-19 04:46:24,946 INFO L158 Benchmark]: TraceAbstraction took 36821.54ms. Allocated memory was 148.9MB in the beginning and 490.7MB in the end (delta: 341.8MB). Free memory was 54.3MB in the beginning and 325.2MB in the end (delta: -270.9MB). Peak memory consumption was 71.5MB. Max. memory is 16.1GB. [2023-11-19 04:46:24,946 INFO L158 Benchmark]: Witness Printer took 57.71ms. Allocated memory is still 490.7MB. Free memory was 325.2MB in the beginning and 321.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-19 04:46:24,947 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36ms. Allocated memory is still 117.4MB. Free memory is still 67.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 796.00ms. Allocated memory is still 148.9MB. Free memory was 102.5MB in the beginning and 76.7MB in the end (delta: 25.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.93ms. Allocated memory is still 148.9MB. Free memory was 76.7MB in the beginning and 73.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 105.02ms. Allocated memory is still 148.9MB. Free memory was 73.6MB in the beginning and 70.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1331.62ms. Allocated memory is still 148.9MB. Free memory was 70.5MB in the beginning and 54.3MB in the end (delta: 16.2MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. * TraceAbstraction took 36821.54ms. Allocated memory was 148.9MB in the beginning and 490.7MB in the end (delta: 341.8MB). Free memory was 54.3MB in the beginning and 325.2MB in the end (delta: -270.9MB). Peak memory consumption was 71.5MB. Max. memory is 16.1GB. * Witness Printer took 57.71ms. Allocated memory is still 490.7MB. Free memory was 325.2MB in the beginning and 321.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~malloc78 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~malloc78 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~malloc78 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~malloc78 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem79 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~malloc78 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~malloc78 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch73 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem33 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret39 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem35 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem35 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem36 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch73 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch54 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~malloc59 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~malloc59 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch54 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~malloc78 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~malloc78 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~malloc78 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~malloc78 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem79 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~malloc78 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~malloc78 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch73 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem33 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret39 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem35 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem35 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem36 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch73 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch54 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~malloc59 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch54 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~malloc59 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L779] user_t *user; [L975] user = malloc(sizeof(user_t)) [L976] CALL user_initialize() [L966] EXPR, FCALL calloc(1, sizeof(info_t)) VAL [user={-1:0}] [L966] user->info = calloc(1, sizeof(info_t)) VAL [user={-1:0}] [L967] user->message.id = 11 VAL [user={-1:0}] [L968] EXPR user->info VAL [user={-1:0}] [L968] user->info->is_valid = 0 [L969] user->status = AS_NULL VAL [user={-1:0}] [L970] user->user_id = 11 VAL [user={-1:0}] [L971] user->timeout = 3 [L976] RET user_initialize() [L977] event_t e = {0}; VAL [\old(argc)=79, argc=79, argv={84:81}, argv={84:81}, e={10:0}, user={-1:0}] [L978] e.primitive = _EVENT_START VAL [\old(argc)=79, argc=79, argv={84:81}, argv={84:81}, e={10:0}, user={-1:0}] [L979] CALL event_precess(&e) VAL [e={10:0}, user={-1:0}] [L943] EXPR user->status [L943] sys_state_t status = user->status; [L944] int rc = -1; VAL [e={10:0}, e={10:0}, rc=-1, status=1, user={-1:0}] [L945] COND TRUE status < AS_STATE_MAX [L947] case AS_NULL: VAL [e={10:0}, e={10:0}, rc=-1, status=1, user={-1:0}] [L948] CALL ASNull(e) VAL [e={10:0}, user={-1:0}] [L838] EXPR e->primitive [L838] e_primitive_t primitive = e->primitive; [L839] COND TRUE primitive == _EVENT_START VAL [e={10:0}, e={10:0}, primitive=0, user={-1:0}] [L840] CALL status_update(AS_START) VAL [\old(status)=2, user={-1:0}] [L814] COND TRUE status < AS_STATE_MAX VAL [\old(status)=2, status=2, user={-1:0}] [L815] EXPR user->status VAL [\old(status)=2, status=2, user={-1:0}] [L815] COND TRUE user->status != status [L816] user->status = status [L817] return 10; VAL [\old(status)=2, \result=10, status=2, user={-1:0}] [L840] RET status_update(AS_START) VAL [e={10:0}, e={10:0}, primitive=0, user={-1:0}] [L841] CALL system_initialize() VAL [user={-1:0}] [L829] event_t e = {0}; VAL [e={9:0}, user={-1:0}] [L830] EXPR user->info VAL [e={9:0}, user={-1:0}] [L830] EXPR user->info->is_valid VAL [e={9:0}, user={-1:0}] [L830] COND TRUE !user->info->is_valid [L831] e.primitive = _EVENT_CLOSE VAL [e={9:0}, user={-1:0}] [L835] CALL event_precess(&e) VAL [e={9:0}, user={-1:0}] [L943] EXPR user->status [L943] sys_state_t status = user->status; [L944] int rc = -1; VAL [e={9:0}, e={9:0}, rc=-1, status=2, user={-1:0}] [L945] COND TRUE status < AS_STATE_MAX [L947] case AS_NULL: [L950] case AS_START: VAL [e={9:0}, e={9:0}, rc=-1, status=2, user={-1:0}] [L951] CALL ASStart(e) VAL [e={9:0}, user={-1:0}] [L881] EXPR e->primitive [L881] e_primitive_t primitive = e->primitive; [L882] int rc = -1; [L884] case _EVENT_OPEN: [L898] case _EVENT_CLOSE: [L899] message_t *message = &user->message; [L900] EXPR, FCALL calloc(0, sizeof(*message)) VAL [e={9:0}, e={9:0}, message={-1:16}, primitive=3, rc=-1, user={-1:0}] [L900] message = calloc(0, sizeof(*message)) VAL [e={9:0}, e={9:0}, message={-2:0}, primitive=3, rc=-1, user={-1:0}] [L901] message->id = 3 - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 686]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 973]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 358 locations, 162 error locations. Started 1 CEGAR loops. OverallTime: 36.6s, OverallIterations: 33, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 22.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4414 SdHoareTripleChecker+Valid, 19.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4386 mSDsluCounter, 33255 SdHoareTripleChecker+Invalid, 16.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24313 mSDsCounter, 723 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23438 IncrementalHoareTripleChecker+Invalid, 24161 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 723 mSolverCounterUnsat, 8942 mSDtfsCounter, 23438 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 365 GetRequests, 119 SyntacticMatches, 1 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=814occurred in iteration=30, InterpolantAutomatonStates: 248, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 32 MinimizatonAttempts, 657 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 10.8s InterpolantComputationTime, 1168 NumberOfCodeBlocks, 1168 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1083 ConstructedInterpolants, 19 QuantifiedInterpolants, 5302 SizeOfPredicates, 16 NumberOfNonLiveVariables, 468 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 33 InterpolantComputations, 32 PerfectInterpolantSequences, 75/76 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-19 04:46:25,006 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d54b671-ba6a-46a3-a539-aafdae71d4b1/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)