./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a 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_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R --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 64bit --witnessprinter.graph.data.programhash 7e6a17b7d4143542ba439290f9741c160a8cb32cc90a0cc2a238a67702990ba0 --- 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-38b53e6 [2022-11-25 18:25:49,566 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:25:49,568 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:25:49,594 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:25:49,595 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:25:49,598 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:25:49,601 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:25:49,604 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:25:49,606 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:25:49,611 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:25:49,613 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:25:49,615 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:25:49,616 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:25:49,619 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:25:49,620 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:25:49,622 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:25:49,624 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:25:49,625 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:25:49,627 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:25:49,634 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:25:49,635 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:25:49,637 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:25:49,639 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:25:49,639 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:25:49,650 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:25:49,650 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:25:49,651 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:25:49,653 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:25:49,653 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:25:49,654 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:25:49,655 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:25:49,656 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:25:49,658 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:25:49,660 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:25:49,662 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:25:49,663 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:25:49,663 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:25:49,664 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:25:49,664 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:25:49,666 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:25:49,667 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:25:49,667 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2022-11-25 18:25:49,711 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:25:49,711 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:25:49,712 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:25:49,712 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:25:49,713 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:25:49,714 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:25:49,714 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:25:49,715 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:25:49,715 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:25:49,715 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:25:49,716 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 18:25:49,717 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:25:49,717 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:25:49,717 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 18:25:49,717 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 18:25:49,718 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 18:25:49,718 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:25:49,718 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 18:25:49,718 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:25:49,719 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:25:49,719 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:25:49,719 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:25:49,719 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:25:49,720 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:25:49,720 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:25:49,720 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:25:49,721 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:25:49,721 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:25:49,722 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:25:49,722 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:25:49,722 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R/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_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7e6a17b7d4143542ba439290f9741c160a8cb32cc90a0cc2a238a67702990ba0 [2022-11-25 18:25:50,042 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:25:50,074 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:25:50,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:25:50,079 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:25:50,079 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:25:50,081 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2022-11-25 18:25:53,234 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:25:53,467 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:25:53,468 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2022-11-25 18:25:53,474 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R/data/076a0c108/02876d7364864a968b24422e4e7fbe7e/FLAG8aa0a7008 [2022-11-25 18:25:53,497 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R/data/076a0c108/02876d7364864a968b24422e4e7fbe7e [2022-11-25 18:25:53,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:25:53,503 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:25:53,506 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:25:53,507 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:25:53,511 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:25:53,512 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:25:53" (1/1) ... [2022-11-25 18:25:53,513 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@586ba4ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:25:53, skipping insertion in model container [2022-11-25 18:25:53,513 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:25:53" (1/1) ... [2022-11-25 18:25:53,521 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:25:53,540 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:25:53,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:25:53,763 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:25:53,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:25:53,799 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:25:53,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:25:53 WrapperNode [2022-11-25 18:25:53,800 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:25:53,801 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:25:53,802 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:25:53,802 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:25:53,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:25:53" (1/1) ... [2022-11-25 18:25:53,820 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:25:53" (1/1) ... [2022-11-25 18:25:53,842 INFO L138 Inliner]: procedures = 7, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 61 [2022-11-25 18:25:53,842 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:25:53,843 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:25:53,843 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:25:53,843 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:25:53,853 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:25:53" (1/1) ... [2022-11-25 18:25:53,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:25:53" (1/1) ... [2022-11-25 18:25:53,864 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:25:53" (1/1) ... [2022-11-25 18:25:53,865 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:25:53" (1/1) ... [2022-11-25 18:25:53,868 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:25:53" (1/1) ... [2022-11-25 18:25:53,871 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:25:53" (1/1) ... [2022-11-25 18:25:53,872 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:25:53" (1/1) ... [2022-11-25 18:25:53,873 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:25:53" (1/1) ... [2022-11-25 18:25:53,886 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:25:53,887 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:25:53,887 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:25:53,888 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:25:53,888 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:25:53" (1/1) ... [2022-11-25 18:25:53,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:25:53,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:25:53,924 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:25:53,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:25:53,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 18:25:53,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:25:53,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:25:53,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 18:25:53,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 18:25:53,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:25:54,067 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:25:54,069 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:25:54,306 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:25:54,313 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:25:54,313 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-25 18:25:54,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:25:54 BoogieIcfgContainer [2022-11-25 18:25:54,315 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:25:54,318 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:25:54,318 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:25:54,322 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:25:54,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:25:53" (1/3) ... [2022-11-25 18:25:54,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f1887e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:25:54, skipping insertion in model container [2022-11-25 18:25:54,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:25:53" (2/3) ... [2022-11-25 18:25:54,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f1887e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:25:54, skipping insertion in model container [2022-11-25 18:25:54,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:25:54" (3/3) ... [2022-11-25 18:25:54,326 INFO L112 eAbstractionObserver]: Analyzing ICFG 4BitCounterPointer.c [2022-11-25 18:25:54,359 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:25:54,359 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2022-11-25 18:25:54,424 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:25:54,432 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@49b13584, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:25:54,433 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2022-11-25 18:25:54,438 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 24 states have (on average 2.5) internal successors, (60), 55 states have internal predecessors, (60), 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-25 18:25:54,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 18:25:54,445 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:25:54,445 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 18:25:54,446 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 18:25:54,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:25:54,453 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-11-25 18:25:54,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:25:54,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596980685] [2022-11-25 18:25:54,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:25:54,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:25:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:55,159 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-25 18:25:55,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:25:55,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596980685] [2022-11-25 18:25:55,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596980685] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:25:55,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:25:55,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:25:55,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944260323] [2022-11-25 18:25:55,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:25:55,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:25:55,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:25:55,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:25:55,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:25:55,218 INFO L87 Difference]: Start difference. First operand has 56 states, 24 states have (on average 2.5) internal successors, (60), 55 states have internal predecessors, (60), 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-25 18:25:55,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:25:55,341 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2022-11-25 18:25:55,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:25:55,344 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-25 18:25:55,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:25:55,354 INFO L225 Difference]: With dead ends: 52 [2022-11-25 18:25:55,354 INFO L226 Difference]: Without dead ends: 50 [2022-11-25 18:25:55,357 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-25 18:25:55,365 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 49 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:25:55,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 25 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:25:55,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-25 18:25:55,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-11-25 18:25:55,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 49 states have internal predecessors, (53), 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-25 18:25:55,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2022-11-25 18:25:55,410 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 3 [2022-11-25 18:25:55,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:25:55,410 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2022-11-25 18:25:55,411 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-25 18:25:55,411 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2022-11-25 18:25:55,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 18:25:55,412 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:25:55,412 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 18:25:55,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:25:55,413 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 18:25:55,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:25:55,417 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-11-25 18:25:55,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:25:55,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794821256] [2022-11-25 18:25:55,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:25:55,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:25:55,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:55,735 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-25 18:25:55,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:25:55,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794821256] [2022-11-25 18:25:55,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794821256] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:25:55,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:25:55,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:25:55,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617705165] [2022-11-25 18:25:55,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:25:55,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:25:55,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:25:55,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:25:55,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:25:55,741 INFO L87 Difference]: Start difference. First operand 50 states and 53 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-25 18:25:55,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:25:55,799 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-11-25 18:25:55,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:25:55,800 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-25 18:25:55,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:25:55,801 INFO L225 Difference]: With dead ends: 46 [2022-11-25 18:25:55,801 INFO L226 Difference]: Without dead ends: 46 [2022-11-25 18:25:55,802 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-25 18:25:55,803 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 47 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:25:55,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 24 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:25:55,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-25 18:25:55,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-11-25 18:25:55,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 23 states have (on average 2.130434782608696) internal successors, (49), 45 states have internal predecessors, (49), 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-25 18:25:55,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2022-11-25 18:25:55,810 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 3 [2022-11-25 18:25:55,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:25:55,810 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2022-11-25 18:25:55,810 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-25 18:25:55,811 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-11-25 18:25:55,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 18:25:55,811 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:25:55,811 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 18:25:55,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:25:55,812 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 18:25:55,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:25:55,813 INFO L85 PathProgramCache]: Analyzing trace with hash 925543, now seen corresponding path program 1 times [2022-11-25 18:25:55,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:25:55,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936653798] [2022-11-25 18:25:55,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:25:55,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:25:55,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:55,941 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-25 18:25:55,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:25:55,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936653798] [2022-11-25 18:25:55,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936653798] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:25:55,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:25:55,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:25:55,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313140328] [2022-11-25 18:25:55,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:25:55,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:25:55,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:25:55,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:25:55,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:25:55,945 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:25:55,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:25:55,994 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2022-11-25 18:25:55,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:25:55,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-25 18:25:55,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:25:55,996 INFO L225 Difference]: With dead ends: 42 [2022-11-25 18:25:55,996 INFO L226 Difference]: Without dead ends: 42 [2022-11-25 18:25:55,996 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-25 18:25:55,998 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 40 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:25:55,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 18 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:25:55,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-25 18:25:56,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-11-25 18:25:56,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 41 states have internal predecessors, (45), 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-25 18:25:56,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-11-25 18:25:56,004 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 4 [2022-11-25 18:25:56,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:25:56,004 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-11-25 18:25:56,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:25:56,005 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-11-25 18:25:56,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 18:25:56,005 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:25:56,005 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 18:25:56,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 18:25:56,006 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 18:25:56,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:25:56,007 INFO L85 PathProgramCache]: Analyzing trace with hash 925544, now seen corresponding path program 1 times [2022-11-25 18:25:56,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:25:56,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993038600] [2022-11-25 18:25:56,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:25:56,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:25:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:56,178 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-25 18:25:56,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:25:56,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993038600] [2022-11-25 18:25:56,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993038600] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:25:56,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:25:56,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:25:56,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136440237] [2022-11-25 18:25:56,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:25:56,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:25:56,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:25:56,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:25:56,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:25:56,183 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:25:56,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:25:56,240 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-11-25 18:25:56,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:25:56,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-25 18:25:56,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:25:56,241 INFO L225 Difference]: With dead ends: 38 [2022-11-25 18:25:56,242 INFO L226 Difference]: Without dead ends: 38 [2022-11-25 18:25:56,242 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-25 18:25:56,244 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 38 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:25:56,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 20 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:25:56,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-25 18:25:56,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-11-25 18:25:56,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 37 states have internal predecessors, (41), 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-25 18:25:56,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-11-25 18:25:56,249 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 4 [2022-11-25 18:25:56,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:25:56,250 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-11-25 18:25:56,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:25:56,250 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-11-25 18:25:56,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 18:25:56,251 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:25:56,251 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 18:25:56,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 18:25:56,252 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 18:25:56,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:25:56,252 INFO L85 PathProgramCache]: Analyzing trace with hash 28691812, now seen corresponding path program 1 times [2022-11-25 18:25:56,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:25:56,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152791890] [2022-11-25 18:25:56,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:25:56,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:25:56,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:56,341 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-25 18:25:56,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:25:56,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152791890] [2022-11-25 18:25:56,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152791890] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:25:56,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:25:56,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:25:56,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334798576] [2022-11-25 18:25:56,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:25:56,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:25:56,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:25:56,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:25:56,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:25:56,344 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:25:56,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:25:56,381 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-11-25 18:25:56,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:25:56,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-25 18:25:56,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:25:56,383 INFO L225 Difference]: With dead ends: 34 [2022-11-25 18:25:56,383 INFO L226 Difference]: Without dead ends: 34 [2022-11-25 18:25:56,383 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-25 18:25:56,384 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 31 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:25:56,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 14 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:25:56,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-25 18:25:56,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-11-25 18:25:56,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.608695652173913) internal successors, (37), 33 states have internal predecessors, (37), 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-25 18:25:56,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-11-25 18:25:56,389 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 5 [2022-11-25 18:25:56,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:25:56,389 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-11-25 18:25:56,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:25:56,390 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-11-25 18:25:56,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 18:25:56,390 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:25:56,391 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 18:25:56,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 18:25:56,391 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 18:25:56,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:25:56,392 INFO L85 PathProgramCache]: Analyzing trace with hash 28691813, now seen corresponding path program 1 times [2022-11-25 18:25:56,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:25:56,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193597527] [2022-11-25 18:25:56,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:25:56,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:25:56,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:56,499 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-25 18:25:56,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:25:56,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193597527] [2022-11-25 18:25:56,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193597527] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:25:56,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:25:56,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:25:56,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066175797] [2022-11-25 18:25:56,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:25:56,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:25:56,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:25:56,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:25:56,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:25:56,503 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:25:56,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:25:56,535 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-11-25 18:25:56,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:25:56,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-25 18:25:56,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:25:56,537 INFO L225 Difference]: With dead ends: 30 [2022-11-25 18:25:56,537 INFO L226 Difference]: Without dead ends: 30 [2022-11-25 18:25:56,537 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-25 18:25:56,538 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 29 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:25:56,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 16 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:25:56,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-25 18:25:56,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-25 18:25:56,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.434782608695652) internal successors, (33), 29 states have internal predecessors, (33), 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-25 18:25:56,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-11-25 18:25:56,543 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 5 [2022-11-25 18:25:56,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:25:56,543 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-11-25 18:25:56,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:25:56,544 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-11-25 18:25:56,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 18:25:56,544 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:25:56,544 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 18:25:56,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 18:25:56,545 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 18:25:56,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:25:56,546 INFO L85 PathProgramCache]: Analyzing trace with hash 889446154, now seen corresponding path program 1 times [2022-11-25 18:25:56,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:25:56,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958964187] [2022-11-25 18:25:56,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:25:56,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:25:56,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:56,585 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-25 18:25:56,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:25:56,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958964187] [2022-11-25 18:25:56,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958964187] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:25:56,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:25:56,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:25:56,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155787817] [2022-11-25 18:25:56,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:25:56,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:25:56,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:25:56,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:25:56,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:25:56,589 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-25 18:25:56,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:25:56,621 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-11-25 18:25:56,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:25:56,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-11-25 18:25:56,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:25:56,622 INFO L225 Difference]: With dead ends: 27 [2022-11-25 18:25:56,623 INFO L226 Difference]: Without dead ends: 27 [2022-11-25 18:25:56,623 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-25 18:25:56,624 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:25:56,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 11 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:25:56,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-25 18:25:56,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-11-25 18:25:56,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:25:56,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-11-25 18:25:56,628 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 6 [2022-11-25 18:25:56,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:25:56,629 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-11-25 18:25:56,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-25 18:25:56,629 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-11-25 18:25:56,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 18:25:56,630 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:25:56,630 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 18:25:56,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 18:25:56,631 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 18:25:56,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:25:56,631 INFO L85 PathProgramCache]: Analyzing trace with hash 889446155, now seen corresponding path program 1 times [2022-11-25 18:25:56,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:25:56,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073073591] [2022-11-25 18:25:56,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:25:56,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:25:56,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:56,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:25:56,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:25:56,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073073591] [2022-11-25 18:25:56,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073073591] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:25:56,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:25:56,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:25:56,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192670126] [2022-11-25 18:25:56,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:25:56,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:25:56,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:25:56,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:25:56,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:25:56,711 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-25 18:25:56,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:25:56,735 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-11-25 18:25:56,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:25:56,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-11-25 18:25:56,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:25:56,737 INFO L225 Difference]: With dead ends: 24 [2022-11-25 18:25:56,737 INFO L226 Difference]: Without dead ends: 24 [2022-11-25 18:25:56,737 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-25 18:25:56,738 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:25:56,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 13 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:25:56,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-25 18:25:56,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-11-25 18:25:56,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 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-25 18:25:56,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-11-25 18:25:56,742 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 6 [2022-11-25 18:25:56,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:25:56,743 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-11-25 18:25:56,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-25 18:25:56,743 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-11-25 18:25:56,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-25 18:25:56,744 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:25:56,744 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:25:56,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 18:25:56,744 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 18:25:56,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:25:56,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1115961648, now seen corresponding path program 1 times [2022-11-25 18:25:56,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:25:56,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872536435] [2022-11-25 18:25:56,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:25:56,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:25:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:56,809 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-25 18:25:56,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:25:56,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872536435] [2022-11-25 18:25:56,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872536435] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:25:56,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:25:56,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:25:56,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369254821] [2022-11-25 18:25:56,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:25:56,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:25:56,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:25:56,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:25:56,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:25:56,812 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-25 18:25:56,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:25:56,869 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-11-25 18:25:56,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:25:56,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2022-11-25 18:25:56,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:25:56,870 INFO L225 Difference]: With dead ends: 39 [2022-11-25 18:25:56,870 INFO L226 Difference]: Without dead ends: 39 [2022-11-25 18:25:56,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:25:56,872 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 11 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:25:56,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 39 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:25:56,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-25 18:25:56,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2022-11-25 18:25:56,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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-25 18:25:56,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-11-25 18:25:56,876 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 10 [2022-11-25 18:25:56,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:25:56,876 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-11-25 18:25:56,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-25 18:25:56,877 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-11-25 18:25:56,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 18:25:56,877 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:25:56,878 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:25:56,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 18:25:56,878 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 18:25:56,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:25:56,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1456723757, now seen corresponding path program 1 times [2022-11-25 18:25:56,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:25:56,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806588201] [2022-11-25 18:25:56,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:25:56,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:25:56,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:57,176 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-25 18:25:57,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:25:57,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806588201] [2022-11-25 18:25:57,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806588201] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:25:57,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979049391] [2022-11-25 18:25:57,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:25:57,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:25:57,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:25:57,181 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:25:57,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 18:25:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:57,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-25 18:25:57,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:25:57,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-11-25 18:25:57,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:25:57,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 18:25:57,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 18:25:57,447 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-25 18:25:57,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:25:59,572 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:25:59,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-11-25 18:25:59,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-11-25 18:25:59,598 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-25 18:25:59,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979049391] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:25:59,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:25:59,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2022-11-25 18:25:59,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525143094] [2022-11-25 18:25:59,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:25:59,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:25:59,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:25:59,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:25:59,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=24, Unknown=3, NotChecked=0, Total=42 [2022-11-25 18:25:59,601 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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-25 18:25:59,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:25:59,718 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-11-25 18:25:59,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:25:59,718 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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 15 [2022-11-25 18:25:59,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:25:59,719 INFO L225 Difference]: With dead ends: 41 [2022-11-25 18:25:59,719 INFO L226 Difference]: Without dead ends: 41 [2022-11-25 18:25:59,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=22, Invalid=31, Unknown=3, NotChecked=0, Total=56 [2022-11-25 18:25:59,720 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 31 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:25:59,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 58 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:25:59,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-25 18:25:59,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2022-11-25 18:25:59,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 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-25 18:25:59,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-11-25 18:25:59,724 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 15 [2022-11-25 18:25:59,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:25:59,724 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-11-25 18:25:59,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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-25 18:25:59,732 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-11-25 18:25:59,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 18:25:59,733 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:25:59,733 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:25:59,754 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 18:25:59,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-25 18:25:59,934 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 18:25:59,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:25:59,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1715432197, now seen corresponding path program 1 times [2022-11-25 18:25:59,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:25:59,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440586993] [2022-11-25 18:25:59,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:25:59,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:25:59,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:00,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:26:00,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:26:00,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440586993] [2022-11-25 18:26:00,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440586993] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:26:00,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:26:00,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 18:26:00,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326600850] [2022-11-25 18:26:00,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:26:00,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:26:00,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:26:00,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:26:00,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:26:00,772 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 8 states, 8 states have (on average 2.25) 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-25 18:26:01,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:26:01,353 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-11-25 18:26:01,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:26:01,354 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) 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-25 18:26:01,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:26:01,354 INFO L225 Difference]: With dead ends: 55 [2022-11-25 18:26:01,354 INFO L226 Difference]: Without dead ends: 55 [2022-11-25 18:26:01,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:26:01,355 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 64 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:26:01,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 72 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:26:01,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-25 18:26:01,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 33. [2022-11-25 18:26:01,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 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-25 18:26:01,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-11-25 18:26:01,359 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 18 [2022-11-25 18:26:01,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:26:01,359 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-11-25 18:26:01,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) 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-25 18:26:01,359 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-11-25 18:26:01,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 18:26:01,360 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:26:01,360 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:26:01,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 18:26:01,360 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 18:26:01,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:26:01,361 INFO L85 PathProgramCache]: Analyzing trace with hash -2128935000, now seen corresponding path program 1 times [2022-11-25 18:26:01,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:26:01,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633436505] [2022-11-25 18:26:01,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:26:01,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:26:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:01,964 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:26:01,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:26:01,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633436505] [2022-11-25 18:26:01,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633436505] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:26:01,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758044821] [2022-11-25 18:26:01,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:26:01,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:26:01,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:26:01,967 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:26:01,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 18:26:02,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:02,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-25 18:26:02,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:26:02,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2022-11-25 18:26:02,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:26:02,364 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 18:26:02,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 25 [2022-11-25 18:26:02,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 18:26:02,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 18:26:02,465 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:26:02,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:26:02,483 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_326 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_326) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) is different from false [2022-11-25 18:26:08,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2022-11-25 18:26:08,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-11-25 18:26:08,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2022-11-25 18:26:08,882 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:26:08,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758044821] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:26:08,883 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:26:08,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 22 [2022-11-25 18:26:08,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813363609] [2022-11-25 18:26:08,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:26:08,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-25 18:26:08,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:26:08,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-25 18:26:08,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=325, Unknown=12, NotChecked=38, Total=462 [2022-11-25 18:26:08,887 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 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-25 18:26:11,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:26:13,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:26:15,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:26:17,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:26:19,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:26:21,726 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (.cse1 (not (= |c_ULTIMATE.start_main_~x3~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)))) (and (or (not .cse0) (= |c_ULTIMATE.start_main_~x0~0#1.offset| |c_ULTIMATE.start_main_~x3~0#1.offset|)) .cse1 (= |c_ULTIMATE.start_main_~x0~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x3~0#1.offset| 0) (forall ((v_ArrVal_326 (Array Int Int)) (v_ArrVal_325 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_325) |c_ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_326) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|))) (or .cse0 (and .cse1 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0))))) is different from false [2022-11-25 18:26:23,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:26:25,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:26:26,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:26:26,310 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2022-11-25 18:26:26,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 18:26:26,310 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 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-25 18:26:26,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:26:26,311 INFO L225 Difference]: With dead ends: 97 [2022-11-25 18:26:26,311 INFO L226 Difference]: Without dead ends: 97 [2022-11-25 18:26:26,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=329, Invalid=925, Unknown=14, NotChecked=138, Total=1406 [2022-11-25 18:26:26,313 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 113 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 48 mSolverCounterUnsat, 57 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 57 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 14.8s IncrementalHoareTripleChecker+Time [2022-11-25 18:26:26,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 176 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 291 Invalid, 57 Unknown, 48 Unchecked, 14.8s Time] [2022-11-25 18:26:26,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-25 18:26:26,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 60. [2022-11-25 18:26:26,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 59 states have internal predecessors, (72), 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-25 18:26:26,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2022-11-25 18:26:26,318 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 23 [2022-11-25 18:26:26,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:26:26,318 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2022-11-25 18:26:26,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 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-25 18:26:26,319 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2022-11-25 18:26:26,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 18:26:26,319 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:26:26,320 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:26:26,331 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 18:26:26,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:26:26,526 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 18:26:26,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:26:26,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1038287010, now seen corresponding path program 1 times [2022-11-25 18:26:26,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:26:26,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187541998] [2022-11-25 18:26:26,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:26:26,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:26:26,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:27,481 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:26:27,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:26:27,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187541998] [2022-11-25 18:26:27,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187541998] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:26:27,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341244025] [2022-11-25 18:26:27,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:26:27,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:26:27,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:26:27,484 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:26:27,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 18:26:27,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:27,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-25 18:26:27,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:26:27,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 414 treesize of output 406 [2022-11-25 18:26:27,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:26:27,834 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 18:26:27,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-25 18:26:28,062 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 18:26:28,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 25 [2022-11-25 18:26:28,140 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 18:26:28,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-25 18:26:28,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 18:26:28,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 18:26:28,248 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:26:28,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:26:30,798 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:26:30,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 40 [2022-11-25 18:26:30,813 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:26:30,814 INFO L350 Elim1Store]: Elim1 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 390 treesize of output 382 [2022-11-25 18:26:30,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 368 treesize of output 344 [2022-11-25 18:26:30,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 356 treesize of output 346 [2022-11-25 18:26:31,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 246 treesize of output 238 [2022-11-25 18:26:31,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 111 [2022-11-25 18:26:31,635 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:26:31,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341244025] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:26:31,635 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:26:31,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 29 [2022-11-25 18:26:31,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061864220] [2022-11-25 18:26:31,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:26:31,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-25 18:26:31,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:26:31,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-25 18:26:31,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=630, Unknown=35, NotChecked=0, Total=812 [2022-11-25 18:26:31,642 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand has 29 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 29 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-25 18:26:32,390 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|))) (and (or (not .cse0) (= |c_ULTIMATE.start_main_~x0~0#1.offset| |c_ULTIMATE.start_main_~x3~0#1.offset|)) (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_402))) (store .cse1 |ULTIMATE.start_main_~x1~0#1.base| (store (select .cse1 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0))) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) (= |c_ULTIMATE.start_main_~x0~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x3~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (or .cse0 (and (or (= |c_ULTIMATE.start_main_~x3~0#1.offset| |c_ULTIMATE.start_main_~x1~0#1.offset|) (not (= |c_ULTIMATE.start_main_~x3~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0))))) is different from false [2022-11-25 18:26:32,424 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|))) (and (or (not .cse0) (= |c_ULTIMATE.start_main_~x0~0#1.offset| |c_ULTIMATE.start_main_~x3~0#1.offset|)) (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_402))) (store .cse1 |ULTIMATE.start_main_~x1~0#1.base| (store (select .cse1 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0))) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) (forall ((|ULTIMATE.start_main_~x0~0#1.base| Int)) (or (not (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~x0~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |c_ULTIMATE.start_main_~x0~0#1.offset| 1)) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store (let ((.cse2 (store |c_#memory_int| |ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_402))) (store .cse2 |ULTIMATE.start_main_~x1~0#1.base| (store (select .cse2 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0))) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)))) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (or .cse0 (and (or (= |c_ULTIMATE.start_main_~x3~0#1.offset| |c_ULTIMATE.start_main_~x1~0#1.offset|) (not (= |c_ULTIMATE.start_main_~x3~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0))))) is different from false [2022-11-25 18:26:32,489 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|))) (and (or (not .cse0) (= |c_ULTIMATE.start_main_~x0~0#1.offset| |c_ULTIMATE.start_main_~x3~0#1.offset|)) (forall ((|ULTIMATE.start_main_~x0~0#1.base| Int)) (or (not (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~x0~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |c_ULTIMATE.start_main_~x0~0#1.offset| 1)) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_402))) (store .cse1 |ULTIMATE.start_main_~x1~0#1.base| (store (select .cse1 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0))) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)))) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (or .cse0 (and (or (= |c_ULTIMATE.start_main_~x3~0#1.offset| |c_ULTIMATE.start_main_~x1~0#1.offset|) (not (= |c_ULTIMATE.start_main_~x3~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0))))) is different from false [2022-11-25 18:26:39,389 WARN L233 SmtUtils]: Spent 6.25s on a formula simplification. DAG size of input: 44 DAG size of output: 34 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:26:53,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:26:53,196 INFO L93 Difference]: Finished difference Result 306 states and 363 transitions. [2022-11-25 18:26:53,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-25 18:26:53,197 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 29 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 26 [2022-11-25 18:26:53,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:26:53,198 INFO L225 Difference]: With dead ends: 306 [2022-11-25 18:26:53,198 INFO L226 Difference]: Without dead ends: 306 [2022-11-25 18:26:53,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1134 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=922, Invalid=2876, Unknown=120, NotChecked=372, Total=4290 [2022-11-25 18:26:53,201 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 239 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 120 mSolverCounterUnsat, 262 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 262 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:26:53,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 242 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 491 Invalid, 262 Unknown, 15 Unchecked, 2.4s Time] [2022-11-25 18:26:53,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-11-25 18:26:53,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 173. [2022-11-25 18:26:53,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 172 states have (on average 1.2674418604651163) internal successors, (218), 172 states have internal predecessors, (218), 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-25 18:26:53,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 218 transitions. [2022-11-25 18:26:53,212 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 218 transitions. Word has length 26 [2022-11-25 18:26:53,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:26:53,213 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 218 transitions. [2022-11-25 18:26:53,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 29 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-25 18:26:53,213 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 218 transitions. [2022-11-25 18:26:53,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 18:26:53,214 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:26:53,214 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:26:53,225 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 18:26:53,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:26:53,421 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 18:26:53,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:26:53,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1790452235, now seen corresponding path program 1 times [2022-11-25 18:26:53,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:26:53,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409983081] [2022-11-25 18:26:53,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:26:53,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:26:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:54,094 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:26:54,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:26:54,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409983081] [2022-11-25 18:26:54,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409983081] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:26:54,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536528134] [2022-11-25 18:26:54,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:26:54,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:26:54,095 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:26:54,098 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:26:54,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 18:26:54,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:54,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-25 18:26:54,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:26:54,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:26:54,320 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 18:26:54,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-25 18:26:54,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 18:26:54,470 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 18:26:54,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-11-25 18:26:54,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 18:26:54,756 INFO L321 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2022-11-25 18:26:54,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 49 [2022-11-25 18:26:54,910 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 18:26:54,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-25 18:26:54,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 18:26:54,955 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:26:54,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:26:55,223 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x3~0#1.base| Int) (|ULTIMATE.start_main_~x0~0#1.base| Int) (v_ArrVal_481 (Array Int Int)) (v_ArrVal_480 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |ULTIMATE.start_main_~x3~0#1.base| v_ArrVal_480))) (or (not (= (select (select (store .cse0 |ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_481) |ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) (= (select (select (store .cse0 |ULTIMATE.start_main_~x0~0#1.base| (store v_ArrVal_481 |c_ULTIMATE.start_main_~x0~0#1.offset| 0)) |c_ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0)))) is different from false [2022-11-25 18:26:55,234 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:26:55,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 39 [2022-11-25 18:26:55,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 80 [2022-11-25 18:26:55,250 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:26:55,251 INFO L350 Elim1Store]: Elim1 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 79 treesize of output 81 [2022-11-25 18:26:55,265 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:26:55,266 INFO L350 Elim1Store]: Elim1 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 47 treesize of output 51 [2022-11-25 18:26:55,382 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:26:55,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536528134] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:26:55,382 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:26:55,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 10] total 23 [2022-11-25 18:26:55,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136623395] [2022-11-25 18:26:55,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:26:55,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-25 18:26:55,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:26:55,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-25 18:26:55,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=359, Unknown=12, NotChecked=40, Total=506 [2022-11-25 18:26:55,386 INFO L87 Difference]: Start difference. First operand 173 states and 218 transitions. Second operand has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:26:55,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:26:55,721 INFO L93 Difference]: Finished difference Result 225 states and 276 transitions. [2022-11-25 18:26:55,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:26:55,722 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-25 18:26:55,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:26:55,723 INFO L225 Difference]: With dead ends: 225 [2022-11-25 18:26:55,723 INFO L226 Difference]: Without dead ends: 225 [2022-11-25 18:26:55,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=167, Invalid=475, Unknown=12, NotChecked=48, Total=702 [2022-11-25 18:26:55,724 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 77 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:26:55,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 77 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 123 Invalid, 0 Unknown, 26 Unchecked, 0.2s Time] [2022-11-25 18:26:55,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-11-25 18:26:55,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 217. [2022-11-25 18:26:55,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.2453703703703705) internal successors, (269), 216 states have internal predecessors, (269), 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-25 18:26:55,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 269 transitions. [2022-11-25 18:26:55,733 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 269 transitions. Word has length 27 [2022-11-25 18:26:55,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:26:55,734 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 269 transitions. [2022-11-25 18:26:55,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:26:55,734 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 269 transitions. [2022-11-25 18:26:55,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-25 18:26:55,736 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:26:55,736 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:26:55,755 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 18:26:55,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:26:55,945 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 18:26:55,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:26:55,946 INFO L85 PathProgramCache]: Analyzing trace with hash -825476096, now seen corresponding path program 1 times [2022-11-25 18:26:55,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:26:55,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438934621] [2022-11-25 18:26:55,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:26:55,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:26:55,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:56,404 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:26:56,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:26:56,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438934621] [2022-11-25 18:26:56,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438934621] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:26:56,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765321422] [2022-11-25 18:26:56,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:26:56,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:26:56,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:26:56,406 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:26:56,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 18:26:56,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:56,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-25 18:26:56,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:26:56,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:26:56,739 INFO L321 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2022-11-25 18:26:56,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 26 [2022-11-25 18:26:56,833 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-25 18:26:56,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 34 [2022-11-25 18:26:56,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 18:26:57,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-11-25 18:26:57,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-25 18:26:57,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2022-11-25 18:26:57,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 18:26:57,183 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 18:26:57,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:26:57,432 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_575 (Array Int Int)) (v_ArrVal_574 (Array Int Int)) (|ULTIMATE.start_main_~x2~0#1.base| Int)) (let ((.cse0 (store (store |c_#memory_int| |ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_574) |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_575))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~x1~0#1.base|))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_main_~x1~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x1~0#1.offset| 0)) |ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0) (= (select .cse1 |c_ULTIMATE.start_main_~x1~0#1.offset|) 0))))) is different from false [2022-11-25 18:26:57,470 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_575 (Array Int Int)) (v_ArrVal_574 (Array Int Int)) (|ULTIMATE.start_main_~x2~0#1.base| Int)) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0)) |ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_574) |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_575))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~x1~0#1.base|))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_main_~x1~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x1~0#1.offset| 0)) |ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0) (= (select .cse1 |c_ULTIMATE.start_main_~x1~0#1.offset|) 0))))) is different from false [2022-11-25 18:26:57,490 WARN L837 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_main_#t~mem6#1| 0) (forall ((v_ArrVal_575 (Array Int Int)) (v_ArrVal_574 (Array Int Int)) (|ULTIMATE.start_main_~x2~0#1.base| Int)) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0)) |ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_574) |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_575))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~x1~0#1.base|))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_main_~x1~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x1~0#1.offset| 0)) |ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0) (= (select .cse1 |c_ULTIMATE.start_main_~x1~0#1.offset|) 0)))))) is different from false [2022-11-25 18:26:57,658 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-25 18:26:57,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 77 [2022-11-25 18:26:57,711 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:26:57,712 INFO L350 Elim1Store]: Elim1 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 655 treesize of output 647 [2022-11-25 18:26:57,734 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:26:57,734 INFO L350 Elim1Store]: Elim1 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 675 treesize of output 643 [2022-11-25 18:26:57,785 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:26:57,785 INFO L350 Elim1Store]: Elim1 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 571 treesize of output 551 [2022-11-25 18:26:57,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-25 18:26:58,910 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:26:58,910 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 25 [2022-11-25 18:26:59,010 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2022-11-25 18:26:59,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765321422] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:26:59,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:26:59,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 13] total 29 [2022-11-25 18:26:59,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475941893] [2022-11-25 18:26:59,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:26:59,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-25 18:26:59,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:26:59,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-25 18:26:59,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=555, Unknown=13, NotChecked=150, Total=812 [2022-11-25 18:26:59,012 INFO L87 Difference]: Start difference. First operand 217 states and 269 transitions. Second operand has 29 states, 29 states have (on average 3.206896551724138) internal successors, (93), 29 states have internal predecessors, (93), 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-25 18:27:01,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:27:01,226 INFO L93 Difference]: Finished difference Result 211 states and 243 transitions. [2022-11-25 18:27:01,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-25 18:27:01,226 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.206896551724138) internal successors, (93), 29 states have internal predecessors, (93), 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 38 [2022-11-25 18:27:01,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:27:01,227 INFO L225 Difference]: With dead ends: 211 [2022-11-25 18:27:01,227 INFO L226 Difference]: Without dead ends: 211 [2022-11-25 18:27:01,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 678 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=669, Invalid=2192, Unknown=13, NotChecked=318, Total=3192 [2022-11-25 18:27:01,229 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 227 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 216 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:27:01,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 153 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 315 Invalid, 0 Unknown, 216 Unchecked, 0.4s Time] [2022-11-25 18:27:01,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-11-25 18:27:01,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 146. [2022-11-25 18:27:01,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 1.206896551724138) internal successors, (175), 145 states have internal predecessors, (175), 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-25 18:27:01,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 175 transitions. [2022-11-25 18:27:01,235 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 175 transitions. Word has length 38 [2022-11-25 18:27:01,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:27:01,235 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 175 transitions. [2022-11-25 18:27:01,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.206896551724138) internal successors, (93), 29 states have internal predecessors, (93), 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-25 18:27:01,236 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 175 transitions. [2022-11-25 18:27:01,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-25 18:27:01,237 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:27:01,237 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:27:01,245 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 18:27:01,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-25 18:27:01,446 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 18:27:01,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:27:01,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1808315229, now seen corresponding path program 1 times [2022-11-25 18:27:01,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:27:01,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563103954] [2022-11-25 18:27:01,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:27:01,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:27:01,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:27:04,499 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 88 proven. 52 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 18:27:04,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:27:04,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563103954] [2022-11-25 18:27:04,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563103954] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:27:04,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933207370] [2022-11-25 18:27:04,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:27:04,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:27:04,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:27:04,502 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:27:04,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 18:27:04,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:27:04,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-25 18:27:04,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:27:06,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:27:06,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:27:06,148 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 18:27:06,697 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_698 Int) (|v_ULTIMATE.start_main_#t~malloc1#1.base_10| Int) (v_ArrVal_696 Int) (|v_ULTIMATE.start_main_#t~malloc3#1.base_10| Int) (|v_ULTIMATE.start_main_#t~malloc2#1.base_10| Int) (|v_ULTIMATE.start_main_#t~malloc0#1.base_10| Int)) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~malloc0#1.base_10| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_main_#t~malloc1#1.base_10| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1#1.base_10|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~malloc0#1.base_10|) 0) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc2#1.base_10|) 0) (= (select (store .cse1 |v_ULTIMATE.start_main_#t~malloc2#1.base_10| 1) |v_ULTIMATE.start_main_#t~malloc3#1.base_10|) 0) (= |c_#valid| (store (store (store (store (store (store .cse1 |v_ULTIMATE.start_main_#t~malloc2#1.base_10| v_ArrVal_698) |v_ULTIMATE.start_main_#t~malloc3#1.base_10| v_ArrVal_696) |v_ULTIMATE.start_main_#t~malloc0#1.base_10| 0) |v_ULTIMATE.start_main_#t~malloc1#1.base_10| 0) |v_ULTIMATE.start_main_#t~malloc2#1.base_10| 0) |v_ULTIMATE.start_main_#t~malloc3#1.base_10| 0)))))) is different from true [2022-11-25 18:27:06,699 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-11-25 18:27:06,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:27:06,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 18:27:07,274 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 85 proven. 10 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-25 18:27:07,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933207370] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:27:07,275 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:27:07,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 6] total 21 [2022-11-25 18:27:07,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169134491] [2022-11-25 18:27:07,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:27:07,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-25 18:27:07,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:27:07,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-25 18:27:07,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=314, Unknown=1, NotChecked=38, Total=462 [2022-11-25 18:27:07,277 INFO L87 Difference]: Start difference. First operand 146 states and 175 transitions. Second operand has 22 states, 21 states have (on average 6.761904761904762) internal successors, (142), 22 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-25 18:27:07,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:27:07,546 INFO L93 Difference]: Finished difference Result 153 states and 182 transitions. [2022-11-25 18:27:07,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:27:07,547 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 6.761904761904762) internal successors, (142), 22 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) Word has length 69 [2022-11-25 18:27:07,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:27:07,548 INFO L225 Difference]: With dead ends: 153 [2022-11-25 18:27:07,548 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 18:27:07,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=132, Invalid=377, Unknown=1, NotChecked=42, Total=552 [2022-11-25 18:27:07,549 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:27:07,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 32 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 31 Unchecked, 0.2s Time] [2022-11-25 18:27:07,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 18:27:07,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 18:27:07,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-25 18:27:07,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 18:27:07,550 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2022-11-25 18:27:07,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:27:07,551 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 18:27:07,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 6.761904761904762) internal successors, (142), 22 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-25 18:27:07,551 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 18:27:07,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 18:27:07,554 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 31 remaining) [2022-11-25 18:27:07,554 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 31 remaining) [2022-11-25 18:27:07,555 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 31 remaining) [2022-11-25 18:27:07,555 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 31 remaining) [2022-11-25 18:27:07,555 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 31 remaining) [2022-11-25 18:27:07,555 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 31 remaining) [2022-11-25 18:27:07,556 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 31 remaining) [2022-11-25 18:27:07,556 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 31 remaining) [2022-11-25 18:27:07,556 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 31 remaining) [2022-11-25 18:27:07,556 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 31 remaining) [2022-11-25 18:27:07,556 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 31 remaining) [2022-11-25 18:27:07,557 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 31 remaining) [2022-11-25 18:27:07,557 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 31 remaining) [2022-11-25 18:27:07,557 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 31 remaining) [2022-11-25 18:27:07,557 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 31 remaining) [2022-11-25 18:27:07,557 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 31 remaining) [2022-11-25 18:27:07,558 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 31 remaining) [2022-11-25 18:27:07,558 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 31 remaining) [2022-11-25 18:27:07,558 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 31 remaining) [2022-11-25 18:27:07,558 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 31 remaining) [2022-11-25 18:27:07,558 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 31 remaining) [2022-11-25 18:27:07,559 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 31 remaining) [2022-11-25 18:27:07,559 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 31 remaining) [2022-11-25 18:27:07,559 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 31 remaining) [2022-11-25 18:27:07,559 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 31 remaining) [2022-11-25 18:27:07,559 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 31 remaining) [2022-11-25 18:27:07,560 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 31 remaining) [2022-11-25 18:27:07,560 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 31 remaining) [2022-11-25 18:27:07,560 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 31 remaining) [2022-11-25 18:27:07,560 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 31 remaining) [2022-11-25 18:27:07,560 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (0 of 31 remaining) [2022-11-25 18:27:07,570 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 18:27:07,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-25 18:27:07,773 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:27:07,775 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 18:27:07,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 06:27:07 BoogieIcfgContainer [2022-11-25 18:27:07,777 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 18:27:07,778 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 18:27:07,778 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 18:27:07,778 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 18:27:07,779 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:25:54" (3/4) ... [2022-11-25 18:27:07,782 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 18:27:07,792 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-11-25 18:27:07,792 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-25 18:27:07,793 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-25 18:27:07,793 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 18:27:07,830 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 18:27:07,830 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 18:27:07,831 INFO L158 Benchmark]: Toolchain (without parser) took 74328.27ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 157.3MB in the beginning and 97.3MB in the end (delta: 60.0MB). Peak memory consumption was 104.5MB. Max. memory is 16.1GB. [2022-11-25 18:27:07,834 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 134.2MB. Free memory is still 78.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 18:27:07,834 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.79ms. Allocated memory is still 201.3MB. Free memory was 156.8MB in the beginning and 146.8MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 18:27:07,834 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.24ms. Allocated memory is still 201.3MB. Free memory was 146.8MB in the beginning and 145.7MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 18:27:07,835 INFO L158 Benchmark]: Boogie Preprocessor took 43.70ms. Allocated memory is still 201.3MB. Free memory was 145.7MB in the beginning and 144.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 18:27:07,835 INFO L158 Benchmark]: RCFGBuilder took 428.46ms. Allocated memory is still 201.3MB. Free memory was 144.1MB in the beginning and 129.6MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-25 18:27:07,835 INFO L158 Benchmark]: TraceAbstraction took 73459.11ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 129.0MB in the beginning and 99.4MB in the end (delta: 29.5MB). Peak memory consumption was 73.0MB. Max. memory is 16.1GB. [2022-11-25 18:27:07,836 INFO L158 Benchmark]: Witness Printer took 52.52ms. Allocated memory is still 243.3MB. Free memory was 99.4MB in the beginning and 97.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 18:27:07,839 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 134.2MB. Free memory is still 78.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 293.79ms. Allocated memory is still 201.3MB. Free memory was 156.8MB in the beginning and 146.8MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.24ms. Allocated memory is still 201.3MB. Free memory was 146.8MB in the beginning and 145.7MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.70ms. Allocated memory is still 201.3MB. Free memory was 145.7MB in the beginning and 144.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 428.46ms. Allocated memory is still 201.3MB. Free memory was 144.1MB in the beginning and 129.6MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 73459.11ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 129.0MB in the beginning and 99.4MB in the end (delta: 29.5MB). Peak memory consumption was 73.0MB. Max. memory is 16.1GB. * Witness Printer took 52.52ms. Allocated memory is still 243.3MB. Free memory was 99.4MB in the beginning and 97.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 6]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 56 locations, 31 error locations. Started 1 CEGAR loops. OverallTime: 73.4s, OverallIterations: 16, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 43.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 319 mSolverCounterUnknown, 1059 SdHoareTripleChecker+Valid, 18.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1059 mSDsluCounter, 990 SdHoareTripleChecker+Invalid, 18.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 336 IncrementalHoareTripleChecker+Unchecked, 744 mSDsCounter, 332 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1716 IncrementalHoareTripleChecker+Invalid, 2703 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 332 mSolverCounterUnsat, 246 mSDtfsCounter, 1716 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 583 GetRequests, 348 SyntacticMatches, 6 SemanticMatches, 229 ConstructedPredicates, 10 IntricatePredicates, 1 DeprecatedPredicates, 2341 ImplicationChecksByTransitivity, 38.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=14, InterpolantAutomatonStates: 153, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 290 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 27.5s InterpolantComputationTime, 460 NumberOfCodeBlocks, 460 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 630 ConstructedInterpolants, 117 QuantifiedInterpolants, 16160 SizeOfPredicates, 85 NumberOfNonLiveVariables, 1464 ConjunctsInSsa, 218 ConjunctsInUnsatCore, 28 InterpolantComputations, 10 PerfectInterpolantSequences, 368/620 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 31 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-25 18:27:07,881 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c82c6008-291b-4a9a-bdc2-b16b26d30c01/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE