./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-circular-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a 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_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-circular-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc --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 5b2cf85bdf3ceca18f859bba09ed8bf6de8160130db2f8571365ac2bc4f0e30c --- 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-5e519f3 [2022-11-02 20:25:48,514 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:25:48,516 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:25:48,555 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:25:48,555 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:25:48,559 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:25:48,562 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:25:48,570 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:25:48,572 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:25:48,575 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:25:48,576 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:25:48,577 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:25:48,578 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:25:48,579 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:25:48,580 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:25:48,581 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:25:48,582 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:25:48,582 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:25:48,584 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:25:48,586 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:25:48,592 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:25:48,594 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:25:48,598 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:25:48,599 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:25:48,607 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:25:48,608 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:25:48,608 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:25:48,609 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:25:48,609 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:25:48,610 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:25:48,611 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:25:48,611 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:25:48,612 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:25:48,613 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:25:48,614 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:25:48,614 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:25:48,615 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:25:48,615 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:25:48,615 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:25:48,616 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:25:48,617 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:25:48,619 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-02 20:25:48,669 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:25:48,674 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:25:48,675 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:25:48,675 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:25:48,676 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:25:48,676 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:25:48,677 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:25:48,677 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:25:48,677 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:25:48,678 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:25:48,679 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:25:48,679 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:25:48,680 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:25:48,680 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:25:48,680 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:25:48,680 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 20:25:48,680 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 20:25:48,681 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-02 20:25:48,681 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:25:48,681 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 20:25:48,681 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:25:48,682 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:25:48,693 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:25:48,694 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:25:48,694 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:25:48,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:25:48,694 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:25:48,694 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:25:48,694 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:25:48,695 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:25:48,695 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/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_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc 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 -> 5b2cf85bdf3ceca18f859bba09ed8bf6de8160130db2f8571365ac2bc4f0e30c [2022-11-02 20:25:48,943 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:25:48,971 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:25:48,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:25:48,978 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:25:48,979 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:25:48,981 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/forester-heap/dll-circular-2.i [2022-11-02 20:25:49,047 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/data/5febfb160/8fe4063e2f234ea8b7da313a448f44ff/FLAGeb95114ce [2022-11-02 20:25:49,669 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:25:49,669 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/sv-benchmarks/c/forester-heap/dll-circular-2.i [2022-11-02 20:25:49,682 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/data/5febfb160/8fe4063e2f234ea8b7da313a448f44ff/FLAGeb95114ce [2022-11-02 20:25:49,950 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/data/5febfb160/8fe4063e2f234ea8b7da313a448f44ff [2022-11-02 20:25:49,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:25:49,954 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:25:49,955 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:25:49,956 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:25:49,962 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:25:49,963 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:25:49" (1/1) ... [2022-11-02 20:25:49,966 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fc7fa1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:25:49, skipping insertion in model container [2022-11-02 20:25:49,966 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:25:49" (1/1) ... [2022-11-02 20:25:49,973 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:25:50,040 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:25:50,444 WARN L230 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_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/sv-benchmarks/c/forester-heap/dll-circular-2.i[22391,22404] [2022-11-02 20:25:50,452 WARN L230 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_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/sv-benchmarks/c/forester-heap/dll-circular-2.i[22497,22510] [2022-11-02 20:25:50,459 WARN L230 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_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/sv-benchmarks/c/forester-heap/dll-circular-2.i[22622,22635] [2022-11-02 20:25:50,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:25:50,481 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:25:50,522 WARN L230 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_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/sv-benchmarks/c/forester-heap/dll-circular-2.i[22391,22404] [2022-11-02 20:25:50,524 WARN L230 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_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/sv-benchmarks/c/forester-heap/dll-circular-2.i[22497,22510] [2022-11-02 20:25:50,526 WARN L230 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_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/sv-benchmarks/c/forester-heap/dll-circular-2.i[22622,22635] [2022-11-02 20:25:50,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:25:50,553 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:25:50,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:25:50 WrapperNode [2022-11-02 20:25:50,554 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:25:50,555 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:25:50,555 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:25:50,555 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:25:50,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:25:50" (1/1) ... [2022-11-02 20:25:50,575 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:25:50" (1/1) ... [2022-11-02 20:25:50,597 INFO L138 Inliner]: procedures = 119, calls = 31, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 123 [2022-11-02 20:25:50,597 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:25:50,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:25:50,598 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:25:50,598 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:25:50,607 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:25:50" (1/1) ... [2022-11-02 20:25:50,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:25:50" (1/1) ... [2022-11-02 20:25:50,612 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:25:50" (1/1) ... [2022-11-02 20:25:50,626 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:25:50" (1/1) ... [2022-11-02 20:25:50,640 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:25:50" (1/1) ... [2022-11-02 20:25:50,644 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:25:50" (1/1) ... [2022-11-02 20:25:50,646 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:25:50" (1/1) ... [2022-11-02 20:25:50,647 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:25:50" (1/1) ... [2022-11-02 20:25:50,650 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:25:50,651 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:25:50,651 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:25:50,651 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:25:50,652 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:25:50" (1/1) ... [2022-11-02 20:25:50,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:25:50,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:25:50,687 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:25:50,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:25:50,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:25:50,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:25:50,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:25:50,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:25:50,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:25:50,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:25:50,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:25:50,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:25:50,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:25:50,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:25:50,837 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:25:50,839 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:25:51,209 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:25:51,216 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:25:51,216 INFO L300 CfgBuilder]: Removed 9 assume(true) statements. [2022-11-02 20:25:51,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:25:51 BoogieIcfgContainer [2022-11-02 20:25:51,219 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:25:51,221 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:25:51,221 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:25:51,225 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:25:51,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:25:49" (1/3) ... [2022-11-02 20:25:51,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a3cd9a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:25:51, skipping insertion in model container [2022-11-02 20:25:51,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:25:50" (2/3) ... [2022-11-02 20:25:51,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a3cd9a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:25:51, skipping insertion in model container [2022-11-02 20:25:51,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:25:51" (3/3) ... [2022-11-02 20:25:51,229 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-circular-2.i [2022-11-02 20:25:51,248 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:25:51,249 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2022-11-02 20:25:51,314 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:25:51,321 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@64c53d0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:25:51,321 INFO L358 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2022-11-02 20:25:51,326 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 59 states have (on average 2.2033898305084745) internal successors, (130), 111 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:51,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:25:51,332 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:51,332 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:25:51,333 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:25:51,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:51,339 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-11-02 20:25:51,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:51,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491737142] [2022-11-02 20:25:51,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:51,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:51,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:51,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:25:51,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:51,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491737142] [2022-11-02 20:25:51,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491737142] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:51,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:51,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:25:51,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848717825] [2022-11-02 20:25:51,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:51,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:25:51,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:51,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:25:51,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:25:51,746 INFO L87 Difference]: Start difference. First operand has 112 states, 59 states have (on average 2.2033898305084745) internal successors, (130), 111 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:51,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:51,900 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2022-11-02 20:25:51,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:25:51,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-02 20:25:51,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:51,912 INFO L225 Difference]: With dead ends: 117 [2022-11-02 20:25:51,912 INFO L226 Difference]: Without dead ends: 115 [2022-11-02 20:25:51,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:25:51,918 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 95 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:51,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 80 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:25:51,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-02 20:25:51,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 105. [2022-11-02 20:25:51,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 58 states have (on average 1.9137931034482758) internal successors, (111), 104 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:51,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2022-11-02 20:25:51,960 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 3 [2022-11-02 20:25:51,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:51,961 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2022-11-02 20:25:51,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:51,961 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2022-11-02 20:25:51,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:25:51,961 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:51,961 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:25:51,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:25:51,962 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:25:51,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:51,963 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-11-02 20:25:51,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:51,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430715579] [2022-11-02 20:25:51,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:51,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:51,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:52,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:25:52,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:52,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430715579] [2022-11-02 20:25:52,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430715579] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:52,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:52,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:25:52,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571504796] [2022-11-02 20:25:52,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:52,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:25:52,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:52,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:25:52,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:25:52,118 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:52,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:52,262 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2022-11-02 20:25:52,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:25:52,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-02 20:25:52,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:52,269 INFO L225 Difference]: With dead ends: 112 [2022-11-02 20:25:52,269 INFO L226 Difference]: Without dead ends: 112 [2022-11-02 20:25:52,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:25:52,273 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 92 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:52,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 80 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:25:52,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-02 20:25:52,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 100. [2022-11-02 20:25:52,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 58 states have (on average 1.8275862068965518) internal successors, (106), 99 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:52,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2022-11-02 20:25:52,287 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 3 [2022-11-02 20:25:52,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:52,288 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2022-11-02 20:25:52,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:52,288 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2022-11-02 20:25:52,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:25:52,289 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:52,289 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:52,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:25:52,290 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:25:52,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:52,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112040, now seen corresponding path program 1 times [2022-11-02 20:25:52,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:52,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630076596] [2022-11-02 20:25:52,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:52,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:52,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:25:52,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:52,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630076596] [2022-11-02 20:25:52,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630076596] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:52,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:52,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:25:52,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512289944] [2022-11-02 20:25:52,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:52,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:25:52,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:52,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:25:52,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:25:52,389 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:52,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:52,524 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2022-11-02 20:25:52,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:25:52,525 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-02 20:25:52,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:52,526 INFO L225 Difference]: With dead ends: 97 [2022-11-02 20:25:52,526 INFO L226 Difference]: Without dead ends: 97 [2022-11-02 20:25:52,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:25:52,528 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 149 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:52,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 54 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:25:52,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-02 20:25:52,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 88. [2022-11-02 20:25:52,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.6206896551724137) internal successors, (94), 87 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:52,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2022-11-02 20:25:52,536 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 9 [2022-11-02 20:25:52,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:52,537 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2022-11-02 20:25:52,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:52,538 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2022-11-02 20:25:52,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:25:52,538 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:52,538 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:52,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:25:52,539 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:25:52,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:52,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112041, now seen corresponding path program 1 times [2022-11-02 20:25:52,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:52,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087777607] [2022-11-02 20:25:52,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:52,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:52,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:25:52,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:52,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087777607] [2022-11-02 20:25:52,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087777607] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:52,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:52,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:25:52,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837693460] [2022-11-02 20:25:52,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:52,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:25:52,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:52,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:25:52,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:25:52,772 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:52,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:52,967 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2022-11-02 20:25:52,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:25:52,968 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-02 20:25:52,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:52,971 INFO L225 Difference]: With dead ends: 113 [2022-11-02 20:25:52,971 INFO L226 Difference]: Without dead ends: 113 [2022-11-02 20:25:52,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:25:52,983 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 103 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:52,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 101 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:25:52,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-11-02 20:25:52,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 97. [2022-11-02 20:25:52,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 67 states have (on average 1.5820895522388059) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:52,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2022-11-02 20:25:53,002 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 9 [2022-11-02 20:25:53,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:53,003 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2022-11-02 20:25:53,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:53,003 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2022-11-02 20:25:53,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:25:53,004 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:53,004 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:53,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:25:53,005 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:25:53,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:53,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413642, now seen corresponding path program 1 times [2022-11-02 20:25:53,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:53,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464384885] [2022-11-02 20:25:53,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:53,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:53,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:25:53,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:53,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464384885] [2022-11-02 20:25:53,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464384885] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:53,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:53,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:25:53,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094477893] [2022-11-02 20:25:53,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:53,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:25:53,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:53,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:25:53,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:25:53,272 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:53,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:53,447 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-11-02 20:25:53,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:25:53,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-02 20:25:53,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:53,448 INFO L225 Difference]: With dead ends: 96 [2022-11-02 20:25:53,449 INFO L226 Difference]: Without dead ends: 96 [2022-11-02 20:25:53,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-11-02 20:25:53,450 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 6 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:53,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 224 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:25:53,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-02 20:25:53,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-11-02 20:25:53,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 95 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:53,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2022-11-02 20:25:53,456 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 12 [2022-11-02 20:25:53,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:53,457 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2022-11-02 20:25:53,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:53,457 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2022-11-02 20:25:53,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:25:53,458 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:53,458 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:53,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:25:53,459 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:25:53,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:53,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413643, now seen corresponding path program 1 times [2022-11-02 20:25:53,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:53,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238534164] [2022-11-02 20:25:53,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:53,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:53,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:53,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:25:53,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:53,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238534164] [2022-11-02 20:25:53,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238534164] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:53,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:53,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:25:53,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216209724] [2022-11-02 20:25:53,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:53,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:25:53,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:53,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:25:53,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:25:53,585 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:53,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:53,736 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2022-11-02 20:25:53,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:25:53,737 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-02 20:25:53,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:53,738 INFO L225 Difference]: With dead ends: 95 [2022-11-02 20:25:53,738 INFO L226 Difference]: Without dead ends: 95 [2022-11-02 20:25:53,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-11-02 20:25:53,739 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 7 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:53,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 229 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:25:53,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-02 20:25:53,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-11-02 20:25:53,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 94 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:53,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2022-11-02 20:25:53,745 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 12 [2022-11-02 20:25:53,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:53,745 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2022-11-02 20:25:53,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:53,746 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2022-11-02 20:25:53,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 20:25:53,746 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:53,747 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:53,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:25:53,747 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:25:53,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:53,748 INFO L85 PathProgramCache]: Analyzing trace with hash 683852107, now seen corresponding path program 1 times [2022-11-02 20:25:53,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:53,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98293242] [2022-11-02 20:25:53,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:53,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:54,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:25:54,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:54,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98293242] [2022-11-02 20:25:54,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98293242] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:54,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:54,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:25:54,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055827831] [2022-11-02 20:25:54,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:54,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:25:54,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:54,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:25:54,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:25:54,007 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:54,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:54,291 INFO L93 Difference]: Finished difference Result 178 states and 189 transitions. [2022-11-02 20:25:54,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:25:54,292 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-02 20:25:54,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:54,292 INFO L225 Difference]: With dead ends: 178 [2022-11-02 20:25:54,293 INFO L226 Difference]: Without dead ends: 178 [2022-11-02 20:25:54,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:25:54,294 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 356 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:54,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 286 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:25:54,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-11-02 20:25:54,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 98. [2022-11-02 20:25:54,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.5) internal successors, (105), 97 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:54,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2022-11-02 20:25:54,298 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 13 [2022-11-02 20:25:54,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:54,304 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2022-11-02 20:25:54,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:54,305 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2022-11-02 20:25:54,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:25:54,305 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:54,306 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:54,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:25:54,306 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:25:54,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:54,307 INFO L85 PathProgramCache]: Analyzing trace with hash -275416990, now seen corresponding path program 1 times [2022-11-02 20:25:54,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:54,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769652000] [2022-11-02 20:25:54,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:54,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:54,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:54,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:25:54,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:54,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769652000] [2022-11-02 20:25:54,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769652000] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:54,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:54,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:25:54,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642476162] [2022-11-02 20:25:54,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:54,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:25:54,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:54,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:25:54,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:25:54,601 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:54,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:54,958 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2022-11-02 20:25:54,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:25:54,959 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-02 20:25:54,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:54,960 INFO L225 Difference]: With dead ends: 140 [2022-11-02 20:25:54,960 INFO L226 Difference]: Without dead ends: 140 [2022-11-02 20:25:54,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:25:54,961 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 314 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:54,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 210 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:25:54,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-11-02 20:25:54,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 100. [2022-11-02 20:25:54,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.5) internal successors, (108), 99 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:54,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2022-11-02 20:25:54,966 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 14 [2022-11-02 20:25:54,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:54,967 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2022-11-02 20:25:54,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:54,967 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2022-11-02 20:25:54,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:25:54,968 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:54,968 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:54,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:25:54,968 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:25:54,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:54,969 INFO L85 PathProgramCache]: Analyzing trace with hash -275416989, now seen corresponding path program 1 times [2022-11-02 20:25:54,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:54,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451962247] [2022-11-02 20:25:54,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:54,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:54,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:55,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:25:55,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:55,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451962247] [2022-11-02 20:25:55,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451962247] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:55,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:55,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:25:55,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936940025] [2022-11-02 20:25:55,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:55,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:25:55,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:55,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:25:55,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:25:55,392 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:55,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:55,783 INFO L93 Difference]: Finished difference Result 172 states and 183 transitions. [2022-11-02 20:25:55,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:25:55,784 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-02 20:25:55,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:55,785 INFO L225 Difference]: With dead ends: 172 [2022-11-02 20:25:55,785 INFO L226 Difference]: Without dead ends: 172 [2022-11-02 20:25:55,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:25:55,786 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 184 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:55,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 270 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:25:55,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-11-02 20:25:55,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 112. [2022-11-02 20:25:55,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 84 states have (on average 1.5) internal successors, (126), 111 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:55,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2022-11-02 20:25:55,790 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 14 [2022-11-02 20:25:55,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:55,790 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2022-11-02 20:25:55,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:55,797 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2022-11-02 20:25:55,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:25:55,798 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:55,799 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:55,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:25:55,799 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:25:55,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:55,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362871, now seen corresponding path program 1 times [2022-11-02 20:25:55,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:55,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913773056] [2022-11-02 20:25:55,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:55,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:56,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:25:56,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:56,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913773056] [2022-11-02 20:25:56,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913773056] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:56,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:56,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:25:56,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999990275] [2022-11-02 20:25:56,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:56,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:25:56,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:56,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:25:56,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:25:56,066 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:56,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:56,419 INFO L93 Difference]: Finished difference Result 120 states and 135 transitions. [2022-11-02 20:25:56,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:25:56,419 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-02 20:25:56,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:56,420 INFO L225 Difference]: With dead ends: 120 [2022-11-02 20:25:56,420 INFO L226 Difference]: Without dead ends: 120 [2022-11-02 20:25:56,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:25:56,421 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 167 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:56,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 191 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:25:56,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-02 20:25:56,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 111. [2022-11-02 20:25:56,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 84 states have (on average 1.4880952380952381) internal successors, (125), 110 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:56,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2022-11-02 20:25:56,425 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 16 [2022-11-02 20:25:56,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:56,426 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2022-11-02 20:25:56,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:56,426 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2022-11-02 20:25:56,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:25:56,427 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:56,427 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:56,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:25:56,427 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:25:56,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:56,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362872, now seen corresponding path program 1 times [2022-11-02 20:25:56,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:56,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999211766] [2022-11-02 20:25:56,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:56,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:56,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:56,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:25:56,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:56,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999211766] [2022-11-02 20:25:56,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999211766] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:56,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:56,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:25:56,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044294733] [2022-11-02 20:25:56,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:56,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:25:56,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:56,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:25:56,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:25:56,768 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:57,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:57,323 INFO L93 Difference]: Finished difference Result 115 states and 130 transitions. [2022-11-02 20:25:57,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:25:57,323 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-02 20:25:57,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:57,324 INFO L225 Difference]: With dead ends: 115 [2022-11-02 20:25:57,324 INFO L226 Difference]: Without dead ends: 115 [2022-11-02 20:25:57,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:25:57,325 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 158 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:57,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 240 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:25:57,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-02 20:25:57,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 99. [2022-11-02 20:25:57,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 98 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:57,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2022-11-02 20:25:57,328 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 16 [2022-11-02 20:25:57,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:57,329 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2022-11-02 20:25:57,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:57,329 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2022-11-02 20:25:57,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 20:25:57,330 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:57,330 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:57,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:25:57,330 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:25:57,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:57,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1559926215, now seen corresponding path program 1 times [2022-11-02 20:25:57,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:57,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182217329] [2022-11-02 20:25:57,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:57,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:57,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:57,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:25:57,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:57,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182217329] [2022-11-02 20:25:57,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182217329] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:57,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:57,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:25:57,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981025069] [2022-11-02 20:25:57,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:57,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:25:57,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:57,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:25:57,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:25:57,744 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:58,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:58,118 INFO L93 Difference]: Finished difference Result 147 states and 158 transitions. [2022-11-02 20:25:58,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:25:58,118 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-02 20:25:58,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:58,119 INFO L225 Difference]: With dead ends: 147 [2022-11-02 20:25:58,119 INFO L226 Difference]: Without dead ends: 147 [2022-11-02 20:25:58,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:25:58,120 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 333 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:58,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 319 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:25:58,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-11-02 20:25:58,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 99. [2022-11-02 20:25:58,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 78 states have (on average 1.435897435897436) internal successors, (112), 98 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:58,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2022-11-02 20:25:58,124 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 17 [2022-11-02 20:25:58,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:58,124 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2022-11-02 20:25:58,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:58,124 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2022-11-02 20:25:58,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 20:25:58,125 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:58,125 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:58,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:25:58,125 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:25:58,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:58,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1559926214, now seen corresponding path program 1 times [2022-11-02 20:25:58,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:58,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018696533] [2022-11-02 20:25:58,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:58,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:58,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:25:58,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:58,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018696533] [2022-11-02 20:25:58,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018696533] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:58,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:58,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:25:58,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549350094] [2022-11-02 20:25:58,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:58,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:25:58,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:58,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:25:58,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:25:58,573 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:58,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:58,920 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2022-11-02 20:25:58,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:25:58,920 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-02 20:25:58,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:58,921 INFO L225 Difference]: With dead ends: 157 [2022-11-02 20:25:58,921 INFO L226 Difference]: Without dead ends: 157 [2022-11-02 20:25:58,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:25:58,922 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 181 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:58,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 240 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:25:58,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-11-02 20:25:58,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 99. [2022-11-02 20:25:58,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 78 states have (on average 1.4230769230769231) internal successors, (111), 98 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:58,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2022-11-02 20:25:58,925 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 17 [2022-11-02 20:25:58,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:58,926 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2022-11-02 20:25:58,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:58,926 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2022-11-02 20:25:58,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 20:25:58,926 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:58,927 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:58,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:25:58,927 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:25:58,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:58,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1113087206, now seen corresponding path program 1 times [2022-11-02 20:25:58,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:58,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608715894] [2022-11-02 20:25:58,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:58,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:58,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:59,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:25:59,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:59,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608715894] [2022-11-02 20:25:59,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608715894] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:59,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:59,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:25:59,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267254016] [2022-11-02 20:25:59,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:59,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:25:59,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:59,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:25:59,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:25:59,148 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:59,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:59,424 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2022-11-02 20:25:59,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:25:59,424 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-02 20:25:59,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:59,425 INFO L225 Difference]: With dead ends: 138 [2022-11-02 20:25:59,425 INFO L226 Difference]: Without dead ends: 138 [2022-11-02 20:25:59,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:25:59,426 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 287 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:59,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 207 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:25:59,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-11-02 20:25:59,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 116. [2022-11-02 20:25:59,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 95 states have (on average 1.4947368421052631) internal successors, (142), 115 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:59,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 142 transitions. [2022-11-02 20:25:59,430 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 142 transitions. Word has length 18 [2022-11-02 20:25:59,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:59,430 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 142 transitions. [2022-11-02 20:25:59,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:59,430 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 142 transitions. [2022-11-02 20:25:59,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 20:25:59,431 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:59,431 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:59,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:25:59,431 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:25:59,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:59,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1113087205, now seen corresponding path program 1 times [2022-11-02 20:25:59,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:59,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598638143] [2022-11-02 20:25:59,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:59,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:59,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:25:59,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:59,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598638143] [2022-11-02 20:25:59,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598638143] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:59,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:59,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:25:59,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045619500] [2022-11-02 20:25:59,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:59,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:25:59,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:59,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:25:59,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:25:59,831 INFO L87 Difference]: Start difference. First operand 116 states and 142 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:00,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:00,153 INFO L93 Difference]: Finished difference Result 159 states and 173 transitions. [2022-11-02 20:26:00,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:26:00,153 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-02 20:26:00,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:00,154 INFO L225 Difference]: With dead ends: 159 [2022-11-02 20:26:00,154 INFO L226 Difference]: Without dead ends: 159 [2022-11-02 20:26:00,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:26:00,155 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 142 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:00,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 229 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:26:00,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-11-02 20:26:00,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 121. [2022-11-02 20:26:00,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 100 states have (on average 1.47) internal successors, (147), 120 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:00,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 147 transitions. [2022-11-02 20:26:00,159 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 147 transitions. Word has length 18 [2022-11-02 20:26:00,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:00,159 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 147 transitions. [2022-11-02 20:26:00,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:00,159 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 147 transitions. [2022-11-02 20:26:00,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-02 20:26:00,160 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:00,160 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] [2022-11-02 20:26:00,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:26:00,160 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:26:00,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:00,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1461687964, now seen corresponding path program 1 times [2022-11-02 20:26:00,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:00,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028909003] [2022-11-02 20:26:00,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:00,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:00,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:00,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:00,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:00,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028909003] [2022-11-02 20:26:00,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028909003] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:00,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:00,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:26:00,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723659013] [2022-11-02 20:26:00,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:00,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:26:00,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:00,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:26:00,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:26:00,423 INFO L87 Difference]: Start difference. First operand 121 states and 147 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:00,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:00,722 INFO L93 Difference]: Finished difference Result 155 states and 169 transitions. [2022-11-02 20:26:00,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:26:00,722 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-02 20:26:00,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:00,723 INFO L225 Difference]: With dead ends: 155 [2022-11-02 20:26:00,723 INFO L226 Difference]: Without dead ends: 155 [2022-11-02 20:26:00,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:26:00,723 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 135 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:00,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 335 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:26:00,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-02 20:26:00,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 122. [2022-11-02 20:26:00,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.4653465346534653) internal successors, (148), 121 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:00,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 148 transitions. [2022-11-02 20:26:00,728 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 148 transitions. Word has length 21 [2022-11-02 20:26:00,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:00,728 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 148 transitions. [2022-11-02 20:26:00,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:00,728 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 148 transitions. [2022-11-02 20:26:00,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-02 20:26:00,731 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:00,732 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] [2022-11-02 20:26:00,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:26:00,732 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:26:00,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:00,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1905376220, now seen corresponding path program 1 times [2022-11-02 20:26:00,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:00,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696861253] [2022-11-02 20:26:00,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:00,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:00,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:00,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:00,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696861253] [2022-11-02 20:26:00,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696861253] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:00,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:00,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:26:00,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940586309] [2022-11-02 20:26:00,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:00,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:26:00,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:00,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:26:00,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:26:00,785 INFO L87 Difference]: Start difference. First operand 122 states and 148 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:00,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:00,793 INFO L93 Difference]: Finished difference Result 125 states and 151 transitions. [2022-11-02 20:26:00,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:26:00,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-02 20:26:00,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:00,794 INFO L225 Difference]: With dead ends: 125 [2022-11-02 20:26:00,795 INFO L226 Difference]: Without dead ends: 125 [2022-11-02 20:26:00,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:26:00,796 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:00,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:26:00,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-02 20:26:00,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-11-02 20:26:00,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 104 states have (on average 1.4519230769230769) internal successors, (151), 124 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:00,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 151 transitions. [2022-11-02 20:26:00,803 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 151 transitions. Word has length 21 [2022-11-02 20:26:00,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:00,804 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 151 transitions. [2022-11-02 20:26:00,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:00,804 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 151 transitions. [2022-11-02 20:26:00,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-02 20:26:00,806 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:00,806 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] [2022-11-02 20:26:00,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:26:00,806 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:26:00,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:00,807 INFO L85 PathProgramCache]: Analyzing trace with hash 2137291894, now seen corresponding path program 1 times [2022-11-02 20:26:00,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:00,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453144862] [2022-11-02 20:26:00,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:00,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:00,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:00,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:00,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453144862] [2022-11-02 20:26:00,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453144862] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:00,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:00,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:26:00,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811150124] [2022-11-02 20:26:00,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:00,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:26:00,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:00,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:26:00,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:26:00,923 INFO L87 Difference]: Start difference. First operand 125 states and 151 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:01,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:01,045 INFO L93 Difference]: Finished difference Result 124 states and 150 transitions. [2022-11-02 20:26:01,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:26:01,045 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-02 20:26:01,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:01,047 INFO L225 Difference]: With dead ends: 124 [2022-11-02 20:26:01,047 INFO L226 Difference]: Without dead ends: 124 [2022-11-02 20:26:01,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:26:01,048 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 190 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:01,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 99 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:26:01,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-11-02 20:26:01,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2022-11-02 20:26:01,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 103 states have (on average 1.4466019417475728) internal successors, (149), 122 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:01,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 149 transitions. [2022-11-02 20:26:01,052 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 149 transitions. Word has length 21 [2022-11-02 20:26:01,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:01,052 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 149 transitions. [2022-11-02 20:26:01,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:01,053 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 149 transitions. [2022-11-02 20:26:01,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:26:01,055 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:01,056 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] [2022-11-02 20:26:01,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:26:01,056 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:26:01,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:01,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1062832435, now seen corresponding path program 1 times [2022-11-02 20:26:01,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:01,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571466655] [2022-11-02 20:26:01,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:01,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:01,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:01,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:01,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571466655] [2022-11-02 20:26:01,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571466655] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:01,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:01,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:26:01,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178812192] [2022-11-02 20:26:01,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:01,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:26:01,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:01,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:26:01,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:26:01,133 INFO L87 Difference]: Start difference. First operand 123 states and 149 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:01,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:01,258 INFO L93 Difference]: Finished difference Result 122 states and 146 transitions. [2022-11-02 20:26:01,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:26:01,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-02 20:26:01,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:01,260 INFO L225 Difference]: With dead ends: 122 [2022-11-02 20:26:01,260 INFO L226 Difference]: Without dead ends: 122 [2022-11-02 20:26:01,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:26:01,260 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 29 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:01,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 164 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:26:01,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-11-02 20:26:01,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-11-02 20:26:01,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.4174757281553398) internal successors, (146), 121 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:01,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 146 transitions. [2022-11-02 20:26:01,264 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 146 transitions. Word has length 22 [2022-11-02 20:26:01,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:01,265 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 146 transitions. [2022-11-02 20:26:01,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:01,266 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 146 transitions. [2022-11-02 20:26:01,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:26:01,266 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:01,266 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] [2022-11-02 20:26:01,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:26:01,267 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:26:01,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:01,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1062832434, now seen corresponding path program 1 times [2022-11-02 20:26:01,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:01,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270855141] [2022-11-02 20:26:01,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:01,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:01,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:01,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:01,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:01,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270855141] [2022-11-02 20:26:01,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270855141] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:01,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:01,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:26:01,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402832970] [2022-11-02 20:26:01,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:01,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:26:01,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:01,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:26:01,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:26:01,767 INFO L87 Difference]: Start difference. First operand 122 states and 146 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:02,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:02,163 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2022-11-02 20:26:02,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:26:02,164 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-02 20:26:02,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:02,165 INFO L225 Difference]: With dead ends: 153 [2022-11-02 20:26:02,165 INFO L226 Difference]: Without dead ends: 153 [2022-11-02 20:26:02,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:26:02,165 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 158 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:02,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 287 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:26:02,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-11-02 20:26:02,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 122. [2022-11-02 20:26:02,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.4077669902912622) internal successors, (145), 121 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:02,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 145 transitions. [2022-11-02 20:26:02,170 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 145 transitions. Word has length 22 [2022-11-02 20:26:02,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:02,171 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 145 transitions. [2022-11-02 20:26:02,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:02,171 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 145 transitions. [2022-11-02 20:26:02,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 20:26:02,171 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:02,172 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] [2022-11-02 20:26:02,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:26:02,172 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:26:02,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:02,173 INFO L85 PathProgramCache]: Analyzing trace with hash 227835007, now seen corresponding path program 1 times [2022-11-02 20:26:02,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:02,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128461778] [2022-11-02 20:26:02,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:02,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:02,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:02,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:02,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:02,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128461778] [2022-11-02 20:26:02,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128461778] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:02,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:02,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:26:02,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926649923] [2022-11-02 20:26:02,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:02,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:26:02,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:02,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:26:02,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:26:02,453 INFO L87 Difference]: Start difference. First operand 122 states and 145 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:02,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:02,715 INFO L93 Difference]: Finished difference Result 135 states and 147 transitions. [2022-11-02 20:26:02,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:26:02,716 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-02 20:26:02,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:02,716 INFO L225 Difference]: With dead ends: 135 [2022-11-02 20:26:02,716 INFO L226 Difference]: Without dead ends: 131 [2022-11-02 20:26:02,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:26:02,717 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 45 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:02,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 327 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:26:02,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-02 20:26:02,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 120. [2022-11-02 20:26:02,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 101 states have (on average 1.4059405940594059) internal successors, (142), 119 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:02,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 142 transitions. [2022-11-02 20:26:02,722 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 142 transitions. Word has length 23 [2022-11-02 20:26:02,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:02,723 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 142 transitions. [2022-11-02 20:26:02,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:02,723 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 142 transitions. [2022-11-02 20:26:02,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 20:26:02,724 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:02,724 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] [2022-11-02 20:26:02,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:26:02,725 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:26:02,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:02,726 INFO L85 PathProgramCache]: Analyzing trace with hash 229252065, now seen corresponding path program 1 times [2022-11-02 20:26:02,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:02,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487573176] [2022-11-02 20:26:02,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:02,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:02,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:03,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:03,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:03,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487573176] [2022-11-02 20:26:03,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487573176] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:03,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:03,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:26:03,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107977035] [2022-11-02 20:26:03,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:03,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:26:03,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:03,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:26:03,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:26:03,005 INFO L87 Difference]: Start difference. First operand 120 states and 142 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:03,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:03,232 INFO L93 Difference]: Finished difference Result 151 states and 163 transitions. [2022-11-02 20:26:03,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:26:03,234 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-02 20:26:03,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:03,235 INFO L225 Difference]: With dead ends: 151 [2022-11-02 20:26:03,235 INFO L226 Difference]: Without dead ends: 151 [2022-11-02 20:26:03,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:26:03,236 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 253 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:03,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 265 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:26:03,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-02 20:26:03,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 121. [2022-11-02 20:26:03,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 102 states have (on average 1.4019607843137254) internal successors, (143), 120 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:03,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 143 transitions. [2022-11-02 20:26:03,240 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 143 transitions. Word has length 23 [2022-11-02 20:26:03,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:03,240 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 143 transitions. [2022-11-02 20:26:03,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:03,240 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 143 transitions. [2022-11-02 20:26:03,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 20:26:03,240 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:03,240 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] [2022-11-02 20:26:03,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:26:03,241 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:26:03,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:03,241 INFO L85 PathProgramCache]: Analyzing trace with hash 779247630, now seen corresponding path program 1 times [2022-11-02 20:26:03,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:03,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883557509] [2022-11-02 20:26:03,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:03,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:03,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:03,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:03,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:03,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883557509] [2022-11-02 20:26:03,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883557509] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:03,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:03,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:26:03,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927932118] [2022-11-02 20:26:03,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:03,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:26:03,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:03,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:26:03,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:26:03,322 INFO L87 Difference]: Start difference. First operand 121 states and 143 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:03,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:03,483 INFO L93 Difference]: Finished difference Result 124 states and 145 transitions. [2022-11-02 20:26:03,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:26:03,483 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-02 20:26:03,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:03,484 INFO L225 Difference]: With dead ends: 124 [2022-11-02 20:26:03,484 INFO L226 Difference]: Without dead ends: 124 [2022-11-02 20:26:03,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:26:03,485 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 76 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:03,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 159 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:26:03,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-11-02 20:26:03,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2022-11-02 20:26:03,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.3980582524271845) internal successors, (144), 121 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:03,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 144 transitions. [2022-11-02 20:26:03,487 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 144 transitions. Word has length 24 [2022-11-02 20:26:03,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:03,488 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 144 transitions. [2022-11-02 20:26:03,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:03,488 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 144 transitions. [2022-11-02 20:26:03,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 20:26:03,488 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:03,488 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] [2022-11-02 20:26:03,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:26:03,489 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:26:03,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:03,489 INFO L85 PathProgramCache]: Analyzing trace with hash 779247631, now seen corresponding path program 1 times [2022-11-02 20:26:03,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:03,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449977739] [2022-11-02 20:26:03,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:03,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:03,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:04,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:04,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:04,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449977739] [2022-11-02 20:26:04,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449977739] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:26:04,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846191686] [2022-11-02 20:26:04,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:04,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:26:04,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:26:04,034 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:26:04,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:26:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:04,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-02 20:26:04,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:26:04,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-11-02 20:26:04,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 20:26:04,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:04,445 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:26:04,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846191686] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:04,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:26:04,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2022-11-02 20:26:04,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009139498] [2022-11-02 20:26:04,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:04,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:26:04,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:04,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:26:04,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:26:04,449 INFO L87 Difference]: Start difference. First operand 122 states and 144 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:04,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:04,684 INFO L93 Difference]: Finished difference Result 122 states and 141 transitions. [2022-11-02 20:26:04,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:26:04,684 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-02 20:26:04,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:04,685 INFO L225 Difference]: With dead ends: 122 [2022-11-02 20:26:04,685 INFO L226 Difference]: Without dead ends: 122 [2022-11-02 20:26:04,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:26:04,686 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 61 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:04,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 173 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:26:04,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-11-02 20:26:04,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2022-11-02 20:26:04,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 103 states have (on average 1.3592233009708738) internal successors, (140), 120 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:04,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 140 transitions. [2022-11-02 20:26:04,689 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 140 transitions. Word has length 24 [2022-11-02 20:26:04,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:04,689 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 140 transitions. [2022-11-02 20:26:04,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:04,689 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 140 transitions. [2022-11-02 20:26:04,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 20:26:04,690 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:04,690 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-11-02 20:26:04,734 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:26:04,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-02 20:26:04,908 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:26:04,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:04,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1267909458, now seen corresponding path program 1 times [2022-11-02 20:26:04,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:04,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128944817] [2022-11-02 20:26:04,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:04,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:04,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:05,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:05,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:05,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128944817] [2022-11-02 20:26:05,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128944817] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:05,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:05,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 20:26:05,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777267397] [2022-11-02 20:26:05,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:05,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:26:05,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:05,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:26:05,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:26:05,323 INFO L87 Difference]: Start difference. First operand 121 states and 140 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:05,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:05,719 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2022-11-02 20:26:05,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:26:05,720 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-02 20:26:05,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:05,720 INFO L225 Difference]: With dead ends: 137 [2022-11-02 20:26:05,720 INFO L226 Difference]: Without dead ends: 133 [2022-11-02 20:26:05,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:26:05,721 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 162 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:05,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 456 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:26:05,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-02 20:26:05,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 121. [2022-11-02 20:26:05,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 103 states have (on average 1.3495145631067962) internal successors, (139), 120 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:05,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 139 transitions. [2022-11-02 20:26:05,725 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 139 transitions. Word has length 25 [2022-11-02 20:26:05,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:05,725 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 139 transitions. [2022-11-02 20:26:05,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:05,725 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 139 transitions. [2022-11-02 20:26:05,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 20:26:05,726 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:05,726 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-11-02 20:26:05,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 20:26:05,726 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:26:05,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:05,727 INFO L85 PathProgramCache]: Analyzing trace with hash -342052636, now seen corresponding path program 1 times [2022-11-02 20:26:05,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:05,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024504327] [2022-11-02 20:26:05,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:05,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:06,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:06,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:06,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024504327] [2022-11-02 20:26:06,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024504327] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:06,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:06,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:26:06,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569272916] [2022-11-02 20:26:06,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:06,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:26:06,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:06,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:26:06,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:26:06,257 INFO L87 Difference]: Start difference. First operand 121 states and 139 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:06,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:06,705 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2022-11-02 20:26:06,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:26:06,705 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-02 20:26:06,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:06,706 INFO L225 Difference]: With dead ends: 131 [2022-11-02 20:26:06,706 INFO L226 Difference]: Without dead ends: 131 [2022-11-02 20:26:06,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:26:06,707 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 135 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:06,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 425 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:26:06,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-02 20:26:06,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 120. [2022-11-02 20:26:06,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 102 states have (on average 1.3431372549019607) internal successors, (137), 119 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:06,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 137 transitions. [2022-11-02 20:26:06,710 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 137 transitions. Word has length 25 [2022-11-02 20:26:06,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:06,710 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 137 transitions. [2022-11-02 20:26:06,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:06,711 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 137 transitions. [2022-11-02 20:26:06,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 20:26:06,711 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:06,711 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-11-02 20:26:06,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 20:26:06,711 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:26:06,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:06,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1700492295, now seen corresponding path program 1 times [2022-11-02 20:26:06,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:06,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013740542] [2022-11-02 20:26:06,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:06,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:06,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:06,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:06,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013740542] [2022-11-02 20:26:06,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013740542] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:06,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:06,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:26:06,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384797006] [2022-11-02 20:26:06,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:06,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:26:06,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:06,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:26:06,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:26:06,753 INFO L87 Difference]: Start difference. First operand 120 states and 137 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:06,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:06,767 INFO L93 Difference]: Finished difference Result 190 states and 211 transitions. [2022-11-02 20:26:06,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:26:06,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-02 20:26:06,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:06,770 INFO L225 Difference]: With dead ends: 190 [2022-11-02 20:26:06,771 INFO L226 Difference]: Without dead ends: 190 [2022-11-02 20:26:06,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:26:06,772 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 59 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:06,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 151 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:26:06,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-11-02 20:26:06,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 136. [2022-11-02 20:26:06,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 118 states have (on average 1.3135593220338984) internal successors, (155), 135 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:06,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 155 transitions. [2022-11-02 20:26:06,777 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 155 transitions. Word has length 25 [2022-11-02 20:26:06,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:06,778 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 155 transitions. [2022-11-02 20:26:06,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:06,778 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 155 transitions. [2022-11-02 20:26:06,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 20:26:06,779 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:06,779 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] [2022-11-02 20:26:06,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 20:26:06,779 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:26:06,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:06,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1532665747, now seen corresponding path program 1 times [2022-11-02 20:26:06,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:06,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202404603] [2022-11-02 20:26:06,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:06,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:06,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:07,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:07,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:07,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202404603] [2022-11-02 20:26:07,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202404603] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:26:07,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531948916] [2022-11-02 20:26:07,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:07,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:26:07,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:26:07,219 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:26:07,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:26:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:07,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-02 20:26:07,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:26:07,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-11-02 20:26:07,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-02 20:26:07,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 20:26:07,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:07,551 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:26:07,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531948916] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:07,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:26:07,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 19 [2022-11-02 20:26:07,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493769344] [2022-11-02 20:26:07,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:07,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:26:07,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:07,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:26:07,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:26:07,554 INFO L87 Difference]: Start difference. First operand 136 states and 155 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:07,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:07,908 INFO L93 Difference]: Finished difference Result 154 states and 174 transitions. [2022-11-02 20:26:07,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:26:07,909 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-02 20:26:07,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:07,910 INFO L225 Difference]: With dead ends: 154 [2022-11-02 20:26:07,910 INFO L226 Difference]: Without dead ends: 154 [2022-11-02 20:26:07,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:26:07,911 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 32 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:07,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 319 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:26:07,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-11-02 20:26:07,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 149. [2022-11-02 20:26:07,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 131 states have (on average 1.297709923664122) internal successors, (170), 148 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:07,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 170 transitions. [2022-11-02 20:26:07,915 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 170 transitions. Word has length 26 [2022-11-02 20:26:07,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:07,915 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 170 transitions. [2022-11-02 20:26:07,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:07,916 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 170 transitions. [2022-11-02 20:26:07,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 20:26:07,916 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:07,916 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:26:07,958 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:26:08,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-02 20:26:08,117 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:26:08,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:08,117 INFO L85 PathProgramCache]: Analyzing trace with hash -301886117, now seen corresponding path program 1 times [2022-11-02 20:26:08,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:08,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378102351] [2022-11-02 20:26:08,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:08,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:08,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:08,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:08,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:08,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378102351] [2022-11-02 20:26:08,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378102351] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:26:08,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470902860] [2022-11-02 20:26:08,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:08,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:26:08,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:26:08,577 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:26:08,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:26:08,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:08,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-02 20:26:08,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:26:08,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:26:08,831 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:26:08,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:26:08,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:26:09,019 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:26:09,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-02 20:26:09,137 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:26:09,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2022-11-02 20:26:09,186 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:26:09,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2022-11-02 20:26:09,255 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:26:09,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-02 20:26:09,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-02 20:26:09,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:09,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:26:09,328 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_893 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_893) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-11-02 20:26:09,378 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_893 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_893) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-11-02 20:26:09,385 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_893 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_893) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-11-02 20:26:09,396 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_890 (Array Int Int)) (v_ArrVal_893 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_890))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_893)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-11-02 20:26:09,407 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_890 (Array Int Int)) (v_ArrVal_893 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_890))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_893)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-11-02 20:26:09,423 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:26:09,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2022-11-02 20:26:09,435 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:26:09,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 128 [2022-11-02 20:26:09,451 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:26:09,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 111 [2022-11-02 20:26:09,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 98 [2022-11-02 20:26:09,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 20:26:09,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470902860] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:26:09,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:26:09,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 29 [2022-11-02 20:26:09,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977919306] [2022-11-02 20:26:09,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:26:09,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-02 20:26:09,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:09,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-02 20:26:09,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=486, Unknown=5, NotChecked=240, Total=812 [2022-11-02 20:26:09,766 INFO L87 Difference]: Start difference. First operand 149 states and 170 transitions. Second operand has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:10,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:10,977 INFO L93 Difference]: Finished difference Result 271 states and 302 transitions. [2022-11-02 20:26:10,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:26:10,978 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-02 20:26:10,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:10,979 INFO L225 Difference]: With dead ends: 271 [2022-11-02 20:26:10,979 INFO L226 Difference]: Without dead ends: 271 [2022-11-02 20:26:10,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=209, Invalid=928, Unknown=5, NotChecked=340, Total=1482 [2022-11-02 20:26:10,980 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 243 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 1883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 859 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:10,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 845 Invalid, 1883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 985 Invalid, 0 Unknown, 859 Unchecked, 0.7s Time] [2022-11-02 20:26:10,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-11-02 20:26:10,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 174. [2022-11-02 20:26:10,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 156 states have (on average 1.2692307692307692) internal successors, (198), 173 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:10,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 198 transitions. [2022-11-02 20:26:10,985 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 198 transitions. Word has length 28 [2022-11-02 20:26:10,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:10,985 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 198 transitions. [2022-11-02 20:26:10,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:10,985 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 198 transitions. [2022-11-02 20:26:10,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:26:10,986 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:10,986 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:26:11,033 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:26:11,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-02 20:26:11,203 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:26:11,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:11,203 INFO L85 PathProgramCache]: Analyzing trace with hash -768530862, now seen corresponding path program 1 times [2022-11-02 20:26:11,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:11,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769489126] [2022-11-02 20:26:11,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:11,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:11,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:11,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:11,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:11,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769489126] [2022-11-02 20:26:11,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769489126] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:26:11,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94631028] [2022-11-02 20:26:11,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:11,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:26:11,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:26:11,575 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:26:11,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:26:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:11,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-02 20:26:11,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:26:11,929 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-02 20:26:11,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-02 20:26:12,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:26:12,009 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-02 20:26:12,010 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-11-02 20:26:12,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:26:12,093 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-02 20:26:12,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 35 [2022-11-02 20:26:12,152 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-02 20:26:12,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 15 [2022-11-02 20:26:12,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:12,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:26:18,413 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:26:18,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 99 [2022-11-02 20:26:18,981 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:26:18,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 53 treesize of output 207 [2022-11-02 20:26:19,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:19,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94631028] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:26:19,701 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:26:19,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2022-11-02 20:26:19,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239771635] [2022-11-02 20:26:19,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:26:19,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-02 20:26:19,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:19,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-02 20:26:19,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=501, Unknown=3, NotChecked=0, Total=600 [2022-11-02 20:26:19,715 INFO L87 Difference]: Start difference. First operand 174 states and 198 transitions. Second operand has 25 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 25 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:20,219 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|) 1))) (and .cse0 (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (or (not (= (select |c_#valid| |c_ULTIMATE.start_main_#t~mem5#1.base|) 1)) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1004 Int)) (or (not (<= 0 |ULTIMATE.start_main_~x~0#1.offset|)) (= 1 (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1004)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (or (not .cse0) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1004 Int)) (or (not (<= 0 |ULTIMATE.start_main_~x~0#1.offset|)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1004)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)))) (= (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1))) is different from false [2022-11-02 20:26:20,755 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|) 1)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (and .cse0 (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_1004 Int)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_1004)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select |c_#valid| (select .cse1 |c_ULTIMATE.start_main_~head~0#1.offset|)) 1) (or (not (= (select |c_#valid| |c_ULTIMATE.start_main_#t~mem5#1.base|) 1)) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1004 Int)) (or (not (<= 0 |ULTIMATE.start_main_~x~0#1.offset|)) (= 1 (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1004)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (not (= (select .cse1 |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)) (or (not .cse0) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1004 Int)) (or (not (<= 0 |ULTIMATE.start_main_~x~0#1.offset|)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse1 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1004)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)))))) is different from false [2022-11-02 20:26:34,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:34,061 INFO L93 Difference]: Finished difference Result 319 states and 350 transitions. [2022-11-02 20:26:34,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-02 20:26:34,062 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 25 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-02 20:26:34,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:34,063 INFO L225 Difference]: With dead ends: 319 [2022-11-02 20:26:34,063 INFO L226 Difference]: Without dead ends: 319 [2022-11-02 20:26:34,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 50 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 20.1s TimeCoverageRelationStatistics Valid=405, Invalid=1575, Unknown=8, NotChecked=174, Total=2162 [2022-11-02 20:26:34,065 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 656 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 1383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 466 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:34,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 801 Invalid, 1383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 828 Invalid, 0 Unknown, 466 Unchecked, 0.7s Time] [2022-11-02 20:26:34,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-11-02 20:26:34,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 213. [2022-11-02 20:26:34,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 195 states have (on average 1.2564102564102564) internal successors, (245), 212 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:34,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 245 transitions. [2022-11-02 20:26:34,070 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 245 transitions. Word has length 29 [2022-11-02 20:26:34,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:34,070 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 245 transitions. [2022-11-02 20:26:34,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 25 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:34,071 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 245 transitions. [2022-11-02 20:26:34,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:26:34,071 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:34,071 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:26:34,112 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-02 20:26:34,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:26:34,295 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:26:34,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:34,296 INFO L85 PathProgramCache]: Analyzing trace with hash -768530861, now seen corresponding path program 1 times [2022-11-02 20:26:34,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:34,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897307609] [2022-11-02 20:26:34,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:34,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:34,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:34,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:34,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:34,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897307609] [2022-11-02 20:26:34,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897307609] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:26:34,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833860028] [2022-11-02 20:26:34,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:34,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:26:34,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:26:34,856 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:26:34,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:26:35,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:35,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-02 20:26:35,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:26:35,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:26:35,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:26:35,128 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:26:35,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:26:35,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:26:35,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-11-02 20:26:35,314 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:26:35,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-02 20:26:35,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-02 20:26:35,458 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:26:35,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-02 20:26:35,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:26:35,482 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:26:35,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-02 20:26:35,563 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:26:35,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-02 20:26:35,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:26:35,589 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:26:35,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-02 20:26:35,689 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:26:35,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-02 20:26:35,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-02 20:26:35,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:26:35,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-02 20:26:35,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:35,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:26:35,905 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1122 (Array Int Int)) (v_ArrVal_1121 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1122) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1121) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1122 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1122) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-11-02 20:26:35,986 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1122 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1122) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8))) (forall ((v_ArrVal_1122 (Array Int Int)) (v_ArrVal_1121 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1122) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1121) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-11-02 20:26:35,998 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_1122 (Array Int Int)) (v_ArrVal_1121 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1122) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1121) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1122 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1122) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2022-11-02 20:26:36,023 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_ArrVal_1122 (Array Int Int)) (v_ArrVal_1121 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1116))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1115) .cse0 v_ArrVal_1122) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 12) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_1121) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_ArrVal_1122 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1115) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1116) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1122) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8)))) is different from false [2022-11-02 20:26:36,040 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_ArrVal_1122 (Array Int Int)) (v_ArrVal_1121 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1116))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1115) .cse1 v_ArrVal_1122) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1121) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_ArrVal_1122 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1115) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1116) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1122) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2022-11-02 20:26:36,063 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:26:36,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2022-11-02 20:26:36,070 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:26:36,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-02 20:26:36,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-02 20:26:36,095 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:26:36,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 186 treesize of output 181 [2022-11-02 20:26:36,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 156 [2022-11-02 20:26:36,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 126 [2022-11-02 20:26:36,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 114 [2022-11-02 20:26:36,214 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:26:36,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2022-11-02 20:26:36,223 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:26:36,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2022-11-02 20:26:36,227 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:26:36,228 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:26:36,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 50 [2022-11-02 20:26:36,236 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:26:36,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2022-11-02 20:26:36,248 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-11-02 20:26:36,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 20:26:36,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833860028] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:26:36,405 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:26:36,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 30 [2022-11-02 20:26:36,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574596726] [2022-11-02 20:26:36,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:26:36,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-02 20:26:36,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:36,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-02 20:26:36,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=559, Unknown=5, NotChecked=260, Total=930 [2022-11-02 20:26:36,408 INFO L87 Difference]: Start difference. First operand 213 states and 245 transitions. Second operand has 31 states, 30 states have (on average 2.7) internal successors, (81), 31 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:38,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:38,160 INFO L93 Difference]: Finished difference Result 297 states and 328 transitions. [2022-11-02 20:26:38,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-02 20:26:38,161 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.7) internal successors, (81), 31 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-02 20:26:38,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:38,162 INFO L225 Difference]: With dead ends: 297 [2022-11-02 20:26:38,162 INFO L226 Difference]: Without dead ends: 297 [2022-11-02 20:26:38,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 39 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=289, Invalid=1447, Unknown=6, NotChecked=420, Total=2162 [2022-11-02 20:26:38,163 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 385 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 1865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 861 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:38,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 705 Invalid, 1865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 960 Invalid, 0 Unknown, 861 Unchecked, 0.8s Time] [2022-11-02 20:26:38,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-11-02 20:26:38,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 230. [2022-11-02 20:26:38,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 212 states have (on average 1.2641509433962264) internal successors, (268), 229 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:38,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 268 transitions. [2022-11-02 20:26:38,168 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 268 transitions. Word has length 29 [2022-11-02 20:26:38,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:38,169 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 268 transitions. [2022-11-02 20:26:38,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.7) internal successors, (81), 31 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:38,169 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 268 transitions. [2022-11-02 20:26:38,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:26:38,170 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:38,170 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] [2022-11-02 20:26:38,204 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:26:38,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:26:38,370 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:26:38,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:38,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1199075445, now seen corresponding path program 1 times [2022-11-02 20:26:38,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:38,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453602209] [2022-11-02 20:26:38,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:38,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:38,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:38,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:38,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453602209] [2022-11-02 20:26:38,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453602209] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:26:38,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140264684] [2022-11-02 20:26:38,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:38,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:26:38,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:26:38,789 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:26:38,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:26:38,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:38,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-02 20:26:38,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:26:38,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:26:38,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:26:38,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:26:38,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:26:38,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:26:38,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:26:39,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:26:39,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:26:39,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:26:39,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:26:39,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:26:39,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:26:39,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:26:39,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:26:39,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:26:39,264 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 20:26:39,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 13 [2022-11-02 20:26:39,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:39,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:26:39,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2022-11-02 20:27:16,812 INFO L356 Elim1Store]: treesize reduction 29, result has 3.3 percent of original size [2022-11-02 20:27:16,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14636 treesize of output 1 [2022-11-02 20:27:16,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:27:16,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140264684] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:27:16,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:27:16,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 12] total 22 [2022-11-02 20:27:16,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772974098] [2022-11-02 20:27:16,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:27:16,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-02 20:27:16,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:16,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-02 20:27:16,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=394, Unknown=28, NotChecked=0, Total=506 [2022-11-02 20:27:16,816 INFO L87 Difference]: Start difference. First operand 230 states and 268 transitions. Second operand has 23 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:27:26,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:27:26,864 INFO L93 Difference]: Finished difference Result 255 states and 286 transitions. [2022-11-02 20:27:26,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-02 20:27:26,865 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-02 20:27:26,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:27:26,866 INFO L225 Difference]: With dead ends: 255 [2022-11-02 20:27:26,866 INFO L226 Difference]: Without dead ends: 255 [2022-11-02 20:27:26,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 47.1s TimeCoverageRelationStatistics Valid=344, Invalid=1180, Unknown=36, NotChecked=0, Total=1560 [2022-11-02 20:27:26,868 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 313 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 175 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:27:26,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 561 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 407 Invalid, 0 Unknown, 175 Unchecked, 0.4s Time] [2022-11-02 20:27:26,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-11-02 20:27:26,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 216. [2022-11-02 20:27:26,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 200 states have (on average 1.23) internal successors, (246), 215 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:27:26,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 246 transitions. [2022-11-02 20:27:26,873 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 246 transitions. Word has length 30 [2022-11-02 20:27:26,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:27:26,874 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 246 transitions. [2022-11-02 20:27:26,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:27:26,874 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 246 transitions. [2022-11-02 20:27:26,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-02 20:27:26,875 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:27:26,875 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:27:26,915 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:27:27,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-02 20:27:27,089 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:27:27,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:27,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1483366933, now seen corresponding path program 1 times [2022-11-02 20:27:27,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:27,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793498560] [2022-11-02 20:27:27,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:27,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:27,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:27,533 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:27:27,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:27,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793498560] [2022-11-02 20:27:27,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793498560] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:27:27,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217383142] [2022-11-02 20:27:27,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:27,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:27:27,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:27:27,535 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:27:27,536 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:27:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:27,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-02 20:27:27,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:27:27,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:27:27,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:27:27,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:27:27,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:27:27,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:27:27,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:27:27,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:27:27,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:27:27,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:27:27,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:27:27,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:27:27,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:27:27,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:27:27,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:27:28,136 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 20:27:28,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 24 [2022-11-02 20:27:28,265 INFO L356 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2022-11-02 20:27:28,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 24 [2022-11-02 20:27:28,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:27:28,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:27:28,334 INFO L356 Elim1Store]: treesize reduction 5, result has 75.0 percent of original size [2022-11-02 20:27:28,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2022-11-02 20:27:56,216 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1252 Int) (v_ArrVal_1254 Int) (v_ArrVal_1257 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_61| Int) (v_ArrVal_1256 Int)) (or (not (<= |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_61|)) (let ((.cse5 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse6 (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_61|))) (let ((.cse3 (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse5 v_ArrVal_1254) .cse6 v_ArrVal_1256))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~head~0#1.offset|))) (= (let ((.cse4 (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse5 v_ArrVal_1252) .cse6 v_ArrVal_1257))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| .cse3))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| .cse4) .cse1) .cse2)))) .cse1)))))) is different from false [2022-11-02 20:28:30,350 INFO L356 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2022-11-02 20:28:30,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 1943069 treesize of output 1 [2022-11-02 20:28:30,352 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:30,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217383142] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:28:30,353 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:28:30,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 12] total 23 [2022-11-02 20:28:30,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178943841] [2022-11-02 20:28:30,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:28:30,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-02 20:28:30,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:30,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-02 20:28:30,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=408, Unknown=30, NotChecked=42, Total=552 [2022-11-02 20:28:30,355 INFO L87 Difference]: Start difference. First operand 216 states and 246 transitions. Second operand has 24 states, 23 states have (on average 3.0) internal successors, (69), 24 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:34,172 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (forall ((v_ArrVal_1252 Int) (v_ArrVal_1254 Int) (v_ArrVal_1257 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_61| Int) (v_ArrVal_1256 Int)) (or (not (<= |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_61|)) (let ((.cse6 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse7 (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_61|))) (let ((.cse3 (store (store .cse8 .cse6 v_ArrVal_1254) .cse7 v_ArrVal_1256))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~head~0#1.offset|))) (= (let ((.cse4 (store (store .cse5 .cse6 v_ArrVal_1252) .cse7 v_ArrVal_1257))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| .cse3))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| .cse4) .cse1) .cse2)))) .cse1)))))) (= .cse9 |c_ULTIMATE.start_main_~head~0#1.base|) (= (select |c_#valid| .cse9) 1) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select .cse5 |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-11-02 20:28:38,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:28:38,494 INFO L93 Difference]: Finished difference Result 236 states and 266 transitions. [2022-11-02 20:28:38,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:28:38,495 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.0) internal successors, (69), 24 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-02 20:28:38,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:28:38,496 INFO L225 Difference]: With dead ends: 236 [2022-11-02 20:28:38,496 INFO L226 Difference]: Without dead ends: 236 [2022-11-02 20:28:38,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 70.1s TimeCoverageRelationStatistics Valid=130, Invalid=600, Unknown=34, NotChecked=106, Total=870 [2022-11-02 20:28:38,497 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 69 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 225 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:28:38,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 782 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 238 Invalid, 0 Unknown, 225 Unchecked, 0.2s Time] [2022-11-02 20:28:38,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-11-02 20:28:38,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 217. [2022-11-02 20:28:38,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 201 states have (on average 1.2338308457711442) internal successors, (248), 216 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:38,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 248 transitions. [2022-11-02 20:28:38,502 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 248 transitions. Word has length 31 [2022-11-02 20:28:38,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:28:38,502 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 248 transitions. [2022-11-02 20:28:38,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.0) internal successors, (69), 24 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:38,503 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 248 transitions. [2022-11-02 20:28:38,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-02 20:28:38,503 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:28:38,503 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:38,539 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:28:38,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-11-02 20:28:38,723 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:28:38,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:38,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1483366934, now seen corresponding path program 1 times [2022-11-02 20:28:38,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:38,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707685398] [2022-11-02 20:28:38,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:38,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:38,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:39,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:39,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:39,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707685398] [2022-11-02 20:28:39,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707685398] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:28:39,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089375844] [2022-11-02 20:28:39,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:39,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:28:39,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:28:39,246 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:28:39,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d8f6431-66d5-4ce0-a30d-87a2fdcb915e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 20:28:39,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:39,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-02 20:28:39,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:28:39,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:28:39,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:28:39,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:28:39,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:28:39,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:28:39,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:28:39,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:28:39,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:28:39,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:28:39,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:28:39,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:28:39,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:28:39,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:28:39,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:28:42,620 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 20:28:42,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 35 [2022-11-02 20:28:42,628 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 20:28:42,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 20 [2022-11-02 20:28:42,634 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:28:42,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:28:42,858 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:28:42,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 62 [2022-11-02 20:28:49,457 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_64| Int)) (or (not (<= |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_64|)) (forall ((v_ArrVal_1323 Int) (v_ArrVal_1326 Int)) (let ((.cse6 (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_64|))) (let ((.cse4 (store .cse7 .cse6 v_ArrVal_1326))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~head~0#1.offset|))) (< (let ((.cse1 (store .cse5 .cse6 v_ArrVal_1323))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| .cse4)) (.cse2 (select .cse1 |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| .cse1) .cse2) .cse3)) (select (select .cse0 .cse2) .cse3)))) (+ .cse3 1)))))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_64| Int)) (or (not (<= |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_64|)) (forall ((v_ArrVal_1323 Int) (v_ArrVal_1326 Int)) (let ((.cse13 (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_64|))) (let ((.cse11 (store .cse5 .cse13 v_ArrVal_1323))) (let ((.cse9 (select .cse11 |c_ULTIMATE.start_main_~head~0#1.offset|))) (= (let ((.cse12 (store .cse7 .cse13 v_ArrVal_1326))) (let ((.cse10 (select .cse12 |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| .cse11))) (select .cse8 (select (select .cse8 .cse9) .cse10))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| .cse12) .cse9) .cse10)))) .cse9))))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_64| Int)) (or (not (<= |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_64|)) (forall ((v_ArrVal_1323 Int) (v_ArrVal_1326 Int)) (<= 0 (+ 8 (let ((.cse19 (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_64|))) (let ((.cse15 (store .cse5 .cse19 v_ArrVal_1323)) (.cse18 (store .cse7 .cse19 v_ArrVal_1326))) (let ((.cse14 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| .cse18)) (.cse16 (select .cse15 |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse17 (select .cse18 |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select .cse14 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| .cse15) .cse16) .cse17)) (select (select .cse14 .cse16) .cse17)))))))))))) is different from false [2022-11-02 20:28:51,493 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse6 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1321 Int) (v_ArrVal_1322 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_64| Int)) (or (not (<= |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_64|)) (forall ((v_ArrVal_1323 Int) (v_ArrVal_1326 Int)) (let ((.cse7 (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_64|))) (let ((.cse4 (store (store .cse8 .cse6 v_ArrVal_1321) .cse7 v_ArrVal_1326))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~head~0#1.offset|))) (< (let ((.cse1 (store (store .cse5 .cse6 v_ArrVal_1322) .cse7 v_ArrVal_1323))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| .cse4)) (.cse2 (select .cse1 |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| .cse1) .cse2) .cse3)) (select (select .cse0 .cse2) .cse3)))) (+ .cse3 1)))))))) (forall ((v_ArrVal_1321 Int) (v_ArrVal_1322 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_64| Int)) (or (not (<= |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_64|)) (forall ((v_ArrVal_1323 Int) (v_ArrVal_1326 Int)) (<= 0 (+ 8 (let ((.cse14 (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_64|))) (let ((.cse10 (store (store .cse5 .cse6 v_ArrVal_1322) .cse14 v_ArrVal_1323)) (.cse13 (store (store .cse8 .cse6 v_ArrVal_1321) .cse14 v_ArrVal_1326))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| .cse13)) (.cse11 (select .cse10 |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse12 (select .cse13 |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select .cse9 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| .cse10) .cse11) .cse12)) (select (select .cse9 .cse11) .cse12)))))))))) (forall ((v_ArrVal_1321 Int) (v_ArrVal_1322 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_64| Int)) (or (not (<= |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_64|)) (forall ((v_ArrVal_1323 Int) (v_ArrVal_1326 Int)) (let ((.cse20 (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_64|))) (let ((.cse18 (store (store .cse5 .cse6 v_ArrVal_1322) .cse20 v_ArrVal_1323))) (let ((.cse16 (select .cse18 |c_ULTIMATE.start_main_~head~0#1.offset|))) (= (let ((.cse19 (store (store .cse8 .cse6 v_ArrVal_1321) .cse20 v_ArrVal_1326))) (let ((.cse17 (select .cse19 |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| .cse18))) (select .cse15 (select (select .cse15 .cse16) .cse17))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| .cse19) .cse16) .cse17)))) .cse16))))))))) is different from false [2022-11-02 20:29:43,901 WARN L234 SmtUtils]: Spent 12.05s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:29:43,952 INFO L356 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2022-11-02 20:29:43,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 492145 treesize of output 1 [2022-11-02 20:29:43,984 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:29:43,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 6788 treesize of output 6580 [2022-11-02 20:29:44,008 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:29:44,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4264 treesize of output 4216 [2022-11-02 20:29:44,164 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:29:44,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 216924 treesize of output 201564