./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 2329fc70 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_ef60e33f-af2a-4c49-8954-dacd09833824/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef60e33f-af2a-4c49-8954-dacd09833824/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef60e33f-af2a-4c49-8954-dacd09833824/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef60e33f-af2a-4c49-8954-dacd09833824/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef60e33f-af2a-4c49-8954-dacd09833824/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef60e33f-af2a-4c49-8954-dacd09833824/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 74e63e86abbcab22438f70ee6d7d7ef12eaada509b0f0a56fb5cf815aaf53aab --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 17:22:10,965 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 17:22:10,967 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 17:22:10,985 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 17:22:10,985 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 17:22:10,986 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 17:22:10,987 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 17:22:10,989 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 17:22:10,990 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 17:22:10,991 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 17:22:10,992 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 17:22:10,993 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 17:22:10,993 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 17:22:10,994 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 17:22:10,995 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 17:22:10,996 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 17:22:10,997 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 17:22:10,998 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 17:22:10,999 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 17:22:11,001 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 17:22:11,002 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 17:22:11,003 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 17:22:11,004 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 17:22:11,005 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 17:22:11,008 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 17:22:11,008 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 17:22:11,008 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 17:22:11,009 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 17:22:11,010 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 17:22:11,011 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 17:22:11,011 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 17:22:11,012 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 17:22:11,012 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 17:22:11,013 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 17:22:11,014 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 17:22:11,014 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 17:22:11,015 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 17:22:11,015 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 17:22:11,015 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 17:22:11,016 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 17:22:11,016 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 17:22:11,017 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef60e33f-af2a-4c49-8954-dacd09833824/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 17:22:11,041 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 17:22:11,042 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 17:22:11,042 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 17:22:11,042 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 17:22:11,048 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 17:22:11,048 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 17:22:11,049 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 17:22:11,049 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 17:22:11,049 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 17:22:11,050 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 17:22:11,050 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 17:22:11,050 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 17:22:11,050 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 17:22:11,050 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 17:22:11,050 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 17:22:11,051 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 17:22:11,051 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 17:22:11,051 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 17:22:11,051 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 17:22:11,051 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 17:22:11,051 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 17:22:11,051 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 17:22:11,052 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 17:22:11,052 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 17:22:11,052 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 17:22:11,052 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:22:11,052 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 17:22:11,052 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 17:22:11,053 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 17:22:11,053 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 17:22:11,053 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 17:22:11,053 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 17:22:11,053 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 17:22:11,053 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 17:22:11,054 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_ef60e33f-af2a-4c49-8954-dacd09833824/bin/uautomizer-uyxdKDjOR8/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_ef60e33f-af2a-4c49-8954-dacd09833824/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> Automizer 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 [2022-12-13 17:22:11,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 17:22:11,240 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 17:22:11,242 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 17:22:11,243 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 17:22:11,244 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 17:22:11,245 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef60e33f-af2a-4c49-8954-dacd09833824/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i [2022-12-13 17:22:13,823 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 17:22:14,036 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 17:22:14,037 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef60e33f-af2a-4c49-8954-dacd09833824/sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i [2022-12-13 17:22:14,045 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef60e33f-af2a-4c49-8954-dacd09833824/bin/uautomizer-uyxdKDjOR8/data/fc6759512/5abc27b7f17141b8879b682d18672807/FLAG0888321a2 [2022-12-13 17:22:14,056 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef60e33f-af2a-4c49-8954-dacd09833824/bin/uautomizer-uyxdKDjOR8/data/fc6759512/5abc27b7f17141b8879b682d18672807 [2022-12-13 17:22:14,057 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 17:22:14,058 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 17:22:14,059 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 17:22:14,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 17:22:14,062 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 17:22:14,063 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:22:14" (1/1) ... [2022-12-13 17:22:14,064 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6495ac48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:22:14, skipping insertion in model container [2022-12-13 17:22:14,064 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:22:14" (1/1) ... [2022-12-13 17:22:14,069 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 17:22:14,095 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 17:22:14,361 WARN L623 FunctionHandler]: Unknown extern function strncpy [2022-12-13 17:22:14,363 WARN L623 FunctionHandler]: Unknown extern function strncpy [2022-12-13 17:22:14,364 WARN L623 FunctionHandler]: Unknown extern function strncpy [2022-12-13 17:22:14,372 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef60e33f-af2a-4c49-8954-dacd09833824/sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i[36399,36412] [2022-12-13 17:22:14,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:22:14,392 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 17:22:14,433 WARN L623 FunctionHandler]: Unknown extern function strncpy [2022-12-13 17:22:14,435 WARN L623 FunctionHandler]: Unknown extern function strncpy [2022-12-13 17:22:14,436 WARN L623 FunctionHandler]: Unknown extern function strncpy [2022-12-13 17:22:14,442 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef60e33f-af2a-4c49-8954-dacd09833824/sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i[36399,36412] [2022-12-13 17:22:14,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:22:14,482 INFO L208 MainTranslator]: Completed translation [2022-12-13 17:22:14,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:22:14 WrapperNode [2022-12-13 17:22:14,482 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 17:22:14,484 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 17:22:14,484 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 17:22:14,484 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 17:22:14,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:22:14" (1/1) ... [2022-12-13 17:22:14,511 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:22:14" (1/1) ... [2022-12-13 17:22:14,532 INFO L138 Inliner]: procedures = 184, calls = 149, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 224 [2022-12-13 17:22:14,532 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 17:22:14,533 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 17:22:14,533 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 17:22:14,534 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 17:22:14,542 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:22:14" (1/1) ... [2022-12-13 17:22:14,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:22:14" (1/1) ... [2022-12-13 17:22:14,550 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:22:14" (1/1) ... [2022-12-13 17:22:14,550 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:22:14" (1/1) ... [2022-12-13 17:22:14,571 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:22:14" (1/1) ... [2022-12-13 17:22:14,575 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:22:14" (1/1) ... [2022-12-13 17:22:14,579 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:22:14" (1/1) ... [2022-12-13 17:22:14,582 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:22:14" (1/1) ... [2022-12-13 17:22:14,587 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 17:22:14,588 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 17:22:14,588 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 17:22:14,588 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 17:22:14,589 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:22:14" (1/1) ... [2022-12-13 17:22:14,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:22:14,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef60e33f-af2a-4c49-8954-dacd09833824/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:22:14,615 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef60e33f-af2a-4c49-8954-dacd09833824/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 17:22:14,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef60e33f-af2a-4c49-8954-dacd09833824/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 17:22:14,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 17:22:14,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-12-13 17:22:14,650 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-12-13 17:22:14,650 INFO L130 BoogieDeclarations]: Found specification of procedure event_precess [2022-12-13 17:22:14,650 INFO L138 BoogieDeclarations]: Found implementation of procedure event_precess [2022-12-13 17:22:14,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 17:22:14,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 17:22:14,650 INFO L130 BoogieDeclarations]: Found specification of procedure ASNull [2022-12-13 17:22:14,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ASNull [2022-12-13 17:22:14,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 17:22:14,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 17:22:14,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 17:22:14,651 INFO L130 BoogieDeclarations]: Found specification of procedure ASStart [2022-12-13 17:22:14,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStart [2022-12-13 17:22:14,651 INFO L130 BoogieDeclarations]: Found specification of procedure status_update [2022-12-13 17:22:14,651 INFO L138 BoogieDeclarations]: Found implementation of procedure status_update [2022-12-13 17:22:14,651 INFO L130 BoogieDeclarations]: Found specification of procedure message_send [2022-12-13 17:22:14,651 INFO L138 BoogieDeclarations]: Found implementation of procedure message_send [2022-12-13 17:22:14,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 17:22:14,651 INFO L130 BoogieDeclarations]: Found specification of procedure ASIdle [2022-12-13 17:22:14,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ASIdle [2022-12-13 17:22:14,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 17:22:14,652 INFO L130 BoogieDeclarations]: Found specification of procedure system_initialize [2022-12-13 17:22:14,652 INFO L138 BoogieDeclarations]: Found implementation of procedure system_initialize [2022-12-13 17:22:14,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 17:22:14,652 INFO L130 BoogieDeclarations]: Found specification of procedure ASStop [2022-12-13 17:22:14,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStop [2022-12-13 17:22:14,652 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2022-12-13 17:22:14,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 17:22:14,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 17:22:14,790 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 17:22:14,792 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 17:22:15,389 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 17:22:15,398 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 17:22:15,398 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 17:22:15,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:22:15 BoogieIcfgContainer [2022-12-13 17:22:15,401 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 17:22:15,404 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 17:22:15,404 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 17:22:15,406 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 17:22:15,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 05:22:14" (1/3) ... [2022-12-13 17:22:15,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cbc6740 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:22:15, skipping insertion in model container [2022-12-13 17:22:15,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:22:14" (2/3) ... [2022-12-13 17:22:15,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cbc6740 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:22:15, skipping insertion in model container [2022-12-13 17:22:15,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:22:15" (3/3) ... [2022-12-13 17:22:15,409 INFO L112 eAbstractionObserver]: Analyzing ICFG system-with-recursion.i [2022-12-13 17:22:15,425 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 17:22:15,425 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 162 error locations. [2022-12-13 17:22:15,474 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 17:22:15,481 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=PETRI_NET, 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;@6b18ee11, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 17:22:15,481 INFO L358 AbstractCegarLoop]: Starting to check reachability of 162 error locations. [2022-12-13 17:22:15,486 INFO L276 IsEmpty]: Start isEmpty. Operand has 401 states, 200 states have (on average 1.95) internal successors, (390), 362 states have internal predecessors, (390), 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) [2022-12-13 17:22:15,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-13 17:22:15,491 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:22:15,491 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:22:15,492 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-12-13 17:22:15,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:22:15,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1250997951, now seen corresponding path program 1 times [2022-12-13 17:22:15,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:22:15,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188369268] [2022-12-13 17:22:15,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:22:15,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:22:15,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:15,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:22:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:15,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:22:15,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:22:15,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188369268] [2022-12-13 17:22:15,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188369268] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:22:15,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:22:15,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:22:15,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703545276] [2022-12-13 17:22:15,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:22:15,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:22:15,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:22:15,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:22:15,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:22:15,799 INFO L87 Difference]: Start difference. First operand has 401 states, 200 states have (on average 1.95) internal successors, (390), 362 states have internal predecessors, (390), 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 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 17:22:16,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:22:16,351 INFO L93 Difference]: Finished difference Result 466 states and 557 transitions. [2022-12-13 17:22:16,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:22:16,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 7 [2022-12-13 17:22:16,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:22:16,362 INFO L225 Difference]: With dead ends: 466 [2022-12-13 17:22:16,362 INFO L226 Difference]: Without dead ends: 464 [2022-12-13 17:22:16,363 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 [2022-12-13 17:22:16,365 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 577 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 17:22:16,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 426 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 17:22:16,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2022-12-13 17:22:16,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 395. [2022-12-13 17:22:16,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 213 states have (on average 1.8169014084507042) internal successors, (387), 351 states have internal predecessors, (387), 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) [2022-12-13 17:22:16,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 456 transitions. [2022-12-13 17:22:16,413 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 456 transitions. Word has length 7 [2022-12-13 17:22:16,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:22:16,413 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 456 transitions. [2022-12-13 17:22:16,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 17:22:16,414 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 456 transitions. [2022-12-13 17:22:16,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-13 17:22:16,414 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:22:16,414 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:22:16,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 17:22:16,415 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-12-13 17:22:16,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:22:16,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1250997952, now seen corresponding path program 1 times [2022-12-13 17:22:16,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:22:16,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545332850] [2022-12-13 17:22:16,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:22:16,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:22:16,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:16,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:22:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:16,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:22:16,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:22:16,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545332850] [2022-12-13 17:22:16,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545332850] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:22:16,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:22:16,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:22:16,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298701334] [2022-12-13 17:22:16,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:22:16,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:22:16,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:22:16,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:22:16,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:22:16,531 INFO L87 Difference]: Start difference. First operand 395 states and 456 transitions. Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 17:22:16,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:22:16,960 INFO L93 Difference]: Finished difference Result 432 states and 516 transitions. [2022-12-13 17:22:16,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 17:22:16,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 7 [2022-12-13 17:22:16,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:22:16,964 INFO L225 Difference]: With dead ends: 432 [2022-12-13 17:22:16,964 INFO L226 Difference]: Without dead ends: 432 [2022-12-13 17:22:16,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:22:16,965 INFO L413 NwaCegarLoop]: 372 mSDtfsCounter, 160 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 17:22:16,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 1017 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 17:22:16,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2022-12-13 17:22:16,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 392. [2022-12-13 17:22:16,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 215 states have (on average 1.7813953488372094) internal successors, (383), 347 states have internal predecessors, (383), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2022-12-13 17:22:16,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 452 transitions. [2022-12-13 17:22:16,980 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 452 transitions. Word has length 7 [2022-12-13 17:22:16,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:22:16,981 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 452 transitions. [2022-12-13 17:22:16,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 17:22:16,981 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 452 transitions. [2022-12-13 17:22:16,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-13 17:22:16,981 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:22:16,981 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:22:16,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 17:22:16,981 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-12-13 17:22:16,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:22:16,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1049181770, now seen corresponding path program 1 times [2022-12-13 17:22:16,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:22:16,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616127242] [2022-12-13 17:22:16,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:22:16,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:22:16,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:17,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:22:17,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:17,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:22:17,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:22:17,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616127242] [2022-12-13 17:22:17,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616127242] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:22:17,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:22:17,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 17:22:17,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465209738] [2022-12-13 17:22:17,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:22:17,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 17:22:17,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:22:17,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 17:22:17,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:22:17,122 INFO L87 Difference]: Start difference. First operand 392 states and 452 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 17:22:17,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:22:17,575 INFO L93 Difference]: Finished difference Result 431 states and 515 transitions. [2022-12-13 17:22:17,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 17:22:17,576 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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 10 [2022-12-13 17:22:17,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:22:17,579 INFO L225 Difference]: With dead ends: 431 [2022-12-13 17:22:17,580 INFO L226 Difference]: Without dead ends: 431 [2022-12-13 17:22:17,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-12-13 17:22:17,581 INFO L413 NwaCegarLoop]: 370 mSDtfsCounter, 164 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 17:22:17,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 1269 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 17:22:17,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2022-12-13 17:22:17,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 391. [2022-12-13 17:22:17,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 215 states have (on average 1.7767441860465116) internal successors, (382), 346 states have internal predecessors, (382), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2022-12-13 17:22:17,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 451 transitions. [2022-12-13 17:22:17,601 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 451 transitions. Word has length 10 [2022-12-13 17:22:17,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:22:17,601 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 451 transitions. [2022-12-13 17:22:17,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 17:22:17,601 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 451 transitions. [2022-12-13 17:22:17,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-13 17:22:17,601 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:22:17,602 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:22:17,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 17:22:17,602 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-12-13 17:22:17,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:22:17,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1049181771, now seen corresponding path program 1 times [2022-12-13 17:22:17,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:22:17,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405118701] [2022-12-13 17:22:17,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:22:17,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:22:17,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:17,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:22:17,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:17,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:22:17,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:22:17,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405118701] [2022-12-13 17:22:17,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405118701] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:22:17,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:22:17,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 17:22:17,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678510961] [2022-12-13 17:22:17,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:22:17,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 17:22:17,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:22:17,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 17:22:17,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:22:17,807 INFO L87 Difference]: Start difference. First operand 391 states and 451 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 17:22:18,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:22:18,270 INFO L93 Difference]: Finished difference Result 430 states and 514 transitions. [2022-12-13 17:22:18,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 17:22:18,271 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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 10 [2022-12-13 17:22:18,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:22:18,274 INFO L225 Difference]: With dead ends: 430 [2022-12-13 17:22:18,275 INFO L226 Difference]: Without dead ends: 430 [2022-12-13 17:22:18,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-12-13 17:22:18,276 INFO L413 NwaCegarLoop]: 372 mSDtfsCounter, 158 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 17:22:18,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1258 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 17:22:18,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2022-12-13 17:22:18,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 390. [2022-12-13 17:22:18,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 215 states have (on average 1.7720930232558139) internal successors, (381), 345 states have internal predecessors, (381), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2022-12-13 17:22:18,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 450 transitions. [2022-12-13 17:22:18,295 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 450 transitions. Word has length 10 [2022-12-13 17:22:18,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:22:18,295 INFO L495 AbstractCegarLoop]: Abstraction has 390 states and 450 transitions. [2022-12-13 17:22:18,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 17:22:18,295 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 450 transitions. [2022-12-13 17:22:18,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 17:22:18,296 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:22:18,296 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:22:18,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 17:22:18,296 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-12-13 17:22:18,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:22:18,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1322669809, now seen corresponding path program 1 times [2022-12-13 17:22:18,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:22:18,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337295780] [2022-12-13 17:22:18,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:22:18,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:22:18,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:18,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:22:18,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:18,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:22:18,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:22:18,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337295780] [2022-12-13 17:22:18,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337295780] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:22:18,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:22:18,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:22:18,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770359934] [2022-12-13 17:22:18,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:22:18,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:22:18,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:22:18,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:22:18,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:22:18,357 INFO L87 Difference]: Start difference. First operand 390 states and 450 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 17:22:18,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:22:18,612 INFO L93 Difference]: Finished difference Result 429 states and 513 transitions. [2022-12-13 17:22:18,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 17:22:18,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 16 [2022-12-13 17:22:18,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:22:18,615 INFO L225 Difference]: With dead ends: 429 [2022-12-13 17:22:18,615 INFO L226 Difference]: Without dead ends: 429 [2022-12-13 17:22:18,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:22:18,616 INFO L413 NwaCegarLoop]: 377 mSDtfsCounter, 150 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 17:22:18,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 805 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 17:22:18,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-12-13 17:22:18,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 389. [2022-12-13 17:22:18,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 215 states have (on average 1.7674418604651163) internal successors, (380), 344 states have internal predecessors, (380), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2022-12-13 17:22:18,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 449 transitions. [2022-12-13 17:22:18,630 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 449 transitions. Word has length 16 [2022-12-13 17:22:18,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:22:18,630 INFO L495 AbstractCegarLoop]: Abstraction has 389 states and 449 transitions. [2022-12-13 17:22:18,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 17:22:18,630 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 449 transitions. [2022-12-13 17:22:18,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 17:22:18,631 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:22:18,631 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:22:18,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 17:22:18,631 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-12-13 17:22:18,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:22:18,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1322669808, now seen corresponding path program 1 times [2022-12-13 17:22:18,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:22:18,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983047580] [2022-12-13 17:22:18,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:22:18,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:22:18,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:18,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:22:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:18,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:22:18,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:22:18,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983047580] [2022-12-13 17:22:18,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983047580] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:22:18,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:22:18,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:22:18,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842747368] [2022-12-13 17:22:18,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:22:18,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:22:18,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:22:18,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:22:18,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:22:18,724 INFO L87 Difference]: Start difference. First operand 389 states and 449 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 17:22:19,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:22:19,019 INFO L93 Difference]: Finished difference Result 428 states and 512 transitions. [2022-12-13 17:22:19,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 17:22:19,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 16 [2022-12-13 17:22:19,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:22:19,022 INFO L225 Difference]: With dead ends: 428 [2022-12-13 17:22:19,022 INFO L226 Difference]: Without dead ends: 428 [2022-12-13 17:22:19,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:22:19,023 INFO L413 NwaCegarLoop]: 377 mSDtfsCounter, 149 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 17:22:19,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 792 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 17:22:19,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-12-13 17:22:19,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 388. [2022-12-13 17:22:19,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 215 states have (on average 1.7627906976744185) internal successors, (379), 343 states have internal predecessors, (379), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2022-12-13 17:22:19,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 448 transitions. [2022-12-13 17:22:19,036 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 448 transitions. Word has length 16 [2022-12-13 17:22:19,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:22:19,036 INFO L495 AbstractCegarLoop]: Abstraction has 388 states and 448 transitions. [2022-12-13 17:22:19,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 17:22:19,037 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 448 transitions. [2022-12-13 17:22:19,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-13 17:22:19,037 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:22:19,037 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:22:19,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 17:22:19,037 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-12-13 17:22:19,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:22:19,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1625786511, now seen corresponding path program 1 times [2022-12-13 17:22:19,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:22:19,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286304869] [2022-12-13 17:22:19,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:22:19,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:22:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:19,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:22:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:19,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:22:19,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:22:19,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286304869] [2022-12-13 17:22:19,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286304869] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:22:19,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:22:19,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:22:19,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874734176] [2022-12-13 17:22:19,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:22:19,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 17:22:19,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:22:19,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 17:22:19,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:22:19,218 INFO L87 Difference]: Start difference. First operand 388 states and 448 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 17:22:19,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:22:19,705 INFO L93 Difference]: Finished difference Result 436 states and 525 transitions. [2022-12-13 17:22:19,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 17:22:19,706 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-12-13 17:22:19,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:22:19,709 INFO L225 Difference]: With dead ends: 436 [2022-12-13 17:22:19,709 INFO L226 Difference]: Without dead ends: 436 [2022-12-13 17:22:19,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-12-13 17:22:19,710 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 606 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 17:22:19,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 458 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 17:22:19,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2022-12-13 17:22:19,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 369. [2022-12-13 17:22:19,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 215 states have (on average 1.6651162790697673) internal successors, (358), 324 states have internal predecessors, (358), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2022-12-13 17:22:19,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 427 transitions. [2022-12-13 17:22:19,725 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 427 transitions. Word has length 19 [2022-12-13 17:22:19,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:22:19,726 INFO L495 AbstractCegarLoop]: Abstraction has 369 states and 427 transitions. [2022-12-13 17:22:19,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 17:22:19,726 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 427 transitions. [2022-12-13 17:22:19,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-13 17:22:19,727 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:22:19,727 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] [2022-12-13 17:22:19,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 17:22:19,728 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-12-13 17:22:19,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:22:19,728 INFO L85 PathProgramCache]: Analyzing trace with hash -373735986, now seen corresponding path program 1 times [2022-12-13 17:22:19,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:22:19,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396038838] [2022-12-13 17:22:19,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:22:19,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:22:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:19,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:22:19,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:19,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:22:19,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:22:19,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396038838] [2022-12-13 17:22:19,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396038838] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:22:19,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:22:19,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:22:19,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604751787] [2022-12-13 17:22:19,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:22:19,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 17:22:19,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:22:19,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 17:22:19,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:22:19,883 INFO L87 Difference]: Start difference. First operand 369 states and 427 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 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) [2022-12-13 17:22:20,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:22:20,440 INFO L93 Difference]: Finished difference Result 442 states and 542 transitions. [2022-12-13 17:22:20,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 17:22:20,441 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 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 25 [2022-12-13 17:22:20,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:22:20,444 INFO L225 Difference]: With dead ends: 442 [2022-12-13 17:22:20,444 INFO L226 Difference]: Without dead ends: 442 [2022-12-13 17:22:20,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-12-13 17:22:20,445 INFO L413 NwaCegarLoop]: 355 mSDtfsCounter, 227 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 1617 SdHoareTripleChecker+Invalid, 1080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 17:22:20,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 1617 Invalid, 1080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 17:22:20,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2022-12-13 17:22:20,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 392. [2022-12-13 17:22:20,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 234 states have (on average 1.6452991452991452) internal successors, (385), 344 states have internal predecessors, (385), 33 states have call successors, (33), 14 states have call predecessors, (33), 15 states have return successors, (41), 33 states have call predecessors, (41), 33 states have call successors, (41) [2022-12-13 17:22:20,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 459 transitions. [2022-12-13 17:22:20,459 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 459 transitions. Word has length 25 [2022-12-13 17:22:20,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:22:20,460 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 459 transitions. [2022-12-13 17:22:20,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 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) [2022-12-13 17:22:20,460 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 459 transitions. [2022-12-13 17:22:20,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-13 17:22:20,461 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:22:20,461 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] [2022-12-13 17:22:20,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 17:22:20,461 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ASNullErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-12-13 17:22:20,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:22:20,461 INFO L85 PathProgramCache]: Analyzing trace with hash -373735985, now seen corresponding path program 1 times [2022-12-13 17:22:20,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:22:20,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762511398] [2022-12-13 17:22:20,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:22:20,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:22:20,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:20,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:22:20,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:20,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:22:20,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:22:20,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762511398] [2022-12-13 17:22:20,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762511398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:22:20,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:22:20,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:22:20,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933244436] [2022-12-13 17:22:20,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:22:20,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 17:22:20,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:22:20,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 17:22:20,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:22:20,655 INFO L87 Difference]: Start difference. First operand 392 states and 459 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 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) [2022-12-13 17:22:21,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:22:21,290 INFO L93 Difference]: Finished difference Result 441 states and 541 transitions. [2022-12-13 17:22:21,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 17:22:21,290 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 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 25 [2022-12-13 17:22:21,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:22:21,292 INFO L225 Difference]: With dead ends: 441 [2022-12-13 17:22:21,292 INFO L226 Difference]: Without dead ends: 441 [2022-12-13 17:22:21,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-12-13 17:22:21,293 INFO L413 NwaCegarLoop]: 356 mSDtfsCounter, 218 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 1657 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 17:22:21,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 1657 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 985 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 17:22:21,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2022-12-13 17:22:21,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 392. [2022-12-13 17:22:21,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 234 states have (on average 1.641025641025641) internal successors, (384), 344 states have internal predecessors, (384), 33 states have call successors, (33), 14 states have call predecessors, (33), 15 states have return successors, (41), 33 states have call predecessors, (41), 33 states have call successors, (41) [2022-12-13 17:22:21,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 458 transitions. [2022-12-13 17:22:21,300 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 458 transitions. Word has length 25 [2022-12-13 17:22:21,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:22:21,301 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 458 transitions. [2022-12-13 17:22:21,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 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) [2022-12-13 17:22:21,301 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 458 transitions. [2022-12-13 17:22:21,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-13 17:22:21,302 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:22:21,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] [2022-12-13 17:22:21,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 17:22:21,302 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-12-13 17:22:21,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:22:21,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1288018163, now seen corresponding path program 1 times [2022-12-13 17:22:21,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:22:21,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468074350] [2022-12-13 17:22:21,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:22:21,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:22:21,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:21,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:22:21,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:21,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:22:21,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:22:21,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468074350] [2022-12-13 17:22:21,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468074350] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:22:21,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:22:21,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:22:21,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177309886] [2022-12-13 17:22:21,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:22:21,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 17:22:21,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:22:21,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 17:22:21,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:22:21,449 INFO L87 Difference]: Start difference. First operand 392 states and 458 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 5 states have internal predecessors, (22), 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) [2022-12-13 17:22:22,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:22:22,030 INFO L93 Difference]: Finished difference Result 525 states and 653 transitions. [2022-12-13 17:22:22,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 17:22:22,030 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 5 states have internal predecessors, (22), 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 26 [2022-12-13 17:22:22,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:22:22,034 INFO L225 Difference]: With dead ends: 525 [2022-12-13 17:22:22,034 INFO L226 Difference]: Without dead ends: 525 [2022-12-13 17:22:22,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-12-13 17:22:22,035 INFO L413 NwaCegarLoop]: 333 mSDtfsCounter, 368 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 1542 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 17:22:22,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 1542 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1084 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 17:22:22,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2022-12-13 17:22:22,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 429. [2022-12-13 17:22:22,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 262 states have (on average 1.6145038167938932) internal successors, (423), 377 states have internal predecessors, (423), 38 states have call successors, (38), 17 states have call predecessors, (38), 19 states have return successors, (57), 34 states have call predecessors, (57), 38 states have call successors, (57) [2022-12-13 17:22:22,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 518 transitions. [2022-12-13 17:22:22,054 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 518 transitions. Word has length 26 [2022-12-13 17:22:22,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:22:22,054 INFO L495 AbstractCegarLoop]: Abstraction has 429 states and 518 transitions. [2022-12-13 17:22:22,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 5 states have internal predecessors, (22), 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) [2022-12-13 17:22:22,054 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 518 transitions. [2022-12-13 17:22:22,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-13 17:22:22,055 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:22:22,055 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:22:22,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 17:22:22,056 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-12-13 17:22:22,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:22:22,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1288018164, now seen corresponding path program 1 times [2022-12-13 17:22:22,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:22:22,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938757623] [2022-12-13 17:22:22,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:22:22,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:22:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:22,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:22:22,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:22,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:22:22,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:22:22,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938757623] [2022-12-13 17:22:22,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938757623] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:22:22,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:22:22,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:22:22,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530322554] [2022-12-13 17:22:22,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:22:22,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 17:22:22,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:22:22,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 17:22:22,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:22:22,260 INFO L87 Difference]: Start difference. First operand 429 states and 518 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 5 states have internal predecessors, (22), 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) [2022-12-13 17:22:22,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:22:22,888 INFO L93 Difference]: Finished difference Result 484 states and 608 transitions. [2022-12-13 17:22:22,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 17:22:22,889 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 5 states have internal predecessors, (22), 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 26 [2022-12-13 17:22:22,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:22:22,892 INFO L225 Difference]: With dead ends: 484 [2022-12-13 17:22:22,892 INFO L226 Difference]: Without dead ends: 484 [2022-12-13 17:22:22,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-12-13 17:22:22,893 INFO L413 NwaCegarLoop]: 352 mSDtfsCounter, 220 mSDsluCounter, 1303 mSDsCounter, 0 mSdLazyCounter, 972 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 17:22:22,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 1655 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 972 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 17:22:22,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2022-12-13 17:22:22,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 436. [2022-12-13 17:22:22,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 268 states have (on average 1.6119402985074627) internal successors, (432), 382 states have internal predecessors, (432), 39 states have call successors, (39), 18 states have call predecessors, (39), 19 states have return successors, (54), 35 states have call predecessors, (54), 39 states have call successors, (54) [2022-12-13 17:22:22,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 525 transitions. [2022-12-13 17:22:22,909 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 525 transitions. Word has length 26 [2022-12-13 17:22:22,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:22:22,909 INFO L495 AbstractCegarLoop]: Abstraction has 436 states and 525 transitions. [2022-12-13 17:22:22,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 5 states have internal predecessors, (22), 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) [2022-12-13 17:22:22,909 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 525 transitions. [2022-12-13 17:22:22,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-13 17:22:22,910 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:22:22,910 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] [2022-12-13 17:22:22,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 17:22:22,910 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ASIdleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-12-13 17:22:22,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:22:22,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1263299980, now seen corresponding path program 1 times [2022-12-13 17:22:22,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:22:22,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847500553] [2022-12-13 17:22:22,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:22:22,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:22:22,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:23,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:22:23,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:23,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:22:23,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:22:23,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847500553] [2022-12-13 17:22:23,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847500553] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:22:23,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:22:23,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:22:23,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522481081] [2022-12-13 17:22:23,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:22:23,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 17:22:23,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:22:23,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 17:22:23,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:22:23,134 INFO L87 Difference]: Start difference. First operand 436 states and 525 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 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) [2022-12-13 17:22:23,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:22:23,761 INFO L93 Difference]: Finished difference Result 522 states and 665 transitions. [2022-12-13 17:22:23,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 17:22:23,762 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 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 27 [2022-12-13 17:22:23,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:22:23,766 INFO L225 Difference]: With dead ends: 522 [2022-12-13 17:22:23,766 INFO L226 Difference]: Without dead ends: 522 [2022-12-13 17:22:23,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-12-13 17:22:23,767 INFO L413 NwaCegarLoop]: 352 mSDtfsCounter, 245 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 1651 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 17:22:23,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 1651 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 17:22:23,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2022-12-13 17:22:23,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 472. [2022-12-13 17:22:23,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 297 states have (on average 1.5892255892255893) internal successors, (472), 413 states have internal predecessors, (472), 42 states have call successors, (42), 20 states have call predecessors, (42), 23 states have return successors, (62), 38 states have call predecessors, (62), 42 states have call successors, (62) [2022-12-13 17:22:23,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 576 transitions. [2022-12-13 17:22:23,781 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 576 transitions. Word has length 27 [2022-12-13 17:22:23,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:22:23,781 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 576 transitions. [2022-12-13 17:22:23,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 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) [2022-12-13 17:22:23,781 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 576 transitions. [2022-12-13 17:22:23,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-13 17:22:23,782 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:22:23,782 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] [2022-12-13 17:22:23,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 17:22:23,782 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ASIdleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-12-13 17:22:23,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:22:23,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1263299979, now seen corresponding path program 1 times [2022-12-13 17:22:23,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:22:23,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115828924] [2022-12-13 17:22:23,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:22:23,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:22:23,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:23,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:22:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:23,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:22:23,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:22:23,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115828924] [2022-12-13 17:22:23,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115828924] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:22:23,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:22:23,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:22:23,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531562887] [2022-12-13 17:22:23,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:22:23,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 17:22:23,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:22:23,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 17:22:23,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:22:23,910 INFO L87 Difference]: Start difference. First operand 472 states and 576 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 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) [2022-12-13 17:22:24,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:22:24,477 INFO L93 Difference]: Finished difference Result 585 states and 757 transitions. [2022-12-13 17:22:24,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 17:22:24,478 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 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 27 [2022-12-13 17:22:24,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:22:24,481 INFO L225 Difference]: With dead ends: 585 [2022-12-13 17:22:24,481 INFO L226 Difference]: Without dead ends: 585 [2022-12-13 17:22:24,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-12-13 17:22:24,482 INFO L413 NwaCegarLoop]: 356 mSDtfsCounter, 292 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 1124 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 17:22:24,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 1625 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1124 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 17:22:24,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2022-12-13 17:22:24,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 505. [2022-12-13 17:22:24,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 325 states have (on average 1.5692307692307692) internal successors, (510), 442 states have internal predecessors, (510), 43 states have call successors, (43), 22 states have call predecessors, (43), 27 states have return successors, (68), 40 states have call predecessors, (68), 43 states have call successors, (68) [2022-12-13 17:22:24,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 621 transitions. [2022-12-13 17:22:24,496 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 621 transitions. Word has length 27 [2022-12-13 17:22:24,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:22:24,497 INFO L495 AbstractCegarLoop]: Abstraction has 505 states and 621 transitions. [2022-12-13 17:22:24,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 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) [2022-12-13 17:22:24,497 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 621 transitions. [2022-12-13 17:22:24,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-13 17:22:24,498 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:22:24,498 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:22:24,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 17:22:24,498 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-12-13 17:22:24,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:22:24,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1917156537, now seen corresponding path program 1 times [2022-12-13 17:22:24,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:22:24,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84084617] [2022-12-13 17:22:24,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:22:24,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:22:24,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:24,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:22:24,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:24,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 17:22:24,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:24,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:22:24,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:22:24,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84084617] [2022-12-13 17:22:24,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84084617] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:22:24,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:22:24,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 17:22:24,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470817283] [2022-12-13 17:22:24,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:22:24,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 17:22:24,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:22:24,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 17:22:24,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 17:22:24,763 INFO L87 Difference]: Start difference. First operand 505 states and 621 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 17:22:25,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:22:25,853 INFO L93 Difference]: Finished difference Result 787 states and 1061 transitions. [2022-12-13 17:22:25,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 17:22:25,854 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-12-13 17:22:25,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:22:25,857 INFO L225 Difference]: With dead ends: 787 [2022-12-13 17:22:25,857 INFO L226 Difference]: Without dead ends: 787 [2022-12-13 17:22:25,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2022-12-13 17:22:25,858 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 1085 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 1718 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 2024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-13 17:22:25,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1087 Valid, 1181 Invalid, 2024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1718 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-13 17:22:25,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2022-12-13 17:22:25,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 686. [2022-12-13 17:22:25,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 469 states have (on average 1.4989339019189765) internal successors, (703), 589 states have internal predecessors, (703), 60 states have call successors, (60), 32 states have call predecessors, (60), 47 states have return successors, (150), 64 states have call predecessors, (150), 60 states have call successors, (150) [2022-12-13 17:22:25,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 913 transitions. [2022-12-13 17:22:25,872 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 913 transitions. Word has length 26 [2022-12-13 17:22:25,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:22:25,872 INFO L495 AbstractCegarLoop]: Abstraction has 686 states and 913 transitions. [2022-12-13 17:22:25,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 17:22:25,872 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 913 transitions. [2022-12-13 17:22:25,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-13 17:22:25,873 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:22:25,873 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] [2022-12-13 17:22:25,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 17:22:25,873 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ASStopErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-12-13 17:22:25,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:22:25,873 INFO L85 PathProgramCache]: Analyzing trace with hash 496817328, now seen corresponding path program 1 times [2022-12-13 17:22:25,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:22:25,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745977411] [2022-12-13 17:22:25,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:22:25,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:22:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:25,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:22:25,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:25,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:22:25,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:22:25,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745977411] [2022-12-13 17:22:25,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745977411] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:22:25,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:22:25,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:22:25,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120286493] [2022-12-13 17:22:25,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:22:25,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 17:22:25,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:22:25,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 17:22:25,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:22:25,976 INFO L87 Difference]: Start difference. First operand 686 states and 913 transitions. Second operand has 8 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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) [2022-12-13 17:22:26,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:22:26,509 INFO L93 Difference]: Finished difference Result 801 states and 1108 transitions. [2022-12-13 17:22:26,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 17:22:26,509 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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 28 [2022-12-13 17:22:26,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:22:26,515 INFO L225 Difference]: With dead ends: 801 [2022-12-13 17:22:26,515 INFO L226 Difference]: Without dead ends: 801 [2022-12-13 17:22:26,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-12-13 17:22:26,516 INFO L413 NwaCegarLoop]: 352 mSDtfsCounter, 312 mSDsluCounter, 1243 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 1595 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 17:22:26,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 1595 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 17:22:26,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2022-12-13 17:22:26,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 752. [2022-12-13 17:22:26,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 752 states, 526 states have (on average 1.4885931558935361) internal successors, (783), 649 states have internal predecessors, (783), 62 states have call successors, (62), 35 states have call predecessors, (62), 54 states have return successors, (167), 67 states have call predecessors, (167), 62 states have call successors, (167) [2022-12-13 17:22:26,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1012 transitions. [2022-12-13 17:22:26,529 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1012 transitions. Word has length 28 [2022-12-13 17:22:26,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:22:26,529 INFO L495 AbstractCegarLoop]: Abstraction has 752 states and 1012 transitions. [2022-12-13 17:22:26,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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) [2022-12-13 17:22:26,530 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1012 transitions. [2022-12-13 17:22:26,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-13 17:22:26,530 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:22:26,530 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] [2022-12-13 17:22:26,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 17:22:26,530 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ASStopErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-12-13 17:22:26,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:22:26,531 INFO L85 PathProgramCache]: Analyzing trace with hash 496817329, now seen corresponding path program 1 times [2022-12-13 17:22:26,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:22:26,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650582048] [2022-12-13 17:22:26,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:22:26,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:22:26,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:26,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:22:26,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:26,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:22:26,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:22:26,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650582048] [2022-12-13 17:22:26,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650582048] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:22:26,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:22:26,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:22:26,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121114990] [2022-12-13 17:22:26,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:22:26,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 17:22:26,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:22:26,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 17:22:26,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:22:26,738 INFO L87 Difference]: Start difference. First operand 752 states and 1012 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 5 states have internal predecessors, (24), 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) [2022-12-13 17:22:27,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:22:27,422 INFO L93 Difference]: Finished difference Result 876 states and 1209 transitions. [2022-12-13 17:22:27,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 17:22:27,422 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 5 states have internal predecessors, (24), 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 28 [2022-12-13 17:22:27,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:22:27,425 INFO L225 Difference]: With dead ends: 876 [2022-12-13 17:22:27,425 INFO L226 Difference]: Without dead ends: 876 [2022-12-13 17:22:27,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-12-13 17:22:27,426 INFO L413 NwaCegarLoop]: 355 mSDtfsCounter, 281 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 1017 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 17:22:27,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 1656 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1017 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 17:22:27,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2022-12-13 17:22:27,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 844. [2022-12-13 17:22:27,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 601 states have (on average 1.4708818635607321) internal successors, (884), 728 states have internal predecessors, (884), 69 states have call successors, (69), 39 states have call predecessors, (69), 64 states have return successors, (197), 76 states have call predecessors, (197), 69 states have call successors, (197) [2022-12-13 17:22:27,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1150 transitions. [2022-12-13 17:22:27,441 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1150 transitions. Word has length 28 [2022-12-13 17:22:27,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:22:27,441 INFO L495 AbstractCegarLoop]: Abstraction has 844 states and 1150 transitions. [2022-12-13 17:22:27,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 5 states have internal predecessors, (24), 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) [2022-12-13 17:22:27,441 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1150 transitions. [2022-12-13 17:22:27,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-13 17:22:27,442 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:22:27,442 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] [2022-12-13 17:22:27,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 17:22:27,442 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ASIdleErr12ASSERT_VIOLATIONMEMORY_LEAK === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-12-13 17:22:27,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:22:27,442 INFO L85 PathProgramCache]: Analyzing trace with hash -844436086, now seen corresponding path program 1 times [2022-12-13 17:22:27,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:22:27,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136370202] [2022-12-13 17:22:27,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:22:27,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:22:27,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:27,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:22:27,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:27,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:22:27,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:22:27,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136370202] [2022-12-13 17:22:27,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136370202] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:22:27,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:22:27,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 17:22:27,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142219220] [2022-12-13 17:22:27,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:22:27,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 17:22:27,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:22:27,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 17:22:27,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-12-13 17:22:27,721 INFO L87 Difference]: Start difference. First operand 844 states and 1150 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 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) [2022-12-13 17:22:28,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:22:28,246 INFO L93 Difference]: Finished difference Result 807 states and 1083 transitions. [2022-12-13 17:22:28,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 17:22:28,246 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 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 31 [2022-12-13 17:22:28,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:22:28,250 INFO L225 Difference]: With dead ends: 807 [2022-12-13 17:22:28,250 INFO L226 Difference]: Without dead ends: 807 [2022-12-13 17:22:28,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2022-12-13 17:22:28,251 INFO L413 NwaCegarLoop]: 351 mSDtfsCounter, 231 mSDsluCounter, 2575 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 2926 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 17:22:28,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 2926 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 17:22:28,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2022-12-13 17:22:28,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 760. [2022-12-13 17:22:28,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 535 states have (on average 1.4953271028037383) internal successors, (800), 656 states have internal predecessors, (800), 64 states have call successors, (64), 36 states have call predecessors, (64), 51 states have return successors, (164), 67 states have call predecessors, (164), 64 states have call successors, (164) [2022-12-13 17:22:28,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1028 transitions. [2022-12-13 17:22:28,271 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1028 transitions. Word has length 31 [2022-12-13 17:22:28,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:22:28,272 INFO L495 AbstractCegarLoop]: Abstraction has 760 states and 1028 transitions. [2022-12-13 17:22:28,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 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) [2022-12-13 17:22:28,272 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1028 transitions. [2022-12-13 17:22:28,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-13 17:22:28,272 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:22:28,273 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] [2022-12-13 17:22:28,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 17:22:28,273 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ASStopErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-12-13 17:22:28,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:22:28,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1526253480, now seen corresponding path program 1 times [2022-12-13 17:22:28,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:22:28,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378595978] [2022-12-13 17:22:28,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:22:28,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:22:28,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:28,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:22:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:28,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:22:28,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:22:28,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378595978] [2022-12-13 17:22:28,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378595978] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:22:28,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:22:28,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:22:28,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187481001] [2022-12-13 17:22:28,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:22:28,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:22:28,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:22:28,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:22:28,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:22:28,352 INFO L87 Difference]: Start difference. First operand 760 states and 1028 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 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) [2022-12-13 17:22:28,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:22:28,748 INFO L93 Difference]: Finished difference Result 814 states and 1110 transitions. [2022-12-13 17:22:28,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 17:22:28,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 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 32 [2022-12-13 17:22:28,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:22:28,754 INFO L225 Difference]: With dead ends: 814 [2022-12-13 17:22:28,754 INFO L226 Difference]: Without dead ends: 814 [2022-12-13 17:22:28,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:22:28,755 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 539 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 17:22:28,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 585 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 17:22:28,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2022-12-13 17:22:28,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 767. [2022-12-13 17:22:28,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 540 states have (on average 1.4796296296296296) internal successors, (799), 663 states have internal predecessors, (799), 64 states have call successors, (64), 36 states have call predecessors, (64), 54 states have return successors, (168), 67 states have call predecessors, (168), 64 states have call successors, (168) [2022-12-13 17:22:28,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1031 transitions. [2022-12-13 17:22:28,768 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1031 transitions. Word has length 32 [2022-12-13 17:22:28,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:22:28,768 INFO L495 AbstractCegarLoop]: Abstraction has 767 states and 1031 transitions. [2022-12-13 17:22:28,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 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) [2022-12-13 17:22:28,768 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1031 transitions. [2022-12-13 17:22:28,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-13 17:22:28,768 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:22:28,769 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 17:22:28,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 17:22:28,769 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-12-13 17:22:28,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:22:28,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1795503433, now seen corresponding path program 1 times [2022-12-13 17:22:28,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:22:28,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689780353] [2022-12-13 17:22:28,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:22:28,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:22:28,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:28,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:22:28,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:28,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 17:22:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:28,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 17:22:28,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:22:28,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689780353] [2022-12-13 17:22:28,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689780353] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:22:28,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:22:28,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:22:28,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749566904] [2022-12-13 17:22:28,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:22:28,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:22:28,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:22:28,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:22:28,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:22:28,824 INFO L87 Difference]: Start difference. First operand 767 states and 1031 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 17:22:29,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:22:29,122 INFO L93 Difference]: Finished difference Result 773 states and 1039 transitions. [2022-12-13 17:22:29,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 17:22:29,123 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2022-12-13 17:22:29,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:22:29,125 INFO L225 Difference]: With dead ends: 773 [2022-12-13 17:22:29,125 INFO L226 Difference]: Without dead ends: 773 [2022-12-13 17:22:29,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:22:29,125 INFO L413 NwaCegarLoop]: 342 mSDtfsCounter, 177 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 17:22:29,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 934 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 17:22:29,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2022-12-13 17:22:29,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 765. [2022-12-13 17:22:29,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 540 states have (on average 1.4759259259259259) internal successors, (797), 661 states have internal predecessors, (797), 64 states have call successors, (64), 36 states have call predecessors, (64), 54 states have return successors, (168), 67 states have call predecessors, (168), 64 states have call successors, (168) [2022-12-13 17:22:29,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1029 transitions. [2022-12-13 17:22:29,136 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1029 transitions. Word has length 34 [2022-12-13 17:22:29,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:22:29,136 INFO L495 AbstractCegarLoop]: Abstraction has 765 states and 1029 transitions. [2022-12-13 17:22:29,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 17:22:29,137 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1029 transitions. [2022-12-13 17:22:29,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-13 17:22:29,137 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:22:29,137 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 17:22:29,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 17:22:29,137 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-12-13 17:22:29,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:22:29,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1795503432, now seen corresponding path program 1 times [2022-12-13 17:22:29,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:22:29,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684375315] [2022-12-13 17:22:29,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:22:29,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:22:29,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:29,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:22:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:29,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 17:22:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:29,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 17:22:29,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:22:29,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684375315] [2022-12-13 17:22:29,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684375315] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:22:29,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:22:29,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 17:22:29,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960139265] [2022-12-13 17:22:29,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:22:29,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 17:22:29,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:22:29,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 17:22:29,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-12-13 17:22:29,349 INFO L87 Difference]: Start difference. First operand 765 states and 1029 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 17:22:29,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:22:29,755 INFO L93 Difference]: Finished difference Result 779 states and 1045 transitions. [2022-12-13 17:22:29,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 17:22:29,755 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2022-12-13 17:22:29,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:22:29,759 INFO L225 Difference]: With dead ends: 779 [2022-12-13 17:22:29,759 INFO L226 Difference]: Without dead ends: 779 [2022-12-13 17:22:29,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2022-12-13 17:22:29,760 INFO L413 NwaCegarLoop]: 350 mSDtfsCounter, 228 mSDsluCounter, 2211 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 2561 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 17:22:29,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 2561 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 17:22:29,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2022-12-13 17:22:29,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 765. [2022-12-13 17:22:29,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 540 states have (on average 1.474074074074074) internal successors, (796), 661 states have internal predecessors, (796), 64 states have call successors, (64), 36 states have call predecessors, (64), 54 states have return successors, (168), 67 states have call predecessors, (168), 64 states have call successors, (168) [2022-12-13 17:22:29,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1028 transitions. [2022-12-13 17:22:29,780 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1028 transitions. Word has length 34 [2022-12-13 17:22:29,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:22:29,780 INFO L495 AbstractCegarLoop]: Abstraction has 765 states and 1028 transitions. [2022-12-13 17:22:29,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 17:22:29,781 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1028 transitions. [2022-12-13 17:22:29,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-13 17:22:29,781 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:22:29,781 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] [2022-12-13 17:22:29,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 17:22:29,782 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-12-13 17:22:29,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:22:29,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1576983610, now seen corresponding path program 1 times [2022-12-13 17:22:29,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:22:29,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270192948] [2022-12-13 17:22:29,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:22:29,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:22:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:29,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:22:29,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:29,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 17:22:29,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:30,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:22:30,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:22:30,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270192948] [2022-12-13 17:22:30,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270192948] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:22:30,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:22:30,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 17:22:30,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554760605] [2022-12-13 17:22:30,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:22:30,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 17:22:30,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:22:30,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 17:22:30,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 17:22:30,041 INFO L87 Difference]: Start difference. First operand 765 states and 1028 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 17:22:31,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:22:31,156 INFO L93 Difference]: Finished difference Result 637 states and 833 transitions. [2022-12-13 17:22:31,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 17:22:31,156 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2022-12-13 17:22:31,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:22:31,158 INFO L225 Difference]: With dead ends: 637 [2022-12-13 17:22:31,158 INFO L226 Difference]: Without dead ends: 637 [2022-12-13 17:22:31,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=194, Invalid=676, Unknown=0, NotChecked=0, Total=870 [2022-12-13 17:22:31,159 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 1230 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1243 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 2099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-13 17:22:31,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1243 Valid, 1141 Invalid, 2099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-13 17:22:31,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2022-12-13 17:22:31,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 544. [2022-12-13 17:22:31,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 357 states have (on average 1.5434173669467788) internal successors, (551), 471 states have internal predecessors, (551), 49 states have call successors, (49), 27 states have call predecessors, (49), 31 states have return successors, (110), 45 states have call predecessors, (110), 49 states have call successors, (110) [2022-12-13 17:22:31,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 710 transitions. [2022-12-13 17:22:31,170 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 710 transitions. Word has length 32 [2022-12-13 17:22:31,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:22:31,170 INFO L495 AbstractCegarLoop]: Abstraction has 544 states and 710 transitions. [2022-12-13 17:22:31,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 17:22:31,170 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 710 transitions. [2022-12-13 17:22:31,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-13 17:22:31,171 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:22:31,171 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:22:31,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 17:22:31,171 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-12-13 17:22:31,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:22:31,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1916439266, now seen corresponding path program 1 times [2022-12-13 17:22:31,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:22:31,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464574449] [2022-12-13 17:22:31,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:22:31,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:22:31,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:31,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:22:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:31,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 17:22:31,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:31,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:22:31,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:22:31,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464574449] [2022-12-13 17:22:31,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464574449] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:22:31,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:22:31,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 17:22:31,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972785704] [2022-12-13 17:22:31,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:22:31,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 17:22:31,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:22:31,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 17:22:31,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:22:31,273 INFO L87 Difference]: Start difference. First operand 544 states and 710 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 17:22:31,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:22:31,545 INFO L93 Difference]: Finished difference Result 606 states and 793 transitions. [2022-12-13 17:22:31,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 17:22:31,545 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (5), 4 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 37 [2022-12-13 17:22:31,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:22:31,549 INFO L225 Difference]: With dead ends: 606 [2022-12-13 17:22:31,549 INFO L226 Difference]: Without dead ends: 604 [2022-12-13 17:22:31,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-12-13 17:22:31,550 INFO L413 NwaCegarLoop]: 347 mSDtfsCounter, 158 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 17:22:31,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1344 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 17:22:31,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2022-12-13 17:22:31,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 562. [2022-12-13 17:22:31,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 372 states have (on average 1.5295698924731183) internal successors, (569), 487 states have internal predecessors, (569), 49 states have call successors, (49), 29 states have call predecessors, (49), 34 states have return successors, (106), 45 states have call predecessors, (106), 49 states have call successors, (106) [2022-12-13 17:22:31,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 724 transitions. [2022-12-13 17:22:31,567 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 724 transitions. Word has length 37 [2022-12-13 17:22:31,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:22:31,567 INFO L495 AbstractCegarLoop]: Abstraction has 562 states and 724 transitions. [2022-12-13 17:22:31,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 17:22:31,568 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 724 transitions. [2022-12-13 17:22:31,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-13 17:22:31,568 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:22:31,568 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] [2022-12-13 17:22:31,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 17:22:31,568 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-12-13 17:22:31,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:22:31,569 INFO L85 PathProgramCache]: Analyzing trace with hash 960292098, now seen corresponding path program 1 times [2022-12-13 17:22:31,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:22:31,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641444156] [2022-12-13 17:22:31,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:22:31,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:22:31,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:31,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:22:31,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:31,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 17:22:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:31,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 17:22:31,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:31,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:22:31,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:22:31,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641444156] [2022-12-13 17:22:31,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641444156] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:22:31,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:22:31,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 17:22:31,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746908613] [2022-12-13 17:22:31,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:22:31,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 17:22:31,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:22:31,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 17:22:31,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 17:22:31,795 INFO L87 Difference]: Start difference. First operand 562 states and 724 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 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) [2022-12-13 17:22:32,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:22:32,389 INFO L93 Difference]: Finished difference Result 608 states and 795 transitions. [2022-12-13 17:22:32,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 17:22:32,390 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 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 36 [2022-12-13 17:22:32,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:22:32,391 INFO L225 Difference]: With dead ends: 608 [2022-12-13 17:22:32,391 INFO L226 Difference]: Without dead ends: 601 [2022-12-13 17:22:32,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-12-13 17:22:32,392 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 269 mSDsluCounter, 1926 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 2234 SdHoareTripleChecker+Invalid, 1276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 17:22:32,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 2234 Invalid, 1276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 17:22:32,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2022-12-13 17:22:32,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 562. [2022-12-13 17:22:32,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 372 states have (on average 1.5268817204301075) internal successors, (568), 487 states have internal predecessors, (568), 49 states have call successors, (49), 29 states have call predecessors, (49), 34 states have return successors, (107), 45 states have call predecessors, (107), 49 states have call successors, (107) [2022-12-13 17:22:32,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 724 transitions. [2022-12-13 17:22:32,400 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 724 transitions. Word has length 36 [2022-12-13 17:22:32,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:22:32,400 INFO L495 AbstractCegarLoop]: Abstraction has 562 states and 724 transitions. [2022-12-13 17:22:32,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 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) [2022-12-13 17:22:32,400 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 724 transitions. [2022-12-13 17:22:32,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-13 17:22:32,401 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:22:32,401 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:22:32,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 17:22:32,401 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-12-13 17:22:32,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:22:32,401 INFO L85 PathProgramCache]: Analyzing trace with hash -615298044, now seen corresponding path program 1 times [2022-12-13 17:22:32,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:22:32,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982179077] [2022-12-13 17:22:32,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:22:32,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:22:32,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:32,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:22:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:32,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 17:22:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:32,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:22:32,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:22:32,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982179077] [2022-12-13 17:22:32,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982179077] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:22:32,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:22:32,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 17:22:32,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904712532] [2022-12-13 17:22:32,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:22:32,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 17:22:32,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:22:32,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 17:22:32,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 17:22:32,657 INFO L87 Difference]: Start difference. First operand 562 states and 724 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 3 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 17:22:33,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:22:33,885 INFO L93 Difference]: Finished difference Result 847 states and 1194 transitions. [2022-12-13 17:22:33,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 17:22:33,885 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 3 states have call successors, (5), 5 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 39 [2022-12-13 17:22:33,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:22:33,888 INFO L225 Difference]: With dead ends: 847 [2022-12-13 17:22:33,889 INFO L226 Difference]: Without dead ends: 841 [2022-12-13 17:22:33,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=635, Unknown=0, NotChecked=0, Total=812 [2022-12-13 17:22:33,889 INFO L413 NwaCegarLoop]: 464 mSDtfsCounter, 503 mSDsluCounter, 2416 mSDsCounter, 0 mSdLazyCounter, 1561 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 2880 SdHoareTripleChecker+Invalid, 1734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 1561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:22:33,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 2880 Invalid, 1734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1561 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-13 17:22:33,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2022-12-13 17:22:33,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 769. [2022-12-13 17:22:33,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 538 states have (on average 1.4758364312267658) internal successors, (794), 649 states have internal predecessors, (794), 64 states have call successors, (64), 41 states have call predecessors, (64), 60 states have return successors, (241), 78 states have call predecessors, (241), 64 states have call successors, (241) [2022-12-13 17:22:33,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1099 transitions. [2022-12-13 17:22:33,903 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1099 transitions. Word has length 39 [2022-12-13 17:22:33,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:22:33,903 INFO L495 AbstractCegarLoop]: Abstraction has 769 states and 1099 transitions. [2022-12-13 17:22:33,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 3 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 17:22:33,903 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1099 transitions. [2022-12-13 17:22:33,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-13 17:22:33,903 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:22:33,903 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:22:33,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 17:22:33,903 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-12-13 17:22:33,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:22:33,904 INFO L85 PathProgramCache]: Analyzing trace with hash 553374118, now seen corresponding path program 1 times [2022-12-13 17:22:33,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:22:33,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488818624] [2022-12-13 17:22:33,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:22:33,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:22:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:34,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:22:34,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:34,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 17:22:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:34,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:22:34,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:22:34,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488818624] [2022-12-13 17:22:34,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488818624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:22:34,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:22:34,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-13 17:22:34,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946922392] [2022-12-13 17:22:34,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:22:34,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 17:22:34,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:22:34,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 17:22:34,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-12-13 17:22:34,404 INFO L87 Difference]: Start difference. First operand 769 states and 1099 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 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) [2022-12-13 17:22:35,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:22:35,254 INFO L93 Difference]: Finished difference Result 846 states and 1263 transitions. [2022-12-13 17:22:35,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 17:22:35,255 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 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 41 [2022-12-13 17:22:35,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:22:35,257 INFO L225 Difference]: With dead ends: 846 [2022-12-13 17:22:35,257 INFO L226 Difference]: Without dead ends: 846 [2022-12-13 17:22:35,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2022-12-13 17:22:35,257 INFO L413 NwaCegarLoop]: 332 mSDtfsCounter, 391 mSDsluCounter, 1581 mSDsCounter, 0 mSdLazyCounter, 1391 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 1913 SdHoareTripleChecker+Invalid, 1509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 17:22:35,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 1913 Invalid, 1509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1391 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 17:22:35,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2022-12-13 17:22:35,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 780. [2022-12-13 17:22:35,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 547 states have (on average 1.469835466179159) internal successors, (804), 658 states have internal predecessors, (804), 65 states have call successors, (65), 42 states have call predecessors, (65), 61 states have return successors, (243), 79 states have call predecessors, (243), 65 states have call successors, (243) [2022-12-13 17:22:35,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1112 transitions. [2022-12-13 17:22:35,282 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1112 transitions. Word has length 41 [2022-12-13 17:22:35,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:22:35,282 INFO L495 AbstractCegarLoop]: Abstraction has 780 states and 1112 transitions. [2022-12-13 17:22:35,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 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) [2022-12-13 17:22:35,282 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1112 transitions. [2022-12-13 17:22:35,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-13 17:22:35,282 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:22:35,283 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:22:35,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 17:22:35,283 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting system_initializeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-12-13 17:22:35,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:22:35,283 INFO L85 PathProgramCache]: Analyzing trace with hash 553374119, now seen corresponding path program 1 times [2022-12-13 17:22:35,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:22:35,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734582639] [2022-12-13 17:22:35,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:22:35,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:22:35,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:35,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:22:35,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:35,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 17:22:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:36,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:22:36,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:22:36,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734582639] [2022-12-13 17:22:36,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734582639] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:22:36,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:22:36,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 17:22:36,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452068936] [2022-12-13 17:22:36,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:22:36,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 17:22:36,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:22:36,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 17:22:36,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-12-13 17:22:36,037 INFO L87 Difference]: Start difference. First operand 780 states and 1112 transitions. Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 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) [2022-12-13 17:22:36,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:22:36,878 INFO L93 Difference]: Finished difference Result 845 states and 1262 transitions. [2022-12-13 17:22:36,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 17:22:36,878 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 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 41 [2022-12-13 17:22:36,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:22:36,883 INFO L225 Difference]: With dead ends: 845 [2022-12-13 17:22:36,884 INFO L226 Difference]: Without dead ends: 845 [2022-12-13 17:22:36,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2022-12-13 17:22:36,884 INFO L413 NwaCegarLoop]: 331 mSDtfsCounter, 537 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 1130 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 1607 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 17:22:36,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 1607 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1130 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 17:22:36,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2022-12-13 17:22:36,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 780. [2022-12-13 17:22:36,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 547 states have (on average 1.4680073126142597) internal successors, (803), 658 states have internal predecessors, (803), 65 states have call successors, (65), 42 states have call predecessors, (65), 61 states have return successors, (243), 79 states have call predecessors, (243), 65 states have call successors, (243) [2022-12-13 17:22:36,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1111 transitions. [2022-12-13 17:22:36,898 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1111 transitions. Word has length 41 [2022-12-13 17:22:36,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:22:36,898 INFO L495 AbstractCegarLoop]: Abstraction has 780 states and 1111 transitions. [2022-12-13 17:22:36,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 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) [2022-12-13 17:22:36,898 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1111 transitions. [2022-12-13 17:22:36,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-13 17:22:36,898 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:22:36,898 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:22:36,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 17:22:36,899 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting system_initializeErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-12-13 17:22:36,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:22:36,899 INFO L85 PathProgramCache]: Analyzing trace with hash -783413049, now seen corresponding path program 1 times [2022-12-13 17:22:36,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:22:36,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743642691] [2022-12-13 17:22:36,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:22:36,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:22:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:36,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:22:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:36,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 17:22:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:36,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:22:36,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:22:36,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743642691] [2022-12-13 17:22:36,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743642691] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:22:36,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:22:36,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:22:36,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076352480] [2022-12-13 17:22:36,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:22:36,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:22:36,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:22:36,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:22:36,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:22:36,954 INFO L87 Difference]: Start difference. First operand 780 states and 1111 transitions. Second operand has 5 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 17:22:37,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:22:37,208 INFO L93 Difference]: Finished difference Result 796 states and 1151 transitions. [2022-12-13 17:22:37,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:22:37,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (5), 3 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 43 [2022-12-13 17:22:37,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:22:37,210 INFO L225 Difference]: With dead ends: 796 [2022-12-13 17:22:37,210 INFO L226 Difference]: Without dead ends: 796 [2022-12-13 17:22:37,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:22:37,211 INFO L413 NwaCegarLoop]: 349 mSDtfsCounter, 277 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 17:22:37,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 743 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 17:22:37,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2022-12-13 17:22:37,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 778. [2022-12-13 17:22:37,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 547 states have (on average 1.4606946983546618) internal successors, (799), 656 states have internal predecessors, (799), 65 states have call successors, (65), 42 states have call predecessors, (65), 61 states have return successors, (243), 79 states have call predecessors, (243), 65 states have call successors, (243) [2022-12-13 17:22:37,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1107 transitions. [2022-12-13 17:22:37,224 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1107 transitions. Word has length 43 [2022-12-13 17:22:37,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:22:37,224 INFO L495 AbstractCegarLoop]: Abstraction has 778 states and 1107 transitions. [2022-12-13 17:22:37,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 17:22:37,224 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1107 transitions. [2022-12-13 17:22:37,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-13 17:22:37,224 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:22:37,224 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:22:37,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 17:22:37,225 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting system_initializeErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-12-13 17:22:37,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:22:37,225 INFO L85 PathProgramCache]: Analyzing trace with hash -783413048, now seen corresponding path program 1 times [2022-12-13 17:22:37,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:22:37,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746041997] [2022-12-13 17:22:37,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:22:37,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:22:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:37,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:22:37,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:37,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 17:22:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:37,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:22:37,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:22:37,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746041997] [2022-12-13 17:22:37,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746041997] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:22:37,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:22:37,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:22:37,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349991626] [2022-12-13 17:22:37,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:22:37,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:22:37,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:22:37,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:22:37,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:22:37,296 INFO L87 Difference]: Start difference. First operand 778 states and 1107 transitions. Second operand has 5 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 17:22:37,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:22:37,560 INFO L93 Difference]: Finished difference Result 794 states and 1147 transitions. [2022-12-13 17:22:37,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:22:37,560 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (5), 3 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 43 [2022-12-13 17:22:37,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:22:37,564 INFO L225 Difference]: With dead ends: 794 [2022-12-13 17:22:37,564 INFO L226 Difference]: Without dead ends: 794 [2022-12-13 17:22:37,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:22:37,564 INFO L413 NwaCegarLoop]: 349 mSDtfsCounter, 271 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 17:22:37,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 746 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 17:22:37,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2022-12-13 17:22:37,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 776. [2022-12-13 17:22:37,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 547 states have (on average 1.453382084095064) internal successors, (795), 654 states have internal predecessors, (795), 65 states have call successors, (65), 42 states have call predecessors, (65), 61 states have return successors, (243), 79 states have call predecessors, (243), 65 states have call successors, (243) [2022-12-13 17:22:37,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1103 transitions. [2022-12-13 17:22:37,583 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1103 transitions. Word has length 43 [2022-12-13 17:22:37,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:22:37,584 INFO L495 AbstractCegarLoop]: Abstraction has 776 states and 1103 transitions. [2022-12-13 17:22:37,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 17:22:37,584 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1103 transitions. [2022-12-13 17:22:37,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-12-13 17:22:37,584 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:22:37,584 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:22:37,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 17:22:37,585 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-12-13 17:22:37,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:22:37,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1255417078, now seen corresponding path program 1 times [2022-12-13 17:22:37,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:22:37,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110096390] [2022-12-13 17:22:37,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:22:37,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:22:37,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:37,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:22:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:37,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 17:22:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:37,685 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:22:37,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:22:37,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110096390] [2022-12-13 17:22:37,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110096390] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:22:37,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:22:37,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 17:22:37,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570725180] [2022-12-13 17:22:37,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:22:37,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 17:22:37,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:22:37,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 17:22:37,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 17:22:37,687 INFO L87 Difference]: Start difference. First operand 776 states and 1103 transitions. Second operand has 9 states, 7 states have (on average 6.142857142857143) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 17:22:38,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:22:38,101 INFO L93 Difference]: Finished difference Result 828 states and 1208 transitions. [2022-12-13 17:22:38,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 17:22:38,101 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 6.142857142857143) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (7), 5 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 52 [2022-12-13 17:22:38,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:22:38,104 INFO L225 Difference]: With dead ends: 828 [2022-12-13 17:22:38,104 INFO L226 Difference]: Without dead ends: 828 [2022-12-13 17:22:38,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-12-13 17:22:38,104 INFO L413 NwaCegarLoop]: 357 mSDtfsCounter, 364 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 1641 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 17:22:38,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 1641 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1005 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 17:22:38,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2022-12-13 17:22:38,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 801. [2022-12-13 17:22:38,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 568 states have (on average 1.4507042253521127) internal successors, (824), 676 states have internal predecessors, (824), 66 states have call successors, (66), 44 states have call predecessors, (66), 64 states have return successors, (248), 80 states have call predecessors, (248), 66 states have call successors, (248) [2022-12-13 17:22:38,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1138 transitions. [2022-12-13 17:22:38,117 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1138 transitions. Word has length 52 [2022-12-13 17:22:38,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:22:38,117 INFO L495 AbstractCegarLoop]: Abstraction has 801 states and 1138 transitions. [2022-12-13 17:22:38,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 6.142857142857143) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 17:22:38,117 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1138 transitions. [2022-12-13 17:22:38,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-12-13 17:22:38,117 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:22:38,118 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:22:38,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-13 17:22:38,118 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ASNullErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-12-13 17:22:38,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:22:38,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1255417079, now seen corresponding path program 1 times [2022-12-13 17:22:38,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:22:38,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135520394] [2022-12-13 17:22:38,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:22:38,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:22:38,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:38,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:22:38,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:38,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 17:22:38,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:38,408 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:22:38,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:22:38,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135520394] [2022-12-13 17:22:38,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135520394] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:22:38,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726554134] [2022-12-13 17:22:38,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:22:38,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:22:38,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef60e33f-af2a-4c49-8954-dacd09833824/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:22:38,410 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef60e33f-af2a-4c49-8954-dacd09833824/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:22:38,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef60e33f-af2a-4c49-8954-dacd09833824/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 17:22:38,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:38,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 17:22:38,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:22:38,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 17:22:38,690 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:22:38,690 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:22:38,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726554134] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:22:38,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 17:22:38,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 22 [2022-12-13 17:22:38,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447000307] [2022-12-13 17:22:38,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:22:38,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:22:38,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:22:38,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:22:38,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2022-12-13 17:22:38,692 INFO L87 Difference]: Start difference. First operand 801 states and 1138 transitions. Second operand has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 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) [2022-12-13 17:22:39,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:22:39,113 INFO L93 Difference]: Finished difference Result 809 states and 1161 transitions. [2022-12-13 17:22:39,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 17:22:39,113 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 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 52 [2022-12-13 17:22:39,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:22:39,115 INFO L225 Difference]: With dead ends: 809 [2022-12-13 17:22:39,115 INFO L226 Difference]: Without dead ends: 809 [2022-12-13 17:22:39,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2022-12-13 17:22:39,116 INFO L413 NwaCegarLoop]: 387 mSDtfsCounter, 52 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 17:22:39,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1575 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 17:22:39,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2022-12-13 17:22:39,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 801. [2022-12-13 17:22:39,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 568 states have (on average 1.448943661971831) internal successors, (823), 676 states have internal predecessors, (823), 66 states have call successors, (66), 44 states have call predecessors, (66), 64 states have return successors, (248), 80 states have call predecessors, (248), 66 states have call successors, (248) [2022-12-13 17:22:39,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1137 transitions. [2022-12-13 17:22:39,128 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1137 transitions. Word has length 52 [2022-12-13 17:22:39,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:22:39,128 INFO L495 AbstractCegarLoop]: Abstraction has 801 states and 1137 transitions. [2022-12-13 17:22:39,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 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) [2022-12-13 17:22:39,128 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1137 transitions. [2022-12-13 17:22:39,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-13 17:22:39,128 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:22:39,129 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, 1] [2022-12-13 17:22:39,135 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef60e33f-af2a-4c49-8954-dacd09833824/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 17:22:39,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef60e33f-af2a-4c49-8954-dacd09833824/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:22:39,331 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-12-13 17:22:39,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:22:39,332 INFO L85 PathProgramCache]: Analyzing trace with hash 252155595, now seen corresponding path program 1 times [2022-12-13 17:22:39,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:22:39,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708992984] [2022-12-13 17:22:39,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:22:39,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:22:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:39,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:22:39,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:39,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 17:22:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:39,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:22:39,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:22:39,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708992984] [2022-12-13 17:22:39,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708992984] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:22:39,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:22:39,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 17:22:39,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050115714] [2022-12-13 17:22:39,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:22:39,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 17:22:39,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:22:39,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 17:22:39,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 17:22:39,479 INFO L87 Difference]: Start difference. First operand 801 states and 1137 transitions. Second operand has 9 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 17:22:40,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:22:40,148 INFO L93 Difference]: Finished difference Result 906 states and 1315 transitions. [2022-12-13 17:22:40,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 17:22:40,148 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (7), 5 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 53 [2022-12-13 17:22:40,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:22:40,151 INFO L225 Difference]: With dead ends: 906 [2022-12-13 17:22:40,151 INFO L226 Difference]: Without dead ends: 906 [2022-12-13 17:22:40,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-12-13 17:22:40,151 INFO L413 NwaCegarLoop]: 331 mSDtfsCounter, 358 mSDsluCounter, 1370 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 1701 SdHoareTripleChecker+Invalid, 1236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 17:22:40,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 1701 Invalid, 1236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1165 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 17:22:40,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2022-12-13 17:22:40,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 812. [2022-12-13 17:22:40,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 577 states have (on average 1.4488734835355286) internal successors, (836), 685 states have internal predecessors, (836), 67 states have call successors, (67), 45 states have call predecessors, (67), 65 states have return successors, (251), 81 states have call predecessors, (251), 67 states have call successors, (251) [2022-12-13 17:22:40,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1154 transitions. [2022-12-13 17:22:40,164 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1154 transitions. Word has length 53 [2022-12-13 17:22:40,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:22:40,164 INFO L495 AbstractCegarLoop]: Abstraction has 812 states and 1154 transitions. [2022-12-13 17:22:40,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 17:22:40,165 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1154 transitions. [2022-12-13 17:22:40,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-13 17:22:40,165 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:22:40,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, 1] [2022-12-13 17:22:40,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-13 17:22:40,165 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-12-13 17:22:40,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:22:40,165 INFO L85 PathProgramCache]: Analyzing trace with hash 252155596, now seen corresponding path program 1 times [2022-12-13 17:22:40,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:22:40,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594206737] [2022-12-13 17:22:40,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:22:40,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:22:40,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:40,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:22:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:40,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 17:22:40,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:40,329 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:22:40,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:22:40,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594206737] [2022-12-13 17:22:40,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594206737] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:22:40,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:22:40,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 17:22:40,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654583554] [2022-12-13 17:22:40,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:22:40,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 17:22:40,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:22:40,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 17:22:40,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 17:22:40,330 INFO L87 Difference]: Start difference. First operand 812 states and 1154 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 17:22:40,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:22:40,839 INFO L93 Difference]: Finished difference Result 838 states and 1218 transitions. [2022-12-13 17:22:40,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 17:22:40,839 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (7), 5 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 53 [2022-12-13 17:22:40,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:22:40,841 INFO L225 Difference]: With dead ends: 838 [2022-12-13 17:22:40,841 INFO L226 Difference]: Without dead ends: 838 [2022-12-13 17:22:40,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-12-13 17:22:40,842 INFO L413 NwaCegarLoop]: 348 mSDtfsCounter, 371 mSDsluCounter, 1300 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 1648 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 17:22:40,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 1648 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 17:22:40,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2022-12-13 17:22:40,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 812. [2022-12-13 17:22:40,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 577 states have (on average 1.4471403812824957) internal successors, (835), 685 states have internal predecessors, (835), 67 states have call successors, (67), 45 states have call predecessors, (67), 65 states have return successors, (251), 81 states have call predecessors, (251), 67 states have call successors, (251) [2022-12-13 17:22:40,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1153 transitions. [2022-12-13 17:22:40,854 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1153 transitions. Word has length 53 [2022-12-13 17:22:40,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:22:40,854 INFO L495 AbstractCegarLoop]: Abstraction has 812 states and 1153 transitions. [2022-12-13 17:22:40,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 17:22:40,854 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1153 transitions. [2022-12-13 17:22:40,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-12-13 17:22:40,854 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:22:40,855 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, 1, 1] [2022-12-13 17:22:40,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-13 17:22:40,855 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ASIdleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-12-13 17:22:40,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:22:40,855 INFO L85 PathProgramCache]: Analyzing trace with hash -783668556, now seen corresponding path program 1 times [2022-12-13 17:22:40,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:22:40,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768611072] [2022-12-13 17:22:40,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:22:40,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:22:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:41,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:22:41,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:41,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 17:22:41,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:41,036 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:22:41,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:22:41,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768611072] [2022-12-13 17:22:41,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768611072] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:22:41,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:22:41,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 17:22:41,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938585237] [2022-12-13 17:22:41,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:22:41,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 17:22:41,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:22:41,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 17:22:41,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 17:22:41,038 INFO L87 Difference]: Start difference. First operand 812 states and 1153 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 17:22:41,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:22:41,621 INFO L93 Difference]: Finished difference Result 906 states and 1333 transitions. [2022-12-13 17:22:41,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 17:22:41,622 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (7), 5 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 54 [2022-12-13 17:22:41,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:22:41,627 INFO L225 Difference]: With dead ends: 906 [2022-12-13 17:22:41,627 INFO L226 Difference]: Without dead ends: 906 [2022-12-13 17:22:41,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-12-13 17:22:41,628 INFO L413 NwaCegarLoop]: 349 mSDtfsCounter, 240 mSDsluCounter, 1455 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 1804 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 17:22:41,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 1804 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 17:22:41,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2022-12-13 17:22:41,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 871. [2022-12-13 17:22:41,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 625 states have (on average 1.44) internal successors, (900), 734 states have internal predecessors, (900), 72 states have call successors, (72), 49 states have call predecessors, (72), 71 states have return successors, (279), 87 states have call predecessors, (279), 72 states have call successors, (279) [2022-12-13 17:22:41,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1251 transitions. [2022-12-13 17:22:41,644 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1251 transitions. Word has length 54 [2022-12-13 17:22:41,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:22:41,645 INFO L495 AbstractCegarLoop]: Abstraction has 871 states and 1251 transitions. [2022-12-13 17:22:41,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 17:22:41,645 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1251 transitions. [2022-12-13 17:22:41,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-12-13 17:22:41,645 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:22:41,645 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, 1, 1] [2022-12-13 17:22:41,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-13 17:22:41,645 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ASIdleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-12-13 17:22:41,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:22:41,646 INFO L85 PathProgramCache]: Analyzing trace with hash -783668557, now seen corresponding path program 1 times [2022-12-13 17:22:41,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:22:41,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212007972] [2022-12-13 17:22:41,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:22:41,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:22:41,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:41,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:22:41,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:41,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 17:22:41,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:41,757 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:22:41,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:22:41,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212007972] [2022-12-13 17:22:41,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212007972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:22:41,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:22:41,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 17:22:41,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804232043] [2022-12-13 17:22:41,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:22:41,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 17:22:41,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:22:41,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 17:22:41,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 17:22:41,758 INFO L87 Difference]: Start difference. First operand 871 states and 1251 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 17:22:42,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:22:42,250 INFO L93 Difference]: Finished difference Result 957 states and 1426 transitions. [2022-12-13 17:22:42,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 17:22:42,250 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (7), 5 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 54 [2022-12-13 17:22:42,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:22:42,253 INFO L225 Difference]: With dead ends: 957 [2022-12-13 17:22:42,253 INFO L226 Difference]: Without dead ends: 957 [2022-12-13 17:22:42,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-12-13 17:22:42,254 INFO L413 NwaCegarLoop]: 351 mSDtfsCounter, 453 mSDsluCounter, 1280 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 17:22:42,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 1631 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1091 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 17:22:42,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2022-12-13 17:22:42,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 891. [2022-12-13 17:22:42,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 640 states have (on average 1.428125) internal successors, (914), 751 states have internal predecessors, (914), 72 states have call successors, (72), 49 states have call predecessors, (72), 76 states have return successors, (290), 90 states have call predecessors, (290), 72 states have call successors, (290) [2022-12-13 17:22:42,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1276 transitions. [2022-12-13 17:22:42,270 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1276 transitions. Word has length 54 [2022-12-13 17:22:42,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:22:42,271 INFO L495 AbstractCegarLoop]: Abstraction has 891 states and 1276 transitions. [2022-12-13 17:22:42,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 17:22:42,271 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1276 transitions. [2022-12-13 17:22:42,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-13 17:22:42,272 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:22:42,272 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, 1, 1, 1] [2022-12-13 17:22:42,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-13 17:22:42,272 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ASStopErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-12-13 17:22:42,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:22:42,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1465302152, now seen corresponding path program 1 times [2022-12-13 17:22:42,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:22:42,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209155392] [2022-12-13 17:22:42,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:22:42,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:22:42,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:42,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:22:42,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:42,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 17:22:42,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:42,394 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:22:42,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:22:42,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209155392] [2022-12-13 17:22:42,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209155392] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:22:42,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:22:42,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 17:22:42,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048195000] [2022-12-13 17:22:42,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:22:42,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 17:22:42,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:22:42,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 17:22:42,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 17:22:42,395 INFO L87 Difference]: Start difference. First operand 891 states and 1276 transitions. Second operand has 9 states, 8 states have (on average 5.75) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 17:22:42,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:22:42,997 INFO L93 Difference]: Finished difference Result 973 states and 1450 transitions. [2022-12-13 17:22:42,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 17:22:42,998 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (7), 5 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 55 [2022-12-13 17:22:42,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:22:43,000 INFO L225 Difference]: With dead ends: 973 [2022-12-13 17:22:43,000 INFO L226 Difference]: Without dead ends: 973 [2022-12-13 17:22:43,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-12-13 17:22:43,001 INFO L413 NwaCegarLoop]: 350 mSDtfsCounter, 469 mSDsluCounter, 1259 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 1609 SdHoareTripleChecker+Invalid, 1170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 17:22:43,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 1609 Invalid, 1170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 17:22:43,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2022-12-13 17:22:43,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 908. [2022-12-13 17:22:43,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 655 states have (on average 1.4290076335877862) internal successors, (936), 766 states have internal predecessors, (936), 73 states have call successors, (73), 50 states have call predecessors, (73), 77 states have return successors, (296), 91 states have call predecessors, (296), 73 states have call successors, (296) [2022-12-13 17:22:43,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1305 transitions. [2022-12-13 17:22:43,015 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1305 transitions. Word has length 55 [2022-12-13 17:22:43,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:22:43,016 INFO L495 AbstractCegarLoop]: Abstraction has 908 states and 1305 transitions. [2022-12-13 17:22:43,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 17:22:43,016 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1305 transitions. [2022-12-13 17:22:43,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-13 17:22:43,016 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:22:43,016 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, 1, 1, 1] [2022-12-13 17:22:43,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-13 17:22:43,016 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ASStopErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-12-13 17:22:43,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:22:43,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1465302153, now seen corresponding path program 1 times [2022-12-13 17:22:43,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:22:43,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618953812] [2022-12-13 17:22:43,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:22:43,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:22:43,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:43,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:22:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:43,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 17:22:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:43,188 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:22:43,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:22:43,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618953812] [2022-12-13 17:22:43,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618953812] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:22:43,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:22:43,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 17:22:43,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199417548] [2022-12-13 17:22:43,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:22:43,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 17:22:43,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:22:43,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 17:22:43,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 17:22:43,189 INFO L87 Difference]: Start difference. First operand 908 states and 1305 transitions. Second operand has 9 states, 8 states have (on average 5.75) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 17:22:43,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:22:43,795 INFO L93 Difference]: Finished difference Result 1018 states and 1509 transitions. [2022-12-13 17:22:43,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 17:22:43,796 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (7), 5 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 55 [2022-12-13 17:22:43,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:22:43,802 INFO L225 Difference]: With dead ends: 1018 [2022-12-13 17:22:43,802 INFO L226 Difference]: Without dead ends: 1018 [2022-12-13 17:22:43,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-12-13 17:22:43,803 INFO L413 NwaCegarLoop]: 350 mSDtfsCounter, 441 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 1647 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 17:22:43,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 1647 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1005 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 17:22:43,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2022-12-13 17:22:43,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 969. [2022-12-13 17:22:43,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 705 states have (on average 1.4184397163120568) internal successors, (1000), 818 states have internal predecessors, (1000), 77 states have call successors, (77), 53 states have call predecessors, (77), 84 states have return successors, (325), 97 states have call predecessors, (325), 77 states have call successors, (325) [2022-12-13 17:22:43,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1402 transitions. [2022-12-13 17:22:43,820 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1402 transitions. Word has length 55 [2022-12-13 17:22:43,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:22:43,821 INFO L495 AbstractCegarLoop]: Abstraction has 969 states and 1402 transitions. [2022-12-13 17:22:43,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 17:22:43,821 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1402 transitions. [2022-12-13 17:22:43,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 17:22:43,821 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:22:43,821 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, 1, 1, 1, 1, 1, 1] [2022-12-13 17:22:43,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-13 17:22:43,821 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ASIdleErr12ASSERT_VIOLATIONMEMORY_LEAK === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-12-13 17:22:43,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:22:43,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1991628466, now seen corresponding path program 1 times [2022-12-13 17:22:43,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:22:43,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557946852] [2022-12-13 17:22:43,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:22:43,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:22:43,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:44,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:22:44,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:44,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 17:22:44,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:44,133 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:22:44,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:22:44,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557946852] [2022-12-13 17:22:44,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557946852] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:22:44,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:22:44,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 17:22:44,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092210899] [2022-12-13 17:22:44,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:22:44,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 17:22:44,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:22:44,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 17:22:44,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-12-13 17:22:44,134 INFO L87 Difference]: Start difference. First operand 969 states and 1402 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 11 states have internal predecessors, (49), 4 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 17:22:45,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:22:45,226 INFO L93 Difference]: Finished difference Result 1512 states and 2477 transitions. [2022-12-13 17:22:45,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 17:22:45,226 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 11 states have internal predecessors, (49), 4 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 58 [2022-12-13 17:22:45,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:22:45,234 INFO L225 Difference]: With dead ends: 1512 [2022-12-13 17:22:45,234 INFO L226 Difference]: Without dead ends: 1510 [2022-12-13 17:22:45,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2022-12-13 17:22:45,235 INFO L413 NwaCegarLoop]: 388 mSDtfsCounter, 581 mSDsluCounter, 2715 mSDsCounter, 0 mSdLazyCounter, 1642 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 3103 SdHoareTripleChecker+Invalid, 1799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-13 17:22:45,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 3103 Invalid, 1799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1642 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-13 17:22:45,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2022-12-13 17:22:45,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1323. [2022-12-13 17:22:45,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1323 states, 983 states have (on average 1.365208545269583) internal successors, (1342), 1093 states have internal predecessors, (1342), 101 states have call successors, (101), 71 states have call predecessors, (101), 136 states have return successors, (637), 158 states have call predecessors, (637), 101 states have call successors, (637) [2022-12-13 17:22:45,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1323 states and 2080 transitions. [2022-12-13 17:22:45,268 INFO L78 Accepts]: Start accepts. Automaton has 1323 states and 2080 transitions. Word has length 58 [2022-12-13 17:22:45,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:22:45,268 INFO L495 AbstractCegarLoop]: Abstraction has 1323 states and 2080 transitions. [2022-12-13 17:22:45,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 11 states have internal predecessors, (49), 4 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 17:22:45,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 2080 transitions. [2022-12-13 17:22:45,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-12-13 17:22:45,269 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:22:45,269 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:22:45,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-13 17:22:45,270 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-12-13 17:22:45,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:22:45,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1101885584, now seen corresponding path program 1 times [2022-12-13 17:22:45,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:22:45,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115926899] [2022-12-13 17:22:45,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:22:45,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:22:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:46,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:22:46,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:46,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 17:22:46,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:46,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-12-13 17:22:46,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:46,110 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 17:22:46,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:22:46,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115926899] [2022-12-13 17:22:46,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115926899] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:22:46,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065460897] [2022-12-13 17:22:46,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:22:46,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:22:46,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef60e33f-af2a-4c49-8954-dacd09833824/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:22:46,111 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef60e33f-af2a-4c49-8954-dacd09833824/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:22:46,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef60e33f-af2a-4c49-8954-dacd09833824/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 17:22:46,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:46,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 95 conjunts are in the unsatisfiable core [2022-12-13 17:22:46,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:22:46,302 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 17:22:46,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-12-13 17:22:46,404 INFO L350 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 13 treesize of output 9 [2022-12-13 17:22:46,428 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2022-12-13 17:22:46,469 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 17:22:46,469 INFO L350 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 77 treesize of output 72 [2022-12-13 17:22:46,475 INFO L350 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 31 treesize of output 21 [2022-12-13 17:22:46,478 INFO L350 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 36 [2022-12-13 17:22:46,514 INFO L350 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 54 treesize of output 41 [2022-12-13 17:22:46,519 INFO L350 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 28 treesize of output 30 [2022-12-13 17:22:46,524 INFO L350 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 33 treesize of output 32 [2022-12-13 17:22:46,541 INFO L350 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 56 treesize of output 43 [2022-12-13 17:22:46,548 INFO L350 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 35 treesize of output 34 [2022-12-13 17:22:46,551 INFO L350 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 28 treesize of output 30 [2022-12-13 17:22:46,572 INFO L350 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 35 treesize of output 34 [2022-12-13 17:22:46,577 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 43 [2022-12-13 17:22:46,582 INFO L350 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 28 treesize of output 30 [2022-12-13 17:22:46,605 INFO L321 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-12-13 17:22:46,605 INFO L350 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 22 treesize of output 24 [2022-12-13 17:22:46,641 INFO L350 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 46 [2022-12-13 17:22:46,646 INFO L350 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 28 treesize of output 30 [2022-12-13 17:22:46,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-12-13 17:22:46,821 INFO L350 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 32 treesize of output 20 [2022-12-13 17:22:46,824 INFO L350 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 15 treesize of output 9 [2022-12-13 17:22:46,826 INFO L350 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 9 treesize of output 3 [2022-12-13 17:22:46,849 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2213 Int)) (= (store |c_old(#memory_$Pointer$.base)| c_~user~0.base (store (select |c_old(#memory_$Pointer$.base)| c_~user~0.base) c_~user~0.offset v_ArrVal_2213)) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2214 Int)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| c_~user~0.base (store (select |c_old(#memory_$Pointer$.offset)| c_~user~0.base) c_~user~0.offset v_ArrVal_2214)))) (exists ((v_ArrVal_2212 (Array Int Int))) (= (store |c_old(#memory_int)| c_~user~0.base v_ArrVal_2212) |c_#memory_int|))) is different from true [2022-12-13 17:22:46,868 INFO L350 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 33 treesize of output 32 [2022-12-13 17:22:46,872 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2022-12-13 17:22:46,876 INFO L350 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 28 treesize of output 30 [2022-12-13 17:22:46,898 INFO L350 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 41 treesize of output 23 [2022-12-13 17:22:46,901 INFO L350 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 25 treesize of output 13 [2022-12-13 17:22:46,906 INFO L350 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 19 treesize of output 7 [2022-12-13 17:22:46,908 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:22:46,909 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:22:46,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065460897] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:22:46,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 17:22:46,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [17] total 28 [2022-12-13 17:22:46,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355142343] [2022-12-13 17:22:46,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:22:46,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 17:22:46,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:22:46,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 17:22:46,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=611, Unknown=1, NotChecked=50, Total=756 [2022-12-13 17:22:46,910 INFO L87 Difference]: Start difference. First operand 1323 states and 2080 transitions. Second operand has 16 states, 16 states have (on average 3.125) internal successors, (50), 14 states have internal predecessors, (50), 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) [2022-12-13 17:22:48,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:22:48,859 INFO L93 Difference]: Finished difference Result 2268 states and 3610 transitions. [2022-12-13 17:22:48,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 17:22:48,859 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 14 states have internal predecessors, (50), 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 61 [2022-12-13 17:22:48,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:22:48,873 INFO L225 Difference]: With dead ends: 2268 [2022-12-13 17:22:48,873 INFO L226 Difference]: Without dead ends: 2264 [2022-12-13 17:22:48,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=247, Invalid=1459, Unknown=20, NotChecked=80, Total=1806 [2022-12-13 17:22:48,874 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 665 mSDsluCounter, 2288 mSDsCounter, 0 mSdLazyCounter, 2662 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 2541 SdHoareTripleChecker+Invalid, 3617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 2662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 826 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-13 17:22:48,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 2541 Invalid, 3617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 2662 Invalid, 0 Unknown, 826 Unchecked, 1.5s Time] [2022-12-13 17:22:48,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states. [2022-12-13 17:22:48,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 2038. [2022-12-13 17:22:48,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2038 states, 1572 states have (on average 1.3797709923664123) internal successors, (2169), 1688 states have internal predecessors, (2169), 156 states have call successors, (156), 111 states have call predecessors, (156), 207 states have return successors, (1097), 238 states have call predecessors, (1097), 156 states have call successors, (1097) [2022-12-13 17:22:48,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2038 states to 2038 states and 3422 transitions. [2022-12-13 17:22:48,920 INFO L78 Accepts]: Start accepts. Automaton has 2038 states and 3422 transitions. Word has length 61 [2022-12-13 17:22:48,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:22:48,921 INFO L495 AbstractCegarLoop]: Abstraction has 2038 states and 3422 transitions. [2022-12-13 17:22:48,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 14 states have internal predecessors, (50), 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) [2022-12-13 17:22:48,921 INFO L276 IsEmpty]: Start isEmpty. Operand 2038 states and 3422 transitions. [2022-12-13 17:22:48,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-12-13 17:22:48,922 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:22:48,922 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:22:48,927 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef60e33f-af2a-4c49-8954-dacd09833824/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 17:22:49,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef60e33f-af2a-4c49-8954-dacd09833824/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-13 17:22:49,123 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-12-13 17:22:49,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:22:49,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1221568528, now seen corresponding path program 1 times [2022-12-13 17:22:49,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:22:49,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822672548] [2022-12-13 17:22:49,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:22:49,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:22:49,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:49,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:22:49,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:49,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 17:22:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:49,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-12-13 17:22:49,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:49,478 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 17:22:49,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:22:49,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822672548] [2022-12-13 17:22:49,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822672548] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:22:49,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:22:49,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 17:22:49,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341807267] [2022-12-13 17:22:49,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:22:49,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 17:22:49,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:22:49,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 17:22:49,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 17:22:49,479 INFO L87 Difference]: Start difference. First operand 2038 states and 3422 transitions. Second operand has 11 states, 10 states have (on average 4.8) internal successors, (48), 7 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 17:22:50,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:22:50,019 INFO L93 Difference]: Finished difference Result 2402 states and 4137 transitions. [2022-12-13 17:22:50,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 17:22:50,019 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 7 states have internal predecessors, (48), 4 states have call successors, (8), 5 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 61 [2022-12-13 17:22:50,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:22:50,033 INFO L225 Difference]: With dead ends: 2402 [2022-12-13 17:22:50,033 INFO L226 Difference]: Without dead ends: 2402 [2022-12-13 17:22:50,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2022-12-13 17:22:50,033 INFO L413 NwaCegarLoop]: 361 mSDtfsCounter, 223 mSDsluCounter, 2402 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 2763 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 17:22:50,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 2763 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1005 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 17:22:50,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2402 states. [2022-12-13 17:22:50,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2402 to 2345. [2022-12-13 17:22:50,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2345 states, 1816 states have (on average 1.3562775330396475) internal successors, (2463), 1943 states have internal predecessors, (2463), 180 states have call successors, (180), 124 states have call predecessors, (180), 246 states have return successors, (1380), 277 states have call predecessors, (1380), 180 states have call successors, (1380) [2022-12-13 17:22:50,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2345 states to 2345 states and 4023 transitions. [2022-12-13 17:22:50,077 INFO L78 Accepts]: Start accepts. Automaton has 2345 states and 4023 transitions. Word has length 61 [2022-12-13 17:22:50,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:22:50,077 INFO L495 AbstractCegarLoop]: Abstraction has 2345 states and 4023 transitions. [2022-12-13 17:22:50,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 7 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 17:22:50,077 INFO L276 IsEmpty]: Start isEmpty. Operand 2345 states and 4023 transitions. [2022-12-13 17:22:50,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-12-13 17:22:50,078 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:22:50,078 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:22:50,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-13 17:22:50,078 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ASStartErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-12-13 17:22:50,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:22:50,078 INFO L85 PathProgramCache]: Analyzing trace with hash 509480719, now seen corresponding path program 1 times [2022-12-13 17:22:50,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:22:50,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861966953] [2022-12-13 17:22:50,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:22:50,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:22:50,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:50,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:22:50,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:50,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 17:22:50,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:50,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 17:22:50,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:50,151 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 17:22:50,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:22:50,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861966953] [2022-12-13 17:22:50,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861966953] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:22:50,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:22:50,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 17:22:50,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665849703] [2022-12-13 17:22:50,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:22:50,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 17:22:50,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:22:50,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 17:22:50,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:22:50,152 INFO L87 Difference]: Start difference. First operand 2345 states and 4023 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 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) [2022-12-13 17:22:50,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:22:50,472 INFO L93 Difference]: Finished difference Result 2353 states and 4030 transitions. [2022-12-13 17:22:50,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 17:22:50,472 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 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 62 [2022-12-13 17:22:50,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:22:50,480 INFO L225 Difference]: With dead ends: 2353 [2022-12-13 17:22:50,480 INFO L226 Difference]: Without dead ends: 2353 [2022-12-13 17:22:50,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:22:50,480 INFO L413 NwaCegarLoop]: 333 mSDtfsCounter, 172 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 17:22:50,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 1068 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 17:22:50,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2022-12-13 17:22:50,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 2343. [2022-12-13 17:22:50,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2343 states, 1816 states have (on average 1.3540748898678414) internal successors, (2459), 1941 states have internal predecessors, (2459), 180 states have call successors, (180), 124 states have call predecessors, (180), 246 states have return successors, (1380), 277 states have call predecessors, (1380), 180 states have call successors, (1380) [2022-12-13 17:22:50,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2343 states and 4019 transitions. [2022-12-13 17:22:50,526 INFO L78 Accepts]: Start accepts. Automaton has 2343 states and 4019 transitions. Word has length 62 [2022-12-13 17:22:50,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:22:50,527 INFO L495 AbstractCegarLoop]: Abstraction has 2343 states and 4019 transitions. [2022-12-13 17:22:50,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 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) [2022-12-13 17:22:50,527 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 4019 transitions. [2022-12-13 17:22:50,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-12-13 17:22:50,527 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:22:50,527 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:22:50,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-13 17:22:50,527 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ASStartErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-12-13 17:22:50,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:22:50,527 INFO L85 PathProgramCache]: Analyzing trace with hash 509480720, now seen corresponding path program 1 times [2022-12-13 17:22:50,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:22:50,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681224552] [2022-12-13 17:22:50,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:22:50,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:22:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:22:50,555 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:22:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:22:50,593 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:22:50,594 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 17:22:50,594 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ASStartErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (161 of 162 remaining) [2022-12-13 17:22:50,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (160 of 162 remaining) [2022-12-13 17:22:50,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (159 of 162 remaining) [2022-12-13 17:22:50,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (158 of 162 remaining) [2022-12-13 17:22:50,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (157 of 162 remaining) [2022-12-13 17:22:50,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (156 of 162 remaining) [2022-12-13 17:22:50,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (155 of 162 remaining) [2022-12-13 17:22:50,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (154 of 162 remaining) [2022-12-13 17:22:50,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (153 of 162 remaining) [2022-12-13 17:22:50,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (152 of 162 remaining) [2022-12-13 17:22:50,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (151 of 162 remaining) [2022-12-13 17:22:50,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (150 of 162 remaining) [2022-12-13 17:22:50,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (149 of 162 remaining) [2022-12-13 17:22:50,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (148 of 162 remaining) [2022-12-13 17:22:50,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (147 of 162 remaining) [2022-12-13 17:22:50,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (146 of 162 remaining) [2022-12-13 17:22:50,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (145 of 162 remaining) [2022-12-13 17:22:50,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (144 of 162 remaining) [2022-12-13 17:22:50,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (143 of 162 remaining) [2022-12-13 17:22:50,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (142 of 162 remaining) [2022-12-13 17:22:50,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (141 of 162 remaining) [2022-12-13 17:22:50,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (140 of 162 remaining) [2022-12-13 17:22:50,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (139 of 162 remaining) [2022-12-13 17:22:50,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (138 of 162 remaining) [2022-12-13 17:22:50,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (137 of 162 remaining) [2022-12-13 17:22:50,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (136 of 162 remaining) [2022-12-13 17:22:50,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (135 of 162 remaining) [2022-12-13 17:22:50,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (134 of 162 remaining) [2022-12-13 17:22:50,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (133 of 162 remaining) [2022-12-13 17:22:50,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (132 of 162 remaining) [2022-12-13 17:22:50,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (131 of 162 remaining) [2022-12-13 17:22:50,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (130 of 162 remaining) [2022-12-13 17:22:50,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (129 of 162 remaining) [2022-12-13 17:22:50,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (128 of 162 remaining) [2022-12-13 17:22:50,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (127 of 162 remaining) [2022-12-13 17:22:50,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (126 of 162 remaining) [2022-12-13 17:22:50,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (125 of 162 remaining) [2022-12-13 17:22:50,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (124 of 162 remaining) [2022-12-13 17:22:50,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (123 of 162 remaining) [2022-12-13 17:22:50,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (122 of 162 remaining) [2022-12-13 17:22:50,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (121 of 162 remaining) [2022-12-13 17:22:50,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (120 of 162 remaining) [2022-12-13 17:22:50,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (119 of 162 remaining) [2022-12-13 17:22:50,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (118 of 162 remaining) [2022-12-13 17:22:50,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (117 of 162 remaining) [2022-12-13 17:22:50,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (116 of 162 remaining) [2022-12-13 17:22:50,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (115 of 162 remaining) [2022-12-13 17:22:50,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (114 of 162 remaining) [2022-12-13 17:22:50,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (113 of 162 remaining) [2022-12-13 17:22:50,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (112 of 162 remaining) [2022-12-13 17:22:50,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (111 of 162 remaining) [2022-12-13 17:22:50,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (110 of 162 remaining) [2022-12-13 17:22:50,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (109 of 162 remaining) [2022-12-13 17:22:50,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (108 of 162 remaining) [2022-12-13 17:22:50,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (107 of 162 remaining) [2022-12-13 17:22:50,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 162 remaining) [2022-12-13 17:22:50,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 162 remaining) [2022-12-13 17:22:50,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 162 remaining) [2022-12-13 17:22:50,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 162 remaining) [2022-12-13 17:22:50,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 162 remaining) [2022-12-13 17:22:50,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 162 remaining) [2022-12-13 17:22:50,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 162 remaining) [2022-12-13 17:22:50,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 162 remaining) [2022-12-13 17:22:50,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 162 remaining) [2022-12-13 17:22:50,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 162 remaining) [2022-12-13 17:22:50,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 162 remaining) [2022-12-13 17:22:50,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 162 remaining) [2022-12-13 17:22:50,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 162 remaining) [2022-12-13 17:22:50,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 162 remaining) [2022-12-13 17:22:50,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 162 remaining) [2022-12-13 17:22:50,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 162 remaining) [2022-12-13 17:22:50,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 162 remaining) [2022-12-13 17:22:50,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 162 remaining) [2022-12-13 17:22:50,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 162 remaining) [2022-12-13 17:22:50,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 162 remaining) [2022-12-13 17:22:50,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 162 remaining) [2022-12-13 17:22:50,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 162 remaining) [2022-12-13 17:22:50,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 162 remaining) [2022-12-13 17:22:50,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 162 remaining) [2022-12-13 17:22:50,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 162 remaining) [2022-12-13 17:22:50,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 162 remaining) [2022-12-13 17:22:50,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 162 remaining) [2022-12-13 17:22:50,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 162 remaining) [2022-12-13 17:22:50,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 162 remaining) [2022-12-13 17:22:50,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 162 remaining) [2022-12-13 17:22:50,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 162 remaining) [2022-12-13 17:22:50,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 162 remaining) [2022-12-13 17:22:50,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 162 remaining) [2022-12-13 17:22:50,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 162 remaining) [2022-12-13 17:22:50,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 162 remaining) [2022-12-13 17:22:50,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 162 remaining) [2022-12-13 17:22:50,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 162 remaining) [2022-12-13 17:22:50,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 162 remaining) [2022-12-13 17:22:50,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 162 remaining) [2022-12-13 17:22:50,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 162 remaining) [2022-12-13 17:22:50,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 162 remaining) [2022-12-13 17:22:50,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 162 remaining) [2022-12-13 17:22:50,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 162 remaining) [2022-12-13 17:22:50,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 162 remaining) [2022-12-13 17:22:50,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 162 remaining) [2022-12-13 17:22:50,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 162 remaining) [2022-12-13 17:22:50,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 162 remaining) [2022-12-13 17:22:50,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 162 remaining) [2022-12-13 17:22:50,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 162 remaining) [2022-12-13 17:22:50,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 162 remaining) [2022-12-13 17:22:50,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 162 remaining) [2022-12-13 17:22:50,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 162 remaining) [2022-12-13 17:22:50,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 162 remaining) [2022-12-13 17:22:50,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 162 remaining) [2022-12-13 17:22:50,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 162 remaining) [2022-12-13 17:22:50,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 162 remaining) [2022-12-13 17:22:50,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 162 remaining) [2022-12-13 17:22:50,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 162 remaining) [2022-12-13 17:22:50,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 162 remaining) [2022-12-13 17:22:50,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 162 remaining) [2022-12-13 17:22:50,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 162 remaining) [2022-12-13 17:22:50,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 162 remaining) [2022-12-13 17:22:50,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 162 remaining) [2022-12-13 17:22:50,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 162 remaining) [2022-12-13 17:22:50,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 162 remaining) [2022-12-13 17:22:50,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 162 remaining) [2022-12-13 17:22:50,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 162 remaining) [2022-12-13 17:22:50,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 162 remaining) [2022-12-13 17:22:50,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 162 remaining) [2022-12-13 17:22:50,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 162 remaining) [2022-12-13 17:22:50,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 162 remaining) [2022-12-13 17:22:50,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 162 remaining) [2022-12-13 17:22:50,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 162 remaining) [2022-12-13 17:22:50,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 162 remaining) [2022-12-13 17:22:50,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 162 remaining) [2022-12-13 17:22:50,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 162 remaining) [2022-12-13 17:22:50,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASNullErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 162 remaining) [2022-12-13 17:22:50,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 162 remaining) [2022-12-13 17:22:50,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 162 remaining) [2022-12-13 17:22:50,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 162 remaining) [2022-12-13 17:22:50,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 162 remaining) [2022-12-13 17:22:50,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 162 remaining) [2022-12-13 17:22:50,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 162 remaining) [2022-12-13 17:22:50,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 162 remaining) [2022-12-13 17:22:50,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 162 remaining) [2022-12-13 17:22:50,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 162 remaining) [2022-12-13 17:22:50,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 162 remaining) [2022-12-13 17:22:50,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 162 remaining) [2022-12-13 17:22:50,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 162 remaining) [2022-12-13 17:22:50,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr12ASSERT_VIOLATIONMEMORY_LEAK (17 of 162 remaining) [2022-12-13 17:22:50,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 162 remaining) [2022-12-13 17:22:50,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 162 remaining) [2022-12-13 17:22:50,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 162 remaining) [2022-12-13 17:22:50,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 162 remaining) [2022-12-13 17:22:50,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 162 remaining) [2022-12-13 17:22:50,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 162 remaining) [2022-12-13 17:22:50,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 162 remaining) [2022-12-13 17:22:50,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 162 remaining) [2022-12-13 17:22:50,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 162 remaining) [2022-12-13 17:22:50,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 162 remaining) [2022-12-13 17:22:50,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 162 remaining) [2022-12-13 17:22:50,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 162 remaining) [2022-12-13 17:22:50,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 162 remaining) [2022-12-13 17:22:50,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 162 remaining) [2022-12-13 17:22:50,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 162 remaining) [2022-12-13 17:22:50,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 162 remaining) [2022-12-13 17:22:50,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (0 of 162 remaining) [2022-12-13 17:22:50,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-13 17:22:50,608 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:22:50,612 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 17:22:50,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 05:22:50 BoogieIcfgContainer [2022-12-13 17:22:50,638 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 17:22:50,638 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 17:22:50,638 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 17:22:50,639 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 17:22:50,639 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:22:15" (3/4) ... [2022-12-13 17:22:50,640 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 17:22:50,674 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef60e33f-af2a-4c49-8954-dacd09833824/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 17:22:50,674 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 17:22:50,674 INFO L158 Benchmark]: Toolchain (without parser) took 36616.06ms. Allocated memory was 138.4MB in the beginning and 205.5MB in the end (delta: 67.1MB). Free memory was 100.1MB in the beginning and 65.0MB in the end (delta: 35.1MB). Peak memory consumption was 103.6MB. Max. memory is 16.1GB. [2022-12-13 17:22:50,674 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 138.4MB. Free memory is still 105.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 17:22:50,675 INFO L158 Benchmark]: CACSL2BoogieTranslator took 423.67ms. Allocated memory is still 138.4MB. Free memory was 99.7MB in the beginning and 74.2MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-12-13 17:22:50,675 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.11ms. Allocated memory is still 138.4MB. Free memory was 74.2MB in the beginning and 71.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 17:22:50,675 INFO L158 Benchmark]: Boogie Preprocessor took 54.09ms. Allocated memory is still 138.4MB. Free memory was 71.1MB in the beginning and 67.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 17:22:50,675 INFO L158 Benchmark]: RCFGBuilder took 813.15ms. Allocated memory was 138.4MB in the beginning and 169.9MB in the end (delta: 31.5MB). Free memory was 67.9MB in the beginning and 95.0MB in the end (delta: -27.1MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2022-12-13 17:22:50,675 INFO L158 Benchmark]: TraceAbstraction took 35234.56ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 94.1MB in the beginning and 68.2MB in the end (delta: 26.0MB). Peak memory consumption was 61.2MB. Max. memory is 16.1GB. [2022-12-13 17:22:50,675 INFO L158 Benchmark]: Witness Printer took 35.52ms. Allocated memory is still 205.5MB. Free memory was 68.2MB in the beginning and 65.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 17:22:50,676 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 138.4MB. Free memory is still 105.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 423.67ms. Allocated memory is still 138.4MB. Free memory was 99.7MB in the beginning and 74.2MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.11ms. Allocated memory is still 138.4MB. Free memory was 74.2MB in the beginning and 71.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.09ms. Allocated memory is still 138.4MB. Free memory was 71.1MB in the beginning and 67.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 813.15ms. Allocated memory was 138.4MB in the beginning and 169.9MB in the end (delta: 31.5MB). Free memory was 67.9MB in the beginning and 95.0MB in the end (delta: -27.1MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. * TraceAbstraction took 35234.56ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 94.1MB in the beginning and 68.2MB in the end (delta: 26.0MB). Peak memory consumption was 61.2MB. Max. memory is 16.1GB. * Witness Printer took 35.52ms. Allocated memory is still 205.5MB. Free memory was 68.2MB in the beginning and 65.0MB in the end (delta: 3.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 The program execution was not completely translated back. - 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; VAL [user={0:0}] [L975] user = malloc(sizeof(user_t)) [L976] CALL user_initialize() [L966] EXPR, FCALL calloc(1, sizeof(info_t)) VAL [calloc(1, sizeof(info_t))={7:0}, user={-1:0}] [L966] user->info = calloc(1, sizeof(info_t)) VAL [calloc(1, sizeof(info_t))={7:0}, user={-1:0}] [L967] user->message.id = 11 VAL [calloc(1, sizeof(info_t))={7:0}, user={-1:0}] [L968] EXPR user->info VAL [calloc(1, sizeof(info_t))={7:0}, user={-1:0}, user->info={7:0}] [L968] user->info->is_valid = 0 VAL [calloc(1, sizeof(info_t))={7:0}, user={-1:0}, user->info={7:0}] [L969] user->status = AS_NULL VAL [calloc(1, sizeof(info_t))={7:0}, user={-1:0}] [L970] user->user_id = 11 VAL [calloc(1, sizeof(info_t))={7:0}, user={-1:0}] [L971] user->timeout = 3 VAL [calloc(1, sizeof(info_t))={7:0}, user={-1:0}] [L976] RET user_initialize() [L977] event_t e = {0}; VAL [\old(argc)=95, argc=95, argv={90:84}, argv={90:84}, e={10:0}, user={-1:0}] [L978] e.primitive = _EVENT_START VAL [\old(argc)=95, argc=95, argv={90:84}, argv={90:84}, e={10:0}, user={-1:0}] [L979] CALL event_precess(&e) VAL [e={10:0}, user={-1:0}] [L943] EXPR user->status VAL [e={10:0}, e={10:0}, user={-1:0}, user->status=1] [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 VAL [e={10:0}, e={10:0}, e->primitive=0, user={-1:0}] [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}, user->status=1] [L815] COND TRUE user->status != status [L816] user->status = status VAL [\old(status)=2, status=2, user={-1:0}] [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, status_update(AS_START)=10, 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}, user->info={7:0}] [L830] EXPR user->info->is_valid VAL [e={9:0}, user={-1:0}, user->info={7:0}, user->info->is_valid=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 VAL [e={9:0}, e={9:0}, user={-1:0}, user->status=2] [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 VAL [e={9:0}, e={9:0}, e->primitive=3, user={-1:0}] [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 [calloc(0, sizeof(*message))={-2:0}, e={9:0}, e={9:0}, message={-1:16}, primitive=3, rc=-1, user={-1:0}] [L900] message = calloc(0, sizeof(*message)) VAL [calloc(0, sizeof(*message))={-2:0}, 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: 930]: 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, 401 locations, 162 error locations. Started 1 CEGAR loops. OverallTime: 35.2s, OverallIterations: 41, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 24.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14441 SdHoareTripleChecker+Valid, 20.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14412 mSDsluCounter, 62549 SdHoareTripleChecker+Invalid, 17.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 826 IncrementalHoareTripleChecker+Unchecked, 49090 mSDsCounter, 3789 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37973 IncrementalHoareTripleChecker+Invalid, 42588 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3789 mSolverCounterUnsat, 13459 mSDtfsCounter, 37973 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 808 GetRequests, 273 SyntacticMatches, 1 SemanticMatches, 534 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1423 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2345occurred in iteration=39, InterpolantAutomatonStates: 452, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 40 MinimizatonAttempts, 2270 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 1611 NumberOfCodeBlocks, 1611 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 1507 ConstructedInterpolants, 6 QuantifiedInterpolants, 8342 SizeOfPredicates, 29 NumberOfNonLiveVariables, 928 ConjunctsInSsa, 120 ConjunctsInUnsatCore, 42 InterpolantComputations, 40 PerfectInterpolantSequences, 93/97 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 17:22:50,692 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef60e33f-af2a-4c49-8954-dacd09833824/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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)