./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0232-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0232-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1228d922512a0e9364273220ccc1e5afc3bfb7c0e22f10439a1ba902492e71b2 --- 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 23:32:51,318 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:32:51,320 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:32:51,345 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:32:51,351 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:32:51,356 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:32:51,359 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:32:51,362 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:32:51,364 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:32:51,370 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:32:51,371 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:32:51,374 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:32:51,374 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:32:51,379 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:32:51,381 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:32:51,384 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:32:51,385 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:32:51,386 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:32:51,388 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:32:51,395 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:32:51,398 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:32:51,420 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:32:51,422 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:32:51,423 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:32:51,428 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:32:51,428 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:32:51,428 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:32:51,430 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:32:51,431 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:32:51,431 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:32:51,434 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:32:51,434 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:32:51,437 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:32:51,438 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:32:51,439 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:32:51,439 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:32:51,440 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:32:51,440 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:32:51,441 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:32:51,442 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:32:51,443 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:32:51,456 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-25 23:32:51,486 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:32:51,486 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:32:51,487 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:32:51,487 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:32:51,487 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:32:51,488 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:32:51,488 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:32:51,488 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:32:51,488 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:32:51,488 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 23:32:51,488 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:32:51,489 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:32:51,489 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 23:32:51,489 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 23:32:51,489 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:32:51,489 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 23:32:51,490 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 23:32:51,490 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 23:32:51,490 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 23:32:51,491 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 23:32:51,491 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:32:51,491 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 23:32:51,491 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 23:32:51,491 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:32:51,491 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 23:32:51,492 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:32:51,492 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 23:32:51,492 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 23:32:51,492 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 23:32:51,492 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:32:51,492 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 23:32:51,493 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 23:32:51,493 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:32:51,493 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:32:51,493 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:32:51,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:32:51,494 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:32:51,494 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 23:32:51,494 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:32:51,494 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 23:32:51,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 23:32:51,494 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:32:51,495 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/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_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur 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 -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1228d922512a0e9364273220ccc1e5afc3bfb7c0e22f10439a1ba902492e71b2 [2022-11-25 23:32:51,765 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:32:51,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:32:51,794 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:32:51,795 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:32:51,796 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:32:51,797 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/memsafety/test-0232-1.i [2022-11-25 23:32:55,017 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:32:55,333 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:32:55,333 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/sv-benchmarks/c/memsafety/test-0232-1.i [2022-11-25 23:32:55,346 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/data/0fe58adc7/96c3d48500174d6da7298012f8218cd7/FLAG3c76972a2 [2022-11-25 23:32:55,360 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/data/0fe58adc7/96c3d48500174d6da7298012f8218cd7 [2022-11-25 23:32:55,362 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:32:55,364 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:32:55,365 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:32:55,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:32:55,369 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:32:55,369 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:32:55" (1/1) ... [2022-11-25 23:32:55,370 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f4678b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:32:55, skipping insertion in model container [2022-11-25 23:32:55,371 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:32:55" (1/1) ... [2022-11-25 23:32:55,378 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:32:55,416 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:32:55,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:32:55,750 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:32:55,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:32:55,858 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:32:55,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:32:55 WrapperNode [2022-11-25 23:32:55,859 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:32:55,860 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:32:55,860 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:32:55,860 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:32:55,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:32:55" (1/1) ... [2022-11-25 23:32:55,882 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:32:55" (1/1) ... [2022-11-25 23:32:55,903 INFO L138 Inliner]: procedures = 126, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2022-11-25 23:32:55,903 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:32:55,904 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:32:55,904 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:32:55,904 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:32:55,913 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:32:55" (1/1) ... [2022-11-25 23:32:55,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:32:55" (1/1) ... [2022-11-25 23:32:55,916 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:32:55" (1/1) ... [2022-11-25 23:32:55,916 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:32:55" (1/1) ... [2022-11-25 23:32:55,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:32:55" (1/1) ... [2022-11-25 23:32:55,928 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:32:55" (1/1) ... [2022-11-25 23:32:55,929 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:32:55" (1/1) ... [2022-11-25 23:32:55,931 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:32:55" (1/1) ... [2022-11-25 23:32:55,933 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:32:55,934 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:32:55,934 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:32:55,934 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:32:55,935 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:32:55" (1/1) ... [2022-11-25 23:32:55,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:32:55,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:32:55,966 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:32:55,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:32:56,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 23:32:56,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 23:32:56,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 23:32:56,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 23:32:56,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 23:32:56,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 23:32:56,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-25 23:32:56,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 23:32:56,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:32:56,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:32:56,152 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:32:56,154 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:32:56,498 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:32:56,550 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:32:56,550 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-25 23:32:56,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:32:56 BoogieIcfgContainer [2022-11-25 23:32:56,563 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:32:56,567 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:32:56,567 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:32:56,570 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:32:56,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:32:55" (1/3) ... [2022-11-25 23:32:56,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba317c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:32:56, skipping insertion in model container [2022-11-25 23:32:56,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:32:55" (2/3) ... [2022-11-25 23:32:56,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba317c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:32:56, skipping insertion in model container [2022-11-25 23:32:56,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:32:56" (3/3) ... [2022-11-25 23:32:56,573 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232-1.i [2022-11-25 23:32:56,591 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:32:56,591 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2022-11-25 23:32:56,672 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:32:56,699 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3b75fd5b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:32:56,699 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2022-11-25 23:32:56,711 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 72 states have internal predecessors, (78), 0 states have call successors, (0), 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 23:32:56,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 23:32:56,717 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:32:56,718 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 23:32:56,719 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 23:32:56,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:32:56,724 INFO L85 PathProgramCache]: Analyzing trace with hash 147227, now seen corresponding path program 1 times [2022-11-25 23:32:56,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:32:56,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470654051] [2022-11-25 23:32:56,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:32:56,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:32:56,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:32:57,153 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 23:32:57,153 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:32:57,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470654051] [2022-11-25 23:32:57,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470654051] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:32:57,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:32:57,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:32:57,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330674326] [2022-11-25 23:32:57,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:32:57,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:32:57,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:32:57,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:32:57,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:32:57,209 INFO L87 Difference]: Start difference. First operand has 73 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 72 states have internal predecessors, (78), 0 states have call successors, (0), 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 4 states, 3 states have (on average 1.0) 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 23:32:57,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:32:57,416 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2022-11-25 23:32:57,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:32:57,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) 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 23:32:57,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:32:57,429 INFO L225 Difference]: With dead ends: 83 [2022-11-25 23:32:57,429 INFO L226 Difference]: Without dead ends: 82 [2022-11-25 23:32:57,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 23:32:57,436 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 124 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:32:57,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 38 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:32:57,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-25 23:32:57,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 64. [2022-11-25 23:32:57,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 31 states have (on average 2.161290322580645) internal successors, (67), 63 states have internal predecessors, (67), 0 states have call successors, (0), 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 23:32:57,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2022-11-25 23:32:57,487 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 3 [2022-11-25 23:32:57,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:32:57,487 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2022-11-25 23:32:57,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) 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 23:32:57,488 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2022-11-25 23:32:57,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 23:32:57,488 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:32:57,488 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 23:32:57,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 23:32:57,492 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 23:32:57,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:32:57,493 INFO L85 PathProgramCache]: Analyzing trace with hash 147228, now seen corresponding path program 1 times [2022-11-25 23:32:57,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:32:57,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452056946] [2022-11-25 23:32:57,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:32:57,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:32:57,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:32:57,683 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 23:32:57,683 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:32:57,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452056946] [2022-11-25 23:32:57,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452056946] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:32:57,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:32:57,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:32:57,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125904255] [2022-11-25 23:32:57,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:32:57,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:32:57,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:32:57,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:32:57,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:32:57,691 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand has 4 states, 3 states have (on average 1.0) 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 23:32:57,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:32:57,812 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2022-11-25 23:32:57,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:32:57,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) 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 23:32:57,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:32:57,817 INFO L225 Difference]: With dead ends: 55 [2022-11-25 23:32:57,817 INFO L226 Difference]: Without dead ends: 55 [2022-11-25 23:32:57,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 23:32:57,824 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 106 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:32:57,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 24 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:32:57,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-25 23:32:57,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2022-11-25 23:32:57,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 53 states have internal predecessors, (57), 0 states have call successors, (0), 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 23:32:57,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-11-25 23:32:57,840 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 3 [2022-11-25 23:32:57,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:32:57,841 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-11-25 23:32:57,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) 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 23:32:57,842 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-11-25 23:32:57,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 23:32:57,843 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:32:57,843 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 23:32:57,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 23:32:57,844 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 23:32:57,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:32:57,846 INFO L85 PathProgramCache]: Analyzing trace with hash 4564017, now seen corresponding path program 1 times [2022-11-25 23:32:57,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:32:57,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303110292] [2022-11-25 23:32:57,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:32:57,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:32:57,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:32:57,896 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 23:32:57,896 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:32:57,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303110292] [2022-11-25 23:32:57,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303110292] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:32:57,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:32:57,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:32:57,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277157] [2022-11-25 23:32:57,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:32:57,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:32:57,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:32:57,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:32:57,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:32:57,899 INFO L87 Difference]: Start difference. First operand 54 states and 57 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 23:32:57,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:32:57,972 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2022-11-25 23:32:57,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:32:57,973 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 23:32:57,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:32:57,974 INFO L225 Difference]: With dead ends: 65 [2022-11-25 23:32:57,974 INFO L226 Difference]: Without dead ends: 65 [2022-11-25 23:32:57,974 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 23:32:57,982 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 41 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:32:57,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 31 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:32:57,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-25 23:32:57,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 50. [2022-11-25 23:32:57,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.7096774193548387) 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 23:32:57,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2022-11-25 23:32:57,997 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 4 [2022-11-25 23:32:57,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:32:57,997 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2022-11-25 23:32:57,998 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 23:32:57,998 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2022-11-25 23:32:57,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 23:32:57,998 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:32:57,998 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 23:32:57,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 23:32:58,000 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 23:32:58,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:32:58,002 INFO L85 PathProgramCache]: Analyzing trace with hash 4564018, now seen corresponding path program 1 times [2022-11-25 23:32:58,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:32:58,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620569190] [2022-11-25 23:32:58,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:32:58,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:32:58,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:32:58,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:32:58,063 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:32:58,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620569190] [2022-11-25 23:32:58,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620569190] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:32:58,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:32:58,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:32:58,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512007798] [2022-11-25 23:32:58,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:32:58,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:32:58,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:32:58,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:32:58,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:32:58,066 INFO L87 Difference]: Start difference. First operand 50 states and 53 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 23:32:58,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:32:58,108 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2022-11-25 23:32:58,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:32:58,109 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 23:32:58,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:32:58,110 INFO L225 Difference]: With dead ends: 47 [2022-11-25 23:32:58,110 INFO L226 Difference]: Without dead ends: 47 [2022-11-25 23:32:58,110 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 23:32:58,111 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:32:58,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 27 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:32:58,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-25 23:32:58,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-11-25 23:32:58,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.5806451612903225) 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 23:32:58,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2022-11-25 23:32:58,115 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 4 [2022-11-25 23:32:58,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:32:58,115 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2022-11-25 23:32:58,115 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 23:32:58,115 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-11-25 23:32:58,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 23:32:58,116 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:32:58,116 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:32:58,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 23:32:58,116 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 23:32:58,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:32:58,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1702802726, now seen corresponding path program 1 times [2022-11-25 23:32:58,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:32:58,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214761061] [2022-11-25 23:32:58,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:32:58,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:32:58,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:32:58,416 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 23:32:58,416 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:32:58,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214761061] [2022-11-25 23:32:58,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214761061] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:32:58,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:32:58,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 23:32:58,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947145937] [2022-11-25 23:32:58,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:32:58,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 23:32:58,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:32:58,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 23:32:58,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:32:58,420 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:32:58,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:32:58,592 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-11-25 23:32:58,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 23:32:58,594 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-25 23:32:58,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:32:58,595 INFO L225 Difference]: With dead ends: 54 [2022-11-25 23:32:58,595 INFO L226 Difference]: Without dead ends: 54 [2022-11-25 23:32:58,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-25 23:32:58,596 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 10 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:32:58,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 200 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:32:58,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-25 23:32:58,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2022-11-25 23:32:58,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.5) internal successors, (54), 50 states have internal predecessors, (54), 0 states have call successors, (0), 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 23:32:58,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2022-11-25 23:32:58,601 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 8 [2022-11-25 23:32:58,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:32:58,602 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2022-11-25 23:32:58,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:32:58,602 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-11-25 23:32:58,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 23:32:58,603 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:32:58,603 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:32:58,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 23:32:58,603 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 23:32:58,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:32:58,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1766066188, now seen corresponding path program 1 times [2022-11-25 23:32:58,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:32:58,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048758826] [2022-11-25 23:32:58,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:32:58,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:32:58,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:32:58,829 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 23:32:58,830 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:32:58,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048758826] [2022-11-25 23:32:58,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048758826] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:32:58,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:32:58,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 23:32:58,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386190139] [2022-11-25 23:32:58,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:32:58,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:32:58,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:32:58,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:32:58,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:32:58,833 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:32:58,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:32:58,958 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2022-11-25 23:32:58,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:32:58,959 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-25 23:32:58,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:32:58,959 INFO L225 Difference]: With dead ends: 64 [2022-11-25 23:32:58,959 INFO L226 Difference]: Without dead ends: 64 [2022-11-25 23:32:58,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 23:32:58,962 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 82 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:32:58,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 53 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:32:58,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-25 23:32:58,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 50. [2022-11-25 23:32:58,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 36 states have (on average 1.4722222222222223) 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 23:32:58,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2022-11-25 23:32:58,975 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 13 [2022-11-25 23:32:58,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:32:58,975 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2022-11-25 23:32:58,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:32:58,976 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2022-11-25 23:32:58,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 23:32:58,976 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:32:58,977 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:32:58,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 23:32:58,977 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 23:32:58,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:32:58,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1766066189, now seen corresponding path program 1 times [2022-11-25 23:32:58,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:32:58,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175385859] [2022-11-25 23:32:58,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:32:58,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:32:59,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:32:59,317 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 23:32:59,318 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:32:59,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175385859] [2022-11-25 23:32:59,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175385859] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:32:59,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:32:59,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 23:32:59,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710405931] [2022-11-25 23:32:59,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:32:59,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:32:59,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:32:59,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:32:59,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:32:59,320 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:32:59,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:32:59,455 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2022-11-25 23:32:59,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:32:59,456 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-25 23:32:59,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:32:59,458 INFO L225 Difference]: With dead ends: 65 [2022-11-25 23:32:59,458 INFO L226 Difference]: Without dead ends: 65 [2022-11-25 23:32:59,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 23:32:59,461 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 139 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:32:59,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 58 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:32:59,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-25 23:32:59,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 49. [2022-11-25 23:32:59,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 48 states have internal predecessors, (52), 0 states have call successors, (0), 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 23:32:59,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2022-11-25 23:32:59,468 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 13 [2022-11-25 23:32:59,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:32:59,468 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2022-11-25 23:32:59,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:32:59,468 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2022-11-25 23:32:59,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 23:32:59,472 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:32:59,473 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:32:59,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 23:32:59,474 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 23:32:59,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:32:59,474 INFO L85 PathProgramCache]: Analyzing trace with hash 677583434, now seen corresponding path program 1 times [2022-11-25 23:32:59,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:32:59,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251699866] [2022-11-25 23:32:59,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:32:59,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:32:59,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:32:59,597 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 23:32:59,598 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:32:59,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251699866] [2022-11-25 23:32:59,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251699866] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:32:59,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:32:59,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:32:59,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066413121] [2022-11-25 23:32:59,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:32:59,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:32:59,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:32:59,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:32:59,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:32:59,600 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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 23:32:59,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:32:59,698 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2022-11-25 23:32:59,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:32:59,699 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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 23:32:59,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:32:59,699 INFO L225 Difference]: With dead ends: 64 [2022-11-25 23:32:59,700 INFO L226 Difference]: Without dead ends: 64 [2022-11-25 23:32:59,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:32:59,700 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 83 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:32:59,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 58 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:32:59,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-25 23:32:59,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 48. [2022-11-25 23:32:59,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 47 states have internal predecessors, (51), 0 states have call successors, (0), 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 23:32:59,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2022-11-25 23:32:59,704 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 15 [2022-11-25 23:32:59,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:32:59,704 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2022-11-25 23:32:59,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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 23:32:59,704 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2022-11-25 23:32:59,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 23:32:59,705 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:32:59,705 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:32:59,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 23:32:59,705 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 23:32:59,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:32:59,706 INFO L85 PathProgramCache]: Analyzing trace with hash 697691972, now seen corresponding path program 1 times [2022-11-25 23:32:59,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:32:59,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779037293] [2022-11-25 23:32:59,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:32:59,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:32:59,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:32:59,813 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 23:32:59,813 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:32:59,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779037293] [2022-11-25 23:32:59,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779037293] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:32:59,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:32:59,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 23:32:59,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952446380] [2022-11-25 23:32:59,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:32:59,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:32:59,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:32:59,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:32:59,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:32:59,815 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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 23:32:59,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:32:59,903 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2022-11-25 23:32:59,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:32:59,903 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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 23:32:59,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:32:59,904 INFO L225 Difference]: With dead ends: 48 [2022-11-25 23:32:59,904 INFO L226 Difference]: Without dead ends: 48 [2022-11-25 23:32:59,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:32:59,905 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 50 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:32:59,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 62 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:32:59,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-25 23:32:59,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-11-25 23:32:59,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 47 states have internal predecessors, (50), 0 states have call successors, (0), 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 23:32:59,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2022-11-25 23:32:59,908 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 15 [2022-11-25 23:32:59,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:32:59,908 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2022-11-25 23:32:59,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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 23:32:59,908 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2022-11-25 23:32:59,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 23:32:59,909 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:32:59,909 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:32:59,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 23:32:59,909 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 23:32:59,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:32:59,910 INFO L85 PathProgramCache]: Analyzing trace with hash -469749928, now seen corresponding path program 1 times [2022-11-25 23:32:59,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:32:59,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291376322] [2022-11-25 23:32:59,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:32:59,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:32:59,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:33:00,051 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 23:33:00,051 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:33:00,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291376322] [2022-11-25 23:33:00,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291376322] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:33:00,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:33:00,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:33:00,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500374843] [2022-11-25 23:33:00,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:33:00,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:33:00,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:33:00,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:33:00,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:33:00,054 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:33:00,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:33:00,160 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-11-25 23:33:00,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:33:00,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-25 23:33:00,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:33:00,161 INFO L225 Difference]: With dead ends: 47 [2022-11-25 23:33:00,161 INFO L226 Difference]: Without dead ends: 47 [2022-11-25 23:33:00,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:33:00,162 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 46 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:33:00,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 44 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:33:00,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-25 23:33:00,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-11-25 23:33:00,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 46 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 23:33:00,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2022-11-25 23:33:00,169 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 16 [2022-11-25 23:33:00,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:33:00,170 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2022-11-25 23:33:00,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:33:00,170 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-11-25 23:33:00,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 23:33:00,171 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:33:00,171 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:33:00,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 23:33:00,171 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 23:33:00,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:33:00,172 INFO L85 PathProgramCache]: Analyzing trace with hash -2076654982, now seen corresponding path program 1 times [2022-11-25 23:33:00,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:33:00,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016015201] [2022-11-25 23:33:00,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:33:00,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:33:00,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:33:00,548 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:33:00,548 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:33:00,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016015201] [2022-11-25 23:33:00,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016015201] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:33:00,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183213942] [2022-11-25 23:33:00,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:33:00,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:33:00,549 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:33:00,568 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:33:00,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 23:33:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:33:00,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-25 23:33:00,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:33:00,897 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 23:33:00,947 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-25 23:33:00,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-25 23:33:01,047 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 23:33:01,047 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 33 treesize of output 24 [2022-11-25 23:33:01,147 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 23:33:01,147 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 36 treesize of output 16 [2022-11-25 23:33:01,155 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:33:01,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:33:01,289 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 38 treesize of output 34 [2022-11-25 23:33:01,710 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:33:01,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 103 treesize of output 255 [2022-11-25 23:33:02,173 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:33:02,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183213942] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:33:02,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [157216565] [2022-11-25 23:33:02,194 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2022-11-25 23:33:02,195 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:33:02,199 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:33:02,204 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:33:02,204 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:33:02,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-25 23:33:02,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-25 23:33:02,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2022-11-25 23:33:02,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2022-11-25 23:33:02,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-25 23:33:02,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 48 [2022-11-25 23:33:02,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2022-11-25 23:33:02,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-25 23:33:02,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-11-25 23:33:02,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-11-25 23:33:02,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 65 [2022-11-25 23:33:02,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-25 23:33:02,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 19 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 63 [2022-11-25 23:33:02,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-25 23:33:02,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,931 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 23:33:02,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 268 treesize of output 160 [2022-11-25 23:33:02,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:02,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 46 [2022-11-25 23:33:03,079 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:33:03,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:03,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:03,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-11-25 23:33:03,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:03,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2022-11-25 23:33:03,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:03,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:03,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-25 23:33:03,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:03,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:03,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 65 [2022-11-25 23:33:03,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:03,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:03,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-11-25 23:33:03,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:03,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-25 23:33:03,607 INFO L321 Elim1Store]: treesize reduction 190, result has 32.4 percent of original size [2022-11-25 23:33:03,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 344 treesize of output 407 [2022-11-25 23:33:05,878 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:33:05,890 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 23:33:05,890 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 15 treesize of output 15 [2022-11-25 23:33:05,901 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 15 treesize of output 1 [2022-11-25 23:33:05,918 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:33:05,928 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 23:33:05,929 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 15 treesize of output 15 [2022-11-25 23:33:06,044 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:33:08,717 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1365#(and (<= 0 |ULTIMATE.start_main_~#list~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) |ULTIMATE.start_append_#t~mem6#1.base|) (<= 0 |#NULL.base|) (<= 0 |ULTIMATE.start_append_#in~plist#1.base|) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) |ULTIMATE.start_append_#t~mem5#1.base|) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_append_~item~0#1.offset|) (or (not (= |ULTIMATE.start_append_#t~mem5#1.base| 0)) (not (= |ULTIMATE.start_append_#t~mem5#1.offset| 0))) (not (= (select |#valid| |ULTIMATE.start_append_#t~mem6#1.base|) 1)) (<= 0 |ULTIMATE.start_main_~#list~0#1.base|) (<= 0 |ULTIMATE.start_append_~plist#1.base|) (<= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_#t~mem5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (<= |ULTIMATE.start_main_~#list~0#1.offset| 0) (<= |ULTIMATE.start_append_#in~plist#1.offset| 0) (<= |#NULL.base| 0) (= |ULTIMATE.start_append_#t~mem6#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (<= 0 |ULTIMATE.start_append_~plist#1.offset|) (<= (+ |ULTIMATE.start_append_~item~0#1.offset| 4) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (<= 0 |ULTIMATE.start_append_#in~plist#1.offset|) (<= 0 |#NULL.offset|) (<= |ULTIMATE.start_append_~plist#1.offset| 0) (<= 0 |#StackHeapBarrier|))' at error location [2022-11-25 23:33:08,717 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:33:08,717 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:33:08,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2022-11-25 23:33:08,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785548500] [2022-11-25 23:33:08,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:33:08,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-25 23:33:08,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:33:08,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-25 23:33:08,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=747, Unknown=0, NotChecked=0, Total=870 [2022-11-25 23:33:08,719 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 20 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 23:33:09,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:33:09,318 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2022-11-25 23:33:09,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 23:33:09,320 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 20 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) Word has length 16 [2022-11-25 23:33:09,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:33:09,321 INFO L225 Difference]: With dead ends: 60 [2022-11-25 23:33:09,321 INFO L226 Difference]: Without dead ends: 60 [2022-11-25 23:33:09,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=238, Invalid=1094, Unknown=0, NotChecked=0, Total=1332 [2022-11-25 23:33:09,325 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 192 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:33:09,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 147 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:33:09,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-25 23:33:09,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 46. [2022-11-25 23:33:09,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 45 states have internal predecessors, (48), 0 states have call successors, (0), 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 23:33:09,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2022-11-25 23:33:09,339 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 16 [2022-11-25 23:33:09,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:33:09,339 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2022-11-25 23:33:09,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 20 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 23:33:09,340 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2022-11-25 23:33:09,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 23:33:09,340 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:33:09,341 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:33:09,352 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-25 23:33:09,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:33:09,548 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 23:33:09,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:33:09,548 INFO L85 PathProgramCache]: Analyzing trace with hash -2076654981, now seen corresponding path program 1 times [2022-11-25 23:33:09,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:33:09,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437396147] [2022-11-25 23:33:09,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:33:09,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:33:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:33:10,129 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:33:10,129 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:33:10,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437396147] [2022-11-25 23:33:10,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437396147] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:33:10,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713591299] [2022-11-25 23:33:10,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:33:10,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:33:10,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:33:10,131 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:33:10,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 23:33:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:33:10,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 55 conjunts are in the unsatisfiable core [2022-11-25 23:33:10,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:33:10,377 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 23:33:10,382 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 23:33:10,437 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-25 23:33:10,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2022-11-25 23:33:10,455 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-25 23:33:10,455 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 15 treesize of output 15 [2022-11-25 23:33:10,546 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 23:33:10,546 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 23 treesize of output 18 [2022-11-25 23:33:10,562 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 23:33:10,562 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 33 treesize of output 24 [2022-11-25 23:33:10,660 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 23:33:10,661 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 36 treesize of output 16 [2022-11-25 23:33:10,668 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 23:33:10,669 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 1 case distinctions, treesize of input 26 treesize of output 10 [2022-11-25 23:33:10,672 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:33:10,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:33:12,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2022-11-25 23:33:12,960 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 66 treesize of output 62 [2022-11-25 23:33:12,964 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 102 treesize of output 94 [2022-11-25 23:33:21,283 WARN L233 SmtUtils]: Spent 8.15s on a formula simplification. DAG size of input: 33 DAG size of output: 32 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:33:21,306 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 64 treesize of output 60 [2022-11-25 23:33:21,339 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:33:21,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 100 [2022-11-25 23:33:21,468 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:33:21,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713591299] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:33:21,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2036335642] [2022-11-25 23:33:21,470 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2022-11-25 23:33:21,471 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:33:21,471 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:33:21,471 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:33:21,471 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:33:21,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-25 23:33:21,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-25 23:33:21,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2022-11-25 23:33:21,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2022-11-25 23:33:21,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-25 23:33:21,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 48 [2022-11-25 23:33:21,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-25 23:33:21,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2022-11-25 23:33:21,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-11-25 23:33:21,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 68 [2022-11-25 23:33:21,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-11-25 23:33:21,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-25 23:33:21,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 19 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 78 [2022-11-25 23:33:21,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,973 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-11-25 23:33:21,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 330 treesize of output 180 [2022-11-25 23:33:21,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:21,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:22,020 INFO L321 Elim1Store]: treesize reduction 80, result has 22.3 percent of original size [2022-11-25 23:33:22,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 286 treesize of output 249 [2022-11-25 23:33:22,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:22,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-25 23:33:22,099 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:33:22,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:22,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2022-11-25 23:33:22,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:22,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:22,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-25 23:33:22,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:22,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:22,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-11-25 23:33:22,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:22,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:22,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-11-25 23:33:22,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:22,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-25 23:33:22,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:22,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:22,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 65 [2022-11-25 23:33:22,589 INFO L321 Elim1Store]: treesize reduction 190, result has 32.4 percent of original size [2022-11-25 23:33:22,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 344 treesize of output 407 [2022-11-25 23:33:24,464 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:33:24,474 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 23:33:24,474 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 15 treesize of output 15 [2022-11-25 23:33:24,491 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:33:24,501 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 23:33:24,502 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 15 treesize of output 15 [2022-11-25 23:33:24,509 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 15 treesize of output 1 [2022-11-25 23:33:24,634 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:33:27,487 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1608#(and (<= 0 |ULTIMATE.start_main_~#list~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) |ULTIMATE.start_append_#t~mem6#1.base|) (<= 0 |#NULL.base|) (<= 0 |ULTIMATE.start_append_#in~plist#1.base|) (or (not (<= (+ |ULTIMATE.start_append_#t~mem6#1.offset| 8) (select |#length| |ULTIMATE.start_append_#t~mem6#1.base|))) (not (<= 0 (+ |ULTIMATE.start_append_#t~mem6#1.offset| 4)))) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) |ULTIMATE.start_append_#t~mem5#1.base|) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_append_~item~0#1.offset|) (or (not (= |ULTIMATE.start_append_#t~mem5#1.base| 0)) (not (= |ULTIMATE.start_append_#t~mem5#1.offset| 0))) (<= 0 |ULTIMATE.start_main_~#list~0#1.base|) (<= 0 |ULTIMATE.start_append_~plist#1.base|) (<= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_#t~mem5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (<= |ULTIMATE.start_main_~#list~0#1.offset| 0) (<= |ULTIMATE.start_append_#in~plist#1.offset| 0) (<= |#NULL.base| 0) (= |ULTIMATE.start_append_#t~mem6#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (<= 0 |ULTIMATE.start_append_~plist#1.offset|) (<= (+ |ULTIMATE.start_append_~item~0#1.offset| 4) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (<= 0 |ULTIMATE.start_append_#in~plist#1.offset|) (<= 0 |#NULL.offset|) (<= |ULTIMATE.start_append_~plist#1.offset| 0) (<= 0 |#StackHeapBarrier|))' at error location [2022-11-25 23:33:27,487 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:33:27,487 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:33:27,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-11-25 23:33:27,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478330249] [2022-11-25 23:33:27,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:33:27,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-25 23:33:27,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:33:27,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-25 23:33:27,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=917, Unknown=0, NotChecked=0, Total=1056 [2022-11-25 23:33:27,489 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 23 states have internal predecessors, (46), 0 states have call successors, (0), 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 23:33:28,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:33:28,436 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2022-11-25 23:33:28,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 23:33:28,436 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 23 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-25 23:33:28,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:33:28,437 INFO L225 Difference]: With dead ends: 61 [2022-11-25 23:33:28,437 INFO L226 Difference]: Without dead ends: 61 [2022-11-25 23:33:28,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=269, Invalid=1371, Unknown=0, NotChecked=0, Total=1640 [2022-11-25 23:33:28,438 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 107 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:33:28,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 196 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:33:28,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-25 23:33:28,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 45. [2022-11-25 23:33:28,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 44 states have internal predecessors, (47), 0 states have call successors, (0), 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 23:33:28,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2022-11-25 23:33:28,441 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 16 [2022-11-25 23:33:28,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:33:28,441 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2022-11-25 23:33:28,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 23 states have internal predecessors, (46), 0 states have call successors, (0), 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 23:33:28,448 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-11-25 23:33:28,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 23:33:28,448 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:33:28,448 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:33:28,461 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 23:33:28,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-25 23:33:28,655 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 23:33:28,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:33:28,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1677345780, now seen corresponding path program 1 times [2022-11-25 23:33:28,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:33:28,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899904283] [2022-11-25 23:33:28,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:33:28,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:33:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:33:28,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:33:28,750 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:33:28,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899904283] [2022-11-25 23:33:28,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899904283] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:33:28,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:33:28,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:33:28,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089331831] [2022-11-25 23:33:28,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:33:28,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:33:28,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:33:28,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:33:28,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:33:28,753 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:33:28,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:33:28,836 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-11-25 23:33:28,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:33:28,837 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-25 23:33:28,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:33:28,837 INFO L225 Difference]: With dead ends: 44 [2022-11-25 23:33:28,837 INFO L226 Difference]: Without dead ends: 44 [2022-11-25 23:33:28,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:33:28,838 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 3 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:33:28,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 70 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:33:28,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-25 23:33:28,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-11-25 23:33:28,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 43 states have internal predecessors, (46), 0 states have call successors, (0), 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 23:33:28,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2022-11-25 23:33:28,840 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 17 [2022-11-25 23:33:28,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:33:28,840 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2022-11-25 23:33:28,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:33:28,840 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-11-25 23:33:28,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 23:33:28,841 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:33:28,841 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:33:28,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 23:33:28,841 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 23:33:28,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:33:28,841 INFO L85 PathProgramCache]: Analyzing trace with hash -458111525, now seen corresponding path program 1 times [2022-11-25 23:33:28,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:33:28,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564160950] [2022-11-25 23:33:28,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:33:28,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:33:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:33:29,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:33:29,069 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:33:29,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564160950] [2022-11-25 23:33:29,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564160950] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:33:29,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:33:29,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:33:29,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163888550] [2022-11-25 23:33:29,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:33:29,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:33:29,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:33:29,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:33:29,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:33:29,073 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 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 23:33:29,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:33:29,180 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2022-11-25 23:33:29,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 23:33:29,180 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 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 23:33:29,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:33:29,181 INFO L225 Difference]: With dead ends: 43 [2022-11-25 23:33:29,181 INFO L226 Difference]: Without dead ends: 43 [2022-11-25 23:33:29,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-25 23:33:29,182 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 54 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:33:29,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 32 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:33:29,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-25 23:33:29,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-11-25 23:33:29,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.25) internal successors, (45), 42 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 23:33:29,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2022-11-25 23:33:29,184 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 18 [2022-11-25 23:33:29,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:33:29,184 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2022-11-25 23:33:29,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 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 23:33:29,184 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2022-11-25 23:33:29,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 23:33:29,188 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:33:29,188 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:33:29,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 23:33:29,188 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 23:33:29,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:33:29,189 INFO L85 PathProgramCache]: Analyzing trace with hash 141357921, now seen corresponding path program 1 times [2022-11-25 23:33:29,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:33:29,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024746606] [2022-11-25 23:33:29,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:33:29,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:33:29,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 23:33:29,221 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 23:33:29,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 23:33:29,257 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-25 23:33:29,257 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 23:33:29,258 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK (40 of 41 remaining) [2022-11-25 23:33:29,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 41 remaining) [2022-11-25 23:33:29,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 41 remaining) [2022-11-25 23:33:29,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 41 remaining) [2022-11-25 23:33:29,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 41 remaining) [2022-11-25 23:33:29,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 41 remaining) [2022-11-25 23:33:29,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 41 remaining) [2022-11-25 23:33:29,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 41 remaining) [2022-11-25 23:33:29,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 41 remaining) [2022-11-25 23:33:29,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 41 remaining) [2022-11-25 23:33:29,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 41 remaining) [2022-11-25 23:33:29,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 41 remaining) [2022-11-25 23:33:29,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 41 remaining) [2022-11-25 23:33:29,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 41 remaining) [2022-11-25 23:33:29,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 41 remaining) [2022-11-25 23:33:29,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 41 remaining) [2022-11-25 23:33:29,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 41 remaining) [2022-11-25 23:33:29,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 41 remaining) [2022-11-25 23:33:29,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 41 remaining) [2022-11-25 23:33:29,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 41 remaining) [2022-11-25 23:33:29,264 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 41 remaining) [2022-11-25 23:33:29,264 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 41 remaining) [2022-11-25 23:33:29,264 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 41 remaining) [2022-11-25 23:33:29,264 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE (17 of 41 remaining) [2022-11-25 23:33:29,264 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE (16 of 41 remaining) [2022-11-25 23:33:29,265 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE (15 of 41 remaining) [2022-11-25 23:33:29,265 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 41 remaining) [2022-11-25 23:33:29,265 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 41 remaining) [2022-11-25 23:33:29,265 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 41 remaining) [2022-11-25 23:33:29,265 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 41 remaining) [2022-11-25 23:33:29,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 41 remaining) [2022-11-25 23:33:29,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 41 remaining) [2022-11-25 23:33:29,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 41 remaining) [2022-11-25 23:33:29,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 41 remaining) [2022-11-25 23:33:29,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 41 remaining) [2022-11-25 23:33:29,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 41 remaining) [2022-11-25 23:33:29,267 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE (4 of 41 remaining) [2022-11-25 23:33:29,267 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE (3 of 41 remaining) [2022-11-25 23:33:29,267 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE (2 of 41 remaining) [2022-11-25 23:33:29,267 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 41 remaining) [2022-11-25 23:33:29,267 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 41 remaining) [2022-11-25 23:33:29,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 23:33:29,271 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:33:29,274 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 23:33:29,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 11:33:29 BoogieIcfgContainer [2022-11-25 23:33:29,301 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 23:33:29,301 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 23:33:29,301 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 23:33:29,301 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 23:33:29,302 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:32:56" (3/4) ... [2022-11-25 23:33:29,305 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 23:33:29,305 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 23:33:29,306 INFO L158 Benchmark]: Toolchain (without parser) took 33942.26ms. Allocated memory was 159.4MB in the beginning and 339.7MB in the end (delta: 180.4MB). Free memory was 128.0MB in the beginning and 293.8MB in the end (delta: -165.8MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2022-11-25 23:33:29,306 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 113.2MB. Free memory is still 78.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:33:29,306 INFO L158 Benchmark]: CACSL2BoogieTranslator took 493.89ms. Allocated memory is still 159.4MB. Free memory was 128.0MB in the beginning and 111.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-25 23:33:29,307 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.77ms. Allocated memory is still 159.4MB. Free memory was 111.2MB in the beginning and 109.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:33:29,307 INFO L158 Benchmark]: Boogie Preprocessor took 29.41ms. Allocated memory is still 159.4MB. Free memory was 109.2MB in the beginning and 107.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:33:29,307 INFO L158 Benchmark]: RCFGBuilder took 629.41ms. Allocated memory is still 159.4MB. Free memory was 107.6MB in the beginning and 87.2MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-25 23:33:29,307 INFO L158 Benchmark]: TraceAbstraction took 32733.71ms. Allocated memory was 159.4MB in the beginning and 339.7MB in the end (delta: 180.4MB). Free memory was 86.7MB in the beginning and 293.8MB in the end (delta: -207.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:33:29,308 INFO L158 Benchmark]: Witness Printer took 4.23ms. Allocated memory is still 339.7MB. Free memory is still 293.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:33:29,309 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.22ms. Allocated memory is still 113.2MB. Free memory is still 78.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 493.89ms. Allocated memory is still 159.4MB. Free memory was 128.0MB in the beginning and 111.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.77ms. Allocated memory is still 159.4MB. Free memory was 111.2MB in the beginning and 109.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.41ms. Allocated memory is still 159.4MB. Free memory was 109.2MB in the beginning and 107.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 629.41ms. Allocated memory is still 159.4MB. Free memory was 107.6MB in the beginning and 87.2MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 32733.71ms. Allocated memory was 159.4MB in the beginning and 339.7MB in the end (delta: 180.4MB). Free memory was 86.7MB in the beginning and 293.8MB in the end (delta: -207.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.23ms. Allocated memory is still 339.7MB. Free memory is still 293.8MB. There was no memory consumed. 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 - UnprovableResult [Line: 537]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 537. Possible FailurePath: [L539] struct item *list = ((void *)0); VAL [list={6:0}] [L541] CALL append(&list) [L530] struct item *item = malloc(sizeof *item); [L531] EXPR \read(**plist) VAL [\read(**plist)={0:0}, item={3:0}, plist={6:0}, plist={6:0}] [L531] item->next = *plist [L532] EXPR item->next VAL [item={3:0}, item->next={0:0}, plist={6:0}, plist={6:0}] [L532-L534] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L532-L534] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-1:0}, item={3:0}, item->next={0:0}, malloc(sizeof *item)={-1:0}, plist={6:0}, plist={6:0}] [L532-L534] item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L535] *plist = item [L541] RET append(&list) [L542] COND FALSE !(__VERIFIER_nondet_int()) [L543] \read(*list) VAL [\read(*list)={3:0}, list={6:0}] [L543] COND TRUE \read(*list) [L544] EXPR \read(*list) VAL [\read(*list)={3:0}, list={6:0}] [L544] EXPR list->next [L544] struct item *next = list->next; [L545] EXPR \read(*list) VAL [\read(*list)={3:0}, list={6:0}, next={0:0}] [L545] free(list) VAL [\read(*list)={3:0}, list={6:0}, next={0:0}] [L545] free(list) VAL [\read(*list)={3:0}, list={6:0}, next={0:0}] [L545] free(list) [L546] list = next VAL [list={6:0}, next={0:0}] [L548] \read(*list) VAL [\read(*list)={0:0}, list={6:0}, next={0:0}] [L548] COND FALSE !(\read(*list)) [L553] return 0; [L539] struct item *list = ((void *)0); [L553] return 0; VAL [\result=0, next={0:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 73 locations, 41 error locations. Started 1 CEGAR loops. OverallTime: 32.7s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1082 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1082 mSDsluCounter, 1040 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 707 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1584 IncrementalHoareTripleChecker+Invalid, 1671 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 333 mSDtfsCounter, 1584 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 189 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 17.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=0, InterpolantAutomatonStates: 89, 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, 14 MinimizatonAttempts, 114 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 15.5s InterpolantComputationTime, 215 NumberOfCodeBlocks, 215 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 207 ConstructedInterpolants, 14 QuantifiedInterpolants, 2382 SizeOfPredicates, 41 NumberOfNonLiveVariables, 414 ConjunctsInSsa, 93 ConjunctsInUnsatCore, 18 InterpolantComputations, 12 PerfectInterpolantSequences, 6/30 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-25 23:33:29,336 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0232-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1228d922512a0e9364273220ccc1e5afc3bfb7c0e22f10439a1ba902492e71b2 --- 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 23:33:31,612 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:33:31,614 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:33:31,635 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:33:31,645 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:33:31,647 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:33:31,649 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:33:31,653 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:33:31,658 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:33:31,659 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:33:31,660 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:33:31,662 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:33:31,664 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:33:31,667 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:33:31,668 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:33:31,669 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:33:31,672 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:33:31,677 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:33:31,679 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:33:31,680 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:33:31,682 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:33:31,691 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:33:31,692 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:33:31,693 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:33:31,697 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:33:31,701 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:33:31,702 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:33:31,703 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:33:31,703 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:33:31,704 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:33:31,705 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:33:31,706 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:33:31,708 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:33:31,720 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:33:31,722 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:33:31,722 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:33:31,723 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:33:31,723 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:33:31,723 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:33:31,724 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:33:31,725 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:33:31,726 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-25 23:33:31,766 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:33:31,770 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:33:31,770 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:33:31,771 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:33:31,772 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:33:31,772 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:33:31,773 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:33:31,773 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:33:31,773 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:33:31,773 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:33:31,774 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:33:31,775 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:33:31,776 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 23:33:31,776 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 23:33:31,777 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:33:31,777 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 23:33:31,777 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 23:33:31,777 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:33:31,778 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 23:33:31,778 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:33:31,778 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 23:33:31,778 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 23:33:31,778 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 23:33:31,779 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:33:31,779 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 23:33:31,779 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 23:33:31,779 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 23:33:31,780 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 23:33:31,780 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:33:31,780 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:33:31,780 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 23:33:31,781 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:33:31,781 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:33:31,781 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:33:31,782 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:33:31,782 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-25 23:33:31,782 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 23:33:31,782 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:33:31,783 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 23:33:31,783 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/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_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur 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 -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1228d922512a0e9364273220ccc1e5afc3bfb7c0e22f10439a1ba902492e71b2 [2022-11-25 23:33:32,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:33:32,183 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:33:32,185 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:33:32,186 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:33:32,186 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:33:32,188 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/memsafety/test-0232-1.i [2022-11-25 23:33:35,278 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:33:35,540 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:33:35,544 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/sv-benchmarks/c/memsafety/test-0232-1.i [2022-11-25 23:33:35,564 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/data/69b3d2cb4/5721a73e35ac45dbbee56278a0a1a821/FLAG62b99d659 [2022-11-25 23:33:35,577 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/data/69b3d2cb4/5721a73e35ac45dbbee56278a0a1a821 [2022-11-25 23:33:35,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:33:35,582 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:33:35,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:33:35,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:33:35,590 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:33:35,591 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:33:35" (1/1) ... [2022-11-25 23:33:35,592 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dfe5d54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:33:35, skipping insertion in model container [2022-11-25 23:33:35,595 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:33:35" (1/1) ... [2022-11-25 23:33:35,602 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:33:35,652 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:33:35,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:33:36,001 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:33:36,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:33:36,109 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:33:36,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:33:36 WrapperNode [2022-11-25 23:33:36,110 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:33:36,111 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:33:36,112 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:33:36,112 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:33:36,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:33:36" (1/1) ... [2022-11-25 23:33:36,138 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:33:36" (1/1) ... [2022-11-25 23:33:36,159 INFO L138 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2022-11-25 23:33:36,160 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:33:36,160 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:33:36,161 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:33:36,161 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:33:36,170 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:33:36" (1/1) ... [2022-11-25 23:33:36,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:33:36" (1/1) ... [2022-11-25 23:33:36,175 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:33:36" (1/1) ... [2022-11-25 23:33:36,175 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:33:36" (1/1) ... [2022-11-25 23:33:36,184 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:33:36" (1/1) ... [2022-11-25 23:33:36,188 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:33:36" (1/1) ... [2022-11-25 23:33:36,190 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:33:36" (1/1) ... [2022-11-25 23:33:36,191 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:33:36" (1/1) ... [2022-11-25 23:33:36,194 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:33:36,195 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:33:36,195 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:33:36,196 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:33:36,196 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:33:36" (1/1) ... [2022-11-25 23:33:36,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:33:36,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:33:36,237 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:33:36,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:33:36,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 23:33:36,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 23:33:36,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 23:33:36,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 23:33:36,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 23:33:36,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 23:33:36,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-25 23:33:36,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 23:33:36,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:33:36,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:33:36,480 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:33:36,482 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:33:37,028 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:33:37,035 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:33:37,036 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-25 23:33:37,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:33:37 BoogieIcfgContainer [2022-11-25 23:33:37,038 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:33:37,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:33:37,040 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:33:37,043 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:33:37,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:33:35" (1/3) ... [2022-11-25 23:33:37,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eb0e516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:33:37, skipping insertion in model container [2022-11-25 23:33:37,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:33:36" (2/3) ... [2022-11-25 23:33:37,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eb0e516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:33:37, skipping insertion in model container [2022-11-25 23:33:37,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:33:37" (3/3) ... [2022-11-25 23:33:37,047 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232-1.i [2022-11-25 23:33:37,065 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:33:37,066 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2022-11-25 23:33:37,126 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:33:37,135 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7bf59afc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:33:37,135 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2022-11-25 23:33:37,140 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 39 states have (on average 2.2051282051282053) internal successors, (86), 80 states have internal predecessors, (86), 0 states have call successors, (0), 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 23:33:37,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 23:33:37,146 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:33:37,147 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 23:33:37,148 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 23:33:37,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:33:37,156 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2022-11-25 23:33:37,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:33:37,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368838674] [2022-11-25 23:33:37,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:33:37,172 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:33:37,173 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:33:37,180 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:33:37,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-25 23:33:37,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:33:37,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 23:33:37,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:33:37,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 23:33:37,446 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 23:33:37,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-25 23:33:37,469 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 23:33:37,469 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:33:37,470 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:33:37,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368838674] [2022-11-25 23:33:37,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [368838674] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:33:37,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:33:37,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:33:37,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281688025] [2022-11-25 23:33:37,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:33:37,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:33:37,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:33:37,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:33:37,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:33:37,529 INFO L87 Difference]: Start difference. First operand has 81 states, 39 states have (on average 2.2051282051282053) internal successors, (86), 80 states have internal predecessors, (86), 0 states have call successors, (0), 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 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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 23:33:37,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:33:37,897 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2022-11-25 23:33:37,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:33:37,900 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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 23:33:37,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:33:37,909 INFO L225 Difference]: With dead ends: 92 [2022-11-25 23:33:37,909 INFO L226 Difference]: Without dead ends: 90 [2022-11-25 23:33:37,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:33:37,914 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 137 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:33:37,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 51 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:33:37,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-25 23:33:37,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 71. [2022-11-25 23:33:37,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 70 states have internal predecessors, (74), 0 states have call successors, (0), 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 23:33:37,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2022-11-25 23:33:37,955 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 4 [2022-11-25 23:33:37,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:33:37,956 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2022-11-25 23:33:37,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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 23:33:37,957 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2022-11-25 23:33:37,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 23:33:37,957 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:33:37,957 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 23:33:37,973 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-25 23:33:38,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:33:38,169 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 23:33:38,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:33:38,169 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2022-11-25 23:33:38,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:33:38,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1571558386] [2022-11-25 23:33:38,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:33:38,170 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:33:38,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:33:38,197 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:33:38,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-25 23:33:38,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:33:38,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 23:33:38,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:33:38,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:33:38,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 23:33:38,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:38,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 23:33:38,444 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:33:38,445 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 13 treesize of output 13 [2022-11-25 23:33:38,465 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 23:33:38,465 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:33:38,466 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:33:38,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1571558386] [2022-11-25 23:33:38,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1571558386] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:33:38,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:33:38,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:33:38,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102874767] [2022-11-25 23:33:38,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:33:38,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:33:38,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:33:38,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:33:38,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:33:38,481 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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 23:33:39,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:33:39,061 INFO L93 Difference]: Finished difference Result 145 states and 152 transitions. [2022-11-25 23:33:39,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:33:39,062 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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 23:33:39,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:33:39,064 INFO L225 Difference]: With dead ends: 145 [2022-11-25 23:33:39,064 INFO L226 Difference]: Without dead ends: 145 [2022-11-25 23:33:39,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:33:39,066 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 134 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:33:39,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 89 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:33:39,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-25 23:33:39,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 76. [2022-11-25 23:33:39,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 75 states have internal predecessors, (84), 0 states have call successors, (0), 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 23:33:39,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2022-11-25 23:33:39,075 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 4 [2022-11-25 23:33:39,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:33:39,075 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2022-11-25 23:33:39,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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 23:33:39,079 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2022-11-25 23:33:39,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 23:33:39,080 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:33:39,080 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 23:33:39,096 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-11-25 23:33:39,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:33:39,291 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 23:33:39,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:33:39,292 INFO L85 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2022-11-25 23:33:39,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:33:39,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [448948852] [2022-11-25 23:33:39,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:33:39,293 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:33:39,293 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:33:39,301 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:33:39,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-25 23:33:39,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:33:39,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 23:33:39,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:33:39,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 23:33:39,400 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 23:33:39,401 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:33:39,401 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:33:39,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [448948852] [2022-11-25 23:33:39,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [448948852] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:33:39,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:33:39,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:33:39,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25170469] [2022-11-25 23:33:39,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:33:39,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:33:39,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:33:39,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:33:39,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:33:39,409 INFO L87 Difference]: Start difference. First operand 76 states and 84 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 23:33:39,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:33:39,579 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2022-11-25 23:33:39,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:33:39,580 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 23:33:39,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:33:39,581 INFO L225 Difference]: With dead ends: 82 [2022-11-25 23:33:39,581 INFO L226 Difference]: Without dead ends: 82 [2022-11-25 23:33:39,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 23:33:39,582 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 48 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:33:39,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 51 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:33:39,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-25 23:33:39,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2022-11-25 23:33:39,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 71 states have internal predecessors, (79), 0 states have call successors, (0), 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 23:33:39,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2022-11-25 23:33:39,597 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 5 [2022-11-25 23:33:39,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:33:39,598 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2022-11-25 23:33:39,598 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 23:33:39,598 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2022-11-25 23:33:39,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 23:33:39,599 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:33:39,599 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 23:33:39,614 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-11-25 23:33:39,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:33:39,810 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 23:33:39,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:33:39,810 INFO L85 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2022-11-25 23:33:39,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:33:39,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [467281315] [2022-11-25 23:33:39,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:33:39,811 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:33:39,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:33:39,819 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:33:39,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-25 23:33:39,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:33:39,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 23:33:39,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:33:39,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:33:39,931 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 23:33:39,931 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:33:39,931 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:33:39,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [467281315] [2022-11-25 23:33:39,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [467281315] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:33:39,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:33:39,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:33:39,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641380576] [2022-11-25 23:33:39,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:33:39,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:33:39,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:33:39,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:33:39,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:33:39,934 INFO L87 Difference]: Start difference. First operand 72 states and 79 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 23:33:40,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:33:40,083 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2022-11-25 23:33:40,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:33:40,084 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 23:33:40,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:33:40,084 INFO L225 Difference]: With dead ends: 69 [2022-11-25 23:33:40,084 INFO L226 Difference]: Without dead ends: 69 [2022-11-25 23:33:40,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 23:33:40,086 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 57 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:33:40,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 35 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:33:40,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-25 23:33:40,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-11-25 23:33:40,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 47 states have (on average 1.574468085106383) internal successors, (74), 67 states have internal predecessors, (74), 0 states have call successors, (0), 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 23:33:40,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2022-11-25 23:33:40,092 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 5 [2022-11-25 23:33:40,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:33:40,093 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2022-11-25 23:33:40,093 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 23:33:40,093 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2022-11-25 23:33:40,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-25 23:33:40,094 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:33:40,094 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:33:40,104 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-25 23:33:40,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:33:40,300 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 23:33:40,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:33:40,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1328641136, now seen corresponding path program 1 times [2022-11-25 23:33:40,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:33:40,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [367967210] [2022-11-25 23:33:40,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:33:40,302 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:33:40,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:33:40,303 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:33:40,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-25 23:33:40,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:33:40,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-25 23:33:40,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:33:40,531 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 23:33:40,531 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 23 treesize of output 18 [2022-11-25 23:33:40,564 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 23:33:40,565 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 23 treesize of output 18 [2022-11-25 23:33:40,668 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 23:33:40,668 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 26 treesize of output 10 [2022-11-25 23:33:40,675 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 23:33:40,675 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 26 treesize of output 10 [2022-11-25 23:33:40,702 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 23:33:40,702 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:33:40,702 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:33:40,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [367967210] [2022-11-25 23:33:40,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [367967210] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:33:40,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:33:40,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 23:33:40,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762787581] [2022-11-25 23:33:40,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:33:40,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 23:33:40,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:33:40,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 23:33:40,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:33:40,705 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 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 23:33:41,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:33:41,396 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2022-11-25 23:33:41,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 23:33:41,397 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 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 23:33:41,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:33:41,398 INFO L225 Difference]: With dead ends: 78 [2022-11-25 23:33:41,398 INFO L226 Difference]: Without dead ends: 78 [2022-11-25 23:33:41,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:33:41,399 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 16 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:33:41,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 270 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:33:41,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-25 23:33:41,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2022-11-25 23:33:41,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 53 states have (on average 1.509433962264151) internal successors, (80), 73 states have internal predecessors, (80), 0 states have call successors, (0), 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 23:33:41,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2022-11-25 23:33:41,405 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 10 [2022-11-25 23:33:41,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:33:41,406 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2022-11-25 23:33:41,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 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 23:33:41,406 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2022-11-25 23:33:41,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 23:33:41,407 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:33:41,407 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:33:41,425 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-25 23:33:41,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:33:41,619 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 23:33:41,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:33:41,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1762075788, now seen corresponding path program 1 times [2022-11-25 23:33:41,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:33:41,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [303395149] [2022-11-25 23:33:41,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:33:41,620 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:33:41,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:33:41,622 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:33:41,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-25 23:33:41,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:33:41,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 23:33:41,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:33:41,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:33:41,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 23:33:41,826 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:33:41,827 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 13 treesize of output 13 [2022-11-25 23:33:41,861 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 23:33:41,862 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:33:41,862 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:33:41,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [303395149] [2022-11-25 23:33:41,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [303395149] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:33:41,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:33:41,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 23:33:41,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691178710] [2022-11-25 23:33:41,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:33:41,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:33:41,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:33:41,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:33:41,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:33:41,865 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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 23:33:42,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:33:42,097 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2022-11-25 23:33:42,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 23:33:42,098 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-11-25 23:33:42,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:33:42,098 INFO L225 Difference]: With dead ends: 82 [2022-11-25 23:33:42,098 INFO L226 Difference]: Without dead ends: 82 [2022-11-25 23:33:42,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-11-25 23:33:42,099 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 208 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:33:42,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 37 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:33:42,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-25 23:33:42,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2022-11-25 23:33:42,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.52) internal successors, (76), 69 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:33:42,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2022-11-25 23:33:42,105 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 11 [2022-11-25 23:33:42,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:33:42,105 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2022-11-25 23:33:42,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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 23:33:42,105 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2022-11-25 23:33:42,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 23:33:42,106 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:33:42,106 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:33:42,124 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-25 23:33:42,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:33:42,317 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 23:33:42,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:33:42,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1870051159, now seen corresponding path program 1 times [2022-11-25 23:33:42,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:33:42,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1833363955] [2022-11-25 23:33:42,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:33:42,319 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:33:42,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:33:42,320 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:33:42,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-25 23:33:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:33:42,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 23:33:42,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:33:42,551 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 23:33:42,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 23:33:42,593 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 23:33:42,593 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:33:42,594 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:33:42,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1833363955] [2022-11-25 23:33:42,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1833363955] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:33:42,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:33:42,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 23:33:42,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946166813] [2022-11-25 23:33:42,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:33:42,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:33:42,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:33:42,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:33:42,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:33:42,600 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:33:42,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:33:42,950 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2022-11-25 23:33:42,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:33:42,951 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-25 23:33:42,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:33:42,951 INFO L225 Difference]: With dead ends: 78 [2022-11-25 23:33:42,951 INFO L226 Difference]: Without dead ends: 78 [2022-11-25 23:33:42,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 23:33:42,952 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 133 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:33:42,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 72 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:33:42,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-25 23:33:42,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 69. [2022-11-25 23:33:42,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.5) internal successors, (75), 68 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:33:42,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2022-11-25 23:33:42,957 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 17 [2022-11-25 23:33:42,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:33:42,957 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2022-11-25 23:33:42,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:33:42,957 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2022-11-25 23:33:42,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 23:33:42,957 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:33:42,958 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:33:42,976 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-25 23:33:43,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:33:43,169 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 23:33:43,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:33:43,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1870051160, now seen corresponding path program 1 times [2022-11-25 23:33:43,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:33:43,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [806737828] [2022-11-25 23:33:43,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:33:43,170 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:33:43,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:33:43,171 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:33:43,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-25 23:33:43,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:33:43,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-25 23:33:43,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:33:43,440 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 23:33:43,447 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 23:33:43,506 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 17 treesize of output 9 [2022-11-25 23:33:43,519 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 23:33:43,539 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 23:33:43,539 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:33:43,540 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:33:43,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [806737828] [2022-11-25 23:33:43,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [806737828] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:33:43,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:33:43,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 23:33:43,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148198582] [2022-11-25 23:33:43,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:33:43,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:33:43,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:33:43,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:33:43,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:33:43,542 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:33:43,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:33:43,958 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2022-11-25 23:33:43,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:33:43,959 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-25 23:33:43,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:33:43,959 INFO L225 Difference]: With dead ends: 80 [2022-11-25 23:33:43,959 INFO L226 Difference]: Without dead ends: 80 [2022-11-25 23:33:43,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 23:33:43,960 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 102 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:33:43,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 77 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:33:43,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-25 23:33:43,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 68. [2022-11-25 23:33:43,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 50 states have (on average 1.48) internal successors, (74), 67 states have internal predecessors, (74), 0 states have call successors, (0), 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 23:33:43,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2022-11-25 23:33:43,966 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 17 [2022-11-25 23:33:43,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:33:43,966 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2022-11-25 23:33:43,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:33:43,967 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2022-11-25 23:33:43,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 23:33:43,967 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:33:43,967 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:33:43,980 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-25 23:33:44,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:33:44,179 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 23:33:44,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:33:44,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1843001263, now seen corresponding path program 1 times [2022-11-25 23:33:44,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:33:44,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [152480676] [2022-11-25 23:33:44,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:33:44,180 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:33:44,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:33:44,181 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:33:44,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-25 23:33:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:33:44,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 23:33:44,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:33:44,395 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 23:33:44,416 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 8 [2022-11-25 23:33:44,426 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 23:33:44,427 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:33:44,427 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:33:44,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [152480676] [2022-11-25 23:33:44,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [152480676] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:33:44,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:33:44,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 23:33:44,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452612139] [2022-11-25 23:33:44,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:33:44,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:33:44,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:33:44,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:33:44,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:33:44,430 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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 23:33:44,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:33:44,709 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2022-11-25 23:33:44,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:33:44,710 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-11-25 23:33:44,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:33:44,710 INFO L225 Difference]: With dead ends: 62 [2022-11-25 23:33:44,710 INFO L226 Difference]: Without dead ends: 62 [2022-11-25 23:33:44,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:33:44,711 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 63 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:33:44,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 89 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:33:44,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-25 23:33:44,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-11-25 23:33:44,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 61 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 23:33:44,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2022-11-25 23:33:44,715 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 19 [2022-11-25 23:33:44,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:33:44,715 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2022-11-25 23:33:44,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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 23:33:44,716 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2022-11-25 23:33:44,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 23:33:44,716 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:33:44,716 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:33:44,736 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-25 23:33:44,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:33:44,926 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 23:33:44,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:33:44,926 INFO L85 PathProgramCache]: Analyzing trace with hash 673311177, now seen corresponding path program 1 times [2022-11-25 23:33:44,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:33:44,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [322283654] [2022-11-25 23:33:44,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:33:44,927 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:33:44,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:33:44,928 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:33:44,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-25 23:33:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:33:45,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 23:33:45,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:33:45,148 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 23:33:45,183 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 23:33:45,193 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 23:33:45,193 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:33:45,193 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:33:45,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [322283654] [2022-11-25 23:33:45,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [322283654] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:33:45,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:33:45,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:33:45,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766248839] [2022-11-25 23:33:45,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:33:45,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:33:45,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:33:45,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:33:45,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:33:45,195 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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 23:33:45,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:33:45,420 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-11-25 23:33:45,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:33:45,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-11-25 23:33:45,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:33:45,422 INFO L225 Difference]: With dead ends: 61 [2022-11-25 23:33:45,422 INFO L226 Difference]: Without dead ends: 61 [2022-11-25 23:33:45,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:33:45,423 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 60 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:33:45,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 81 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:33:45,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-25 23:33:45,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-11-25 23:33:45,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 60 states have internal predecessors, (63), 0 states have call successors, (0), 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 23:33:45,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2022-11-25 23:33:45,427 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 20 [2022-11-25 23:33:45,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:33:45,427 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2022-11-25 23:33:45,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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 23:33:45,428 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-11-25 23:33:45,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 23:33:45,428 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:33:45,428 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:33:45,445 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-25 23:33:45,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:33:45,645 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 23:33:45,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:33:45,645 INFO L85 PathProgramCache]: Analyzing trace with hash -602189896, now seen corresponding path program 1 times [2022-11-25 23:33:45,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:33:45,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [340168458] [2022-11-25 23:33:45,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:33:45,646 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:33:45,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:33:45,648 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:33:45,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-25 23:33:45,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:33:45,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 23:33:45,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:33:45,935 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 23:33:46,007 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 23 treesize of output 11 [2022-11-25 23:33:46,036 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 23:33:46,036 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:33:46,036 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:33:46,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [340168458] [2022-11-25 23:33:46,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [340168458] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:33:46,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:33:46,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:33:46,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393079376] [2022-11-25 23:33:46,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:33:46,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:33:46,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:33:46,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:33:46,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:33:46,038 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:33:46,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:33:46,424 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-11-25 23:33:46,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:33:46,425 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 23:33:46,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:33:46,426 INFO L225 Difference]: With dead ends: 60 [2022-11-25 23:33:46,426 INFO L226 Difference]: Without dead ends: 60 [2022-11-25 23:33:46,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-11-25 23:33:46,427 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 90 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:33:46,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 65 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:33:46,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-25 23:33:46,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-11-25 23:33:46,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 59 states have internal predecessors, (62), 0 states have call successors, (0), 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 23:33:46,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-11-25 23:33:46,430 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 21 [2022-11-25 23:33:46,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:33:46,430 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-11-25 23:33:46,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:33:46,430 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-11-25 23:33:46,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 23:33:46,431 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:33:46,431 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:33:46,450 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-25 23:33:46,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:33:46,632 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 23:33:46,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:33:46,632 INFO L85 PathProgramCache]: Analyzing trace with hash 717052317, now seen corresponding path program 1 times [2022-11-25 23:33:46,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:33:46,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [678125135] [2022-11-25 23:33:46,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:33:46,633 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:33:46,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:33:46,634 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:33:46,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-25 23:33:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:33:46,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-25 23:33:46,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:33:46,899 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 23:33:46,949 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-11-25 23:33:46,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-11-25 23:33:47,051 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 23:33:47,051 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 27 treesize of output 22 [2022-11-25 23:33:47,146 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 23:33:47,146 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 30 treesize of output 14 [2022-11-25 23:33:47,176 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:33:47,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:33:47,293 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 36 treesize of output 32 [2022-11-25 23:33:47,471 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:33:47,471 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:33:47,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [678125135] [2022-11-25 23:33:47,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [678125135] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:33:47,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [876506138] [2022-11-25 23:33:47,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:33:47,472 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 23:33:47,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 23:33:47,476 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 23:33:47,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2022-11-25 23:33:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:33:47,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-25 23:33:47,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:33:47,900 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 23:33:47,967 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-11-25 23:33:47,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-11-25 23:33:48,096 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 23:33:48,097 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 27 treesize of output 22 [2022-11-25 23:33:48,229 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 23:33:48,230 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 30 treesize of output 14 [2022-11-25 23:33:48,235 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:33:48,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:33:48,288 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 36 treesize of output 32 [2022-11-25 23:33:48,401 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:33:48,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [876506138] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:33:48,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018481121] [2022-11-25 23:33:48,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:33:48,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:33:48,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:33:48,408 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:33:48,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-25 23:33:48,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:33:48,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-25 23:33:48,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:33:48,584 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 23:33:48,635 INFO L321 Elim1Store]: treesize reduction 34, result has 37.0 percent of original size [2022-11-25 23:33:48,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 35 [2022-11-25 23:33:48,780 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 23:33:48,780 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 35 treesize of output 26 [2022-11-25 23:33:48,919 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 23:33:48,919 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 38 treesize of output 18 [2022-11-25 23:33:48,923 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:33:48,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:33:48,981 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 36 treesize of output 32 [2022-11-25 23:33:49,098 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:33:49,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018481121] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:33:49,099 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-25 23:33:49,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9, 8, 8, 8] total 22 [2022-11-25 23:33:49,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191289710] [2022-11-25 23:33:49,099 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-25 23:33:49,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-25 23:33:49,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:33:49,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-25 23:33:49,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2022-11-25 23:33:49,101 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 23 states, 22 states have (on average 2.590909090909091) internal successors, (57), 23 states have internal predecessors, (57), 0 states have call successors, (0), 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 23:33:51,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:33:51,121 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2022-11-25 23:33:51,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 23:33:51,122 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.590909090909091) internal successors, (57), 23 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 23:33:51,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:33:51,123 INFO L225 Difference]: With dead ends: 77 [2022-11-25 23:33:51,123 INFO L226 Difference]: Without dead ends: 77 [2022-11-25 23:33:51,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 94 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=229, Invalid=763, Unknown=0, NotChecked=0, Total=992 [2022-11-25 23:33:51,124 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 208 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:33:51,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 254 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-25 23:33:51,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-25 23:33:51,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 59. [2022-11-25 23:33:51,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 58 states have internal predecessors, (61), 0 states have call successors, (0), 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 23:33:51,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2022-11-25 23:33:51,126 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 21 [2022-11-25 23:33:51,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:33:51,127 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2022-11-25 23:33:51,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.590909090909091) internal successors, (57), 23 states have internal predecessors, (57), 0 states have call successors, (0), 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 23:33:51,127 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-11-25 23:33:51,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 23:33:51,127 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:33:51,127 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:33:51,152 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-25 23:33:51,349 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2022-11-25 23:33:51,551 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-25 23:33:51,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:33:51,747 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 23:33:51,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:33:51,748 INFO L85 PathProgramCache]: Analyzing trace with hash 717052318, now seen corresponding path program 1 times [2022-11-25 23:33:51,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:33:51,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1012964731] [2022-11-25 23:33:51,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:33:51,748 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:33:51,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:33:51,749 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:33:51,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-25 23:33:51,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:33:51,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-25 23:33:51,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:33:51,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:33:52,051 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 23:33:52,059 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 23:33:52,123 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2022-11-25 23:33:52,124 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 17 treesize of output 17 [2022-11-25 23:33:52,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 23:33:52,246 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 23:33:52,247 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 33 treesize of output 24 [2022-11-25 23:33:52,280 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 23:33:52,280 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 23 treesize of output 18 [2022-11-25 23:33:52,376 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 25 treesize of output 13 [2022-11-25 23:33:52,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 23:33:52,413 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:33:52,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:33:55,088 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 40 treesize of output 32 [2022-11-25 23:33:55,119 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 66 treesize of output 62 [2022-11-25 23:33:55,123 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 102 treesize of output 94 [2022-11-25 23:34:10,521 WARN L233 SmtUtils]: Spent 14.41s on a formula simplification. DAG size of input: 63 DAG size of output: 43 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:34:10,783 INFO L321 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2022-11-25 23:34:10,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 95 [2022-11-25 23:34:11,070 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 23:34:11,242 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:34:11,243 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:34:11,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1012964731] [2022-11-25 23:34:11,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1012964731] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:34:11,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1940153157] [2022-11-25 23:34:11,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:34:11,243 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 23:34:11,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 23:34:11,244 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 23:34:11,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2022-11-25 23:34:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:34:11,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-25 23:34:11,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:34:11,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 23:34:11,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:34:11,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:34:11,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 23:34:11,807 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:34:11,807 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 13 treesize of output 13 [2022-11-25 23:34:11,949 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 23:34:11,960 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 23:34:12,104 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2022-11-25 23:34:12,104 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 17 treesize of output 17 [2022-11-25 23:34:12,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 23:34:12,345 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 23:34:12,345 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 23 treesize of output 18 [2022-11-25 23:34:12,379 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 23:34:12,380 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 33 treesize of output 24 [2022-11-25 23:34:12,610 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 23:34:12,610 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 22 treesize of output 10 [2022-11-25 23:34:12,618 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 23:34:12,619 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 36 treesize of output 16 [2022-11-25 23:34:12,697 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:34:12,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:34:14,832 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (let ((.cse1 (bvadd (_ bv8 32) .cse0))) (and (or (bvule (bvadd (_ bv4 32) .cse0) .cse1) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_24| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_24|))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_24| (_ BitVec 32))) (or (forall ((v_ArrVal_382 (_ BitVec 32))) (bvule .cse1 (select (store |c_#length| |v_ULTIMATE.start_append_~item~0#1.base_24| v_ArrVal_382) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_24|)))))))) is different from false [2022-11-25 23:34:14,907 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 40 treesize of output 32 [2022-11-25 23:34:14,937 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 66 treesize of output 62 [2022-11-25 23:34:14,942 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 102 treesize of output 94 [2022-11-25 23:34:16,919 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:34:16,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 102 [2022-11-25 23:34:27,273 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:34:27,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1940153157] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:34:27,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713241239] [2022-11-25 23:34:27,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:34:27,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:34:27,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:34:27,276 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:34:27,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-25 23:34:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:34:27,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-25 23:34:27,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:34:27,519 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 23:34:27,528 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 23:34:27,610 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-25 23:34:27,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2022-11-25 23:34:27,642 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2022-11-25 23:34:27,642 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 17 treesize of output 17 [2022-11-25 23:34:27,716 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 23:34:27,716 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 23 treesize of output 18 [2022-11-25 23:34:27,754 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 23:34:27,755 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 33 treesize of output 24 [2022-11-25 23:34:27,849 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 25 treesize of output 13 [2022-11-25 23:34:27,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 23:34:27,863 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:34:27,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:34:28,236 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 40 treesize of output 32 [2022-11-25 23:34:28,272 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 66 treesize of output 62 [2022-11-25 23:34:28,277 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 102 treesize of output 94 [2022-11-25 23:34:29,908 INFO L321 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2022-11-25 23:34:29,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 95 [2022-11-25 23:34:29,945 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:34:29,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 116 [2022-11-25 23:34:30,147 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:34:30,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713241239] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:34:30,148 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-25 23:34:30,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9, 9, 8, 8] total 27 [2022-11-25 23:34:30,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395146775] [2022-11-25 23:34:30,148 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-25 23:34:30,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-25 23:34:30,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:34:30,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-25 23:34:30,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=4, NotChecked=50, Total=756 [2022-11-25 23:34:30,150 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand has 28 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 28 states have internal predecessors, (73), 0 states have call successors, (0), 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 23:34:34,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:34:34,923 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2022-11-25 23:34:34,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 23:34:34,924 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 28 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 23:34:34,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:34:34,925 INFO L225 Difference]: With dead ends: 79 [2022-11-25 23:34:34,925 INFO L226 Difference]: Without dead ends: 79 [2022-11-25 23:34:34,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 90 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 33.3s TimeCoverageRelationStatistics Valid=309, Invalid=1097, Unknown=4, NotChecked=72, Total=1482 [2022-11-25 23:34:34,927 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 150 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-25 23:34:34,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 342 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 616 Invalid, 0 Unknown, 73 Unchecked, 2.9s Time] [2022-11-25 23:34:34,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-25 23:34:34,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 58. [2022-11-25 23:34:34,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 57 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 23:34:34,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2022-11-25 23:34:34,930 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 21 [2022-11-25 23:34:34,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:34:34,930 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2022-11-25 23:34:34,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 28 states have internal predecessors, (73), 0 states have call successors, (0), 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 23:34:34,930 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2022-11-25 23:34:34,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 23:34:34,931 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:34:34,931 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:34:34,943 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-11-25 23:34:35,138 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2022-11-25 23:34:35,342 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-25 23:34:35,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:34:35,537 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 23:34:35,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:34:35,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1488017493, now seen corresponding path program 1 times [2022-11-25 23:34:35,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:34:35,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1476409835] [2022-11-25 23:34:35,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:34:35,538 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:34:35,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:34:35,540 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:34:35,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-25 23:34:35,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:34:35,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 23:34:35,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:34:35,742 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 23:34:35,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 23:34:35,805 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 23:34:35,805 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:34:35,805 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:34:35,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1476409835] [2022-11-25 23:34:35,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1476409835] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:34:35,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:34:35,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 23:34:35,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653359555] [2022-11-25 23:34:35,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:34:35,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:34:35,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:34:35,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:34:35,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:34:35,807 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:34:36,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:34:36,170 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2022-11-25 23:34:36,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:34:36,171 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-25 23:34:36,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:34:36,172 INFO L225 Difference]: With dead ends: 57 [2022-11-25 23:34:36,172 INFO L226 Difference]: Without dead ends: 57 [2022-11-25 23:34:36,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 23:34:36,173 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 66 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:34:36,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 65 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:34:36,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-25 23:34:36,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-11-25 23:34:36,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 56 states have internal predecessors, (59), 0 states have call successors, (0), 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 23:34:36,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2022-11-25 23:34:36,175 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 22 [2022-11-25 23:34:36,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:34:36,175 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2022-11-25 23:34:36,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:34:36,176 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-11-25 23:34:36,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 23:34:36,176 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:34:36,176 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:34:36,195 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-11-25 23:34:36,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:34:36,377 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 23:34:36,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:34:36,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1116098075, now seen corresponding path program 1 times [2022-11-25 23:34:36,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:34:36,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1483609644] [2022-11-25 23:34:36,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:34:36,378 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:34:36,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:34:36,379 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:34:36,389 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-11-25 23:34:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:34:36,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 23:34:36,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:34:36,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 23:34:36,539 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:34:36,539 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 13 treesize of output 13 [2022-11-25 23:34:36,642 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 23:34:36,724 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 8 [2022-11-25 23:34:36,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2022-11-25 23:34:36,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:34:36,768 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:34:36,768 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:34:36,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1483609644] [2022-11-25 23:34:36,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1483609644] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:34:36,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:34:36,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 23:34:36,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464241266] [2022-11-25 23:34:36,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:34:36,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:34:36,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:34:36,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:34:36,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:34:36,770 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:34:37,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:34:37,098 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2022-11-25 23:34:37,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 23:34:37,099 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-25 23:34:37,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:34:37,099 INFO L225 Difference]: With dead ends: 56 [2022-11-25 23:34:37,099 INFO L226 Difference]: Without dead ends: 56 [2022-11-25 23:34:37,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-25 23:34:37,100 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 83 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:34:37,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 48 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:34:37,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-25 23:34:37,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-11-25 23:34:37,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 55 states have internal predecessors, (58), 0 states have call successors, (0), 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 23:34:37,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2022-11-25 23:34:37,102 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 23 [2022-11-25 23:34:37,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:34:37,102 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2022-11-25 23:34:37,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:34:37,103 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2022-11-25 23:34:37,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 23:34:37,103 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:34:37,103 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:34:37,120 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-11-25 23:34:37,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:34:37,304 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 23:34:37,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:34:37,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1116098076, now seen corresponding path program 1 times [2022-11-25 23:34:37,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:34:37,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [590837259] [2022-11-25 23:34:37,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:34:37,305 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:34:37,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:34:37,306 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:34:37,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-11-25 23:34:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:34:37,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 23:34:37,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:34:37,509 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 23:34:37,509 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:34:37,509 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:34:37,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [590837259] [2022-11-25 23:34:37,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [590837259] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:34:37,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:34:37,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:34:37,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129519320] [2022-11-25 23:34:37,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:34:37,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:34:37,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:34:37,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:34:37,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:34:37,511 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:34:37,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:34:37,617 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2022-11-25 23:34:37,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:34:37,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-25 23:34:37,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:34:37,618 INFO L225 Difference]: With dead ends: 51 [2022-11-25 23:34:37,618 INFO L226 Difference]: Without dead ends: 51 [2022-11-25 23:34:37,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:34:37,618 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 55 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:34:37,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 27 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:34:37,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-25 23:34:37,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-11-25 23:34:37,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 50 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 23:34:37,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2022-11-25 23:34:37,621 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 23 [2022-11-25 23:34:37,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:34:37,621 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2022-11-25 23:34:37,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:34:37,622 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2022-11-25 23:34:37,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 23:34:37,622 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:34:37,622 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:34:37,641 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-11-25 23:34:37,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:34:37,834 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-25 23:34:37,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:34:37,834 INFO L85 PathProgramCache]: Analyzing trace with hash -599596191, now seen corresponding path program 1 times [2022-11-25 23:34:37,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:34:37,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1070728355] [2022-11-25 23:34:37,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:34:37,834 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:34:37,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:34:37,835 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:34:37,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-11-25 23:34:37,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 23:34:37,983 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 23:34:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 23:34:38,090 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-11-25 23:34:38,090 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 23:34:38,091 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK (40 of 41 remaining) [2022-11-25 23:34:38,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 41 remaining) [2022-11-25 23:34:38,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 41 remaining) [2022-11-25 23:34:38,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 41 remaining) [2022-11-25 23:34:38,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 41 remaining) [2022-11-25 23:34:38,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 41 remaining) [2022-11-25 23:34:38,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 41 remaining) [2022-11-25 23:34:38,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 41 remaining) [2022-11-25 23:34:38,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 41 remaining) [2022-11-25 23:34:38,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 41 remaining) [2022-11-25 23:34:38,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 41 remaining) [2022-11-25 23:34:38,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 41 remaining) [2022-11-25 23:34:38,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 41 remaining) [2022-11-25 23:34:38,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 41 remaining) [2022-11-25 23:34:38,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 41 remaining) [2022-11-25 23:34:38,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 41 remaining) [2022-11-25 23:34:38,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 41 remaining) [2022-11-25 23:34:38,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 41 remaining) [2022-11-25 23:34:38,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 41 remaining) [2022-11-25 23:34:38,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 41 remaining) [2022-11-25 23:34:38,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 41 remaining) [2022-11-25 23:34:38,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 41 remaining) [2022-11-25 23:34:38,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 41 remaining) [2022-11-25 23:34:38,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE (17 of 41 remaining) [2022-11-25 23:34:38,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE (16 of 41 remaining) [2022-11-25 23:34:38,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE (15 of 41 remaining) [2022-11-25 23:34:38,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 41 remaining) [2022-11-25 23:34:38,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 41 remaining) [2022-11-25 23:34:38,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 41 remaining) [2022-11-25 23:34:38,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 41 remaining) [2022-11-25 23:34:38,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 41 remaining) [2022-11-25 23:34:38,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 41 remaining) [2022-11-25 23:34:38,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 41 remaining) [2022-11-25 23:34:38,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 41 remaining) [2022-11-25 23:34:38,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 41 remaining) [2022-11-25 23:34:38,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 41 remaining) [2022-11-25 23:34:38,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE (4 of 41 remaining) [2022-11-25 23:34:38,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE (3 of 41 remaining) [2022-11-25 23:34:38,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE (2 of 41 remaining) [2022-11-25 23:34:38,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 41 remaining) [2022-11-25 23:34:38,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 41 remaining) [2022-11-25 23:34:38,137 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-11-25 23:34:38,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:34:38,311 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:34:38,314 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 23:34:38,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 11:34:38 BoogieIcfgContainer [2022-11-25 23:34:38,347 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 23:34:38,348 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 23:34:38,348 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 23:34:38,348 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 23:34:38,349 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:33:37" (3/4) ... [2022-11-25 23:34:38,355 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 23:34:38,355 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 23:34:38,356 INFO L158 Benchmark]: Toolchain (without parser) took 62774.39ms. Allocated memory was 81.8MB in the beginning and 119.5MB in the end (delta: 37.7MB). Free memory was 57.9MB in the beginning and 36.6MB in the end (delta: 21.3MB). Peak memory consumption was 58.3MB. Max. memory is 16.1GB. [2022-11-25 23:34:38,356 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 56.6MB. Free memory was 34.9MB in the beginning and 34.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:34:38,357 INFO L158 Benchmark]: CACSL2BoogieTranslator took 526.71ms. Allocated memory is still 81.8MB. Free memory was 57.9MB in the beginning and 40.4MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-25 23:34:38,357 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.54ms. Allocated memory is still 81.8MB. Free memory was 40.4MB in the beginning and 38.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:34:38,358 INFO L158 Benchmark]: Boogie Preprocessor took 34.14ms. Allocated memory is still 81.8MB. Free memory was 38.3MB in the beginning and 36.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:34:38,358 INFO L158 Benchmark]: RCFGBuilder took 842.96ms. Allocated memory is still 81.8MB. Free memory was 36.6MB in the beginning and 43.2MB in the end (delta: -6.6MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2022-11-25 23:34:38,359 INFO L158 Benchmark]: TraceAbstraction took 61307.54ms. Allocated memory was 81.8MB in the beginning and 119.5MB in the end (delta: 37.7MB). Free memory was 42.9MB in the beginning and 36.6MB in the end (delta: 6.3MB). Peak memory consumption was 45.1MB. Max. memory is 16.1GB. [2022-11-25 23:34:38,360 INFO L158 Benchmark]: Witness Printer took 7.27ms. Allocated memory is still 119.5MB. Free memory is still 36.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:34:38,364 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.30ms. Allocated memory is still 56.6MB. Free memory was 34.9MB in the beginning and 34.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 526.71ms. Allocated memory is still 81.8MB. Free memory was 57.9MB in the beginning and 40.4MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.54ms. Allocated memory is still 81.8MB. Free memory was 40.4MB in the beginning and 38.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.14ms. Allocated memory is still 81.8MB. Free memory was 38.3MB in the beginning and 36.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 842.96ms. Allocated memory is still 81.8MB. Free memory was 36.6MB in the beginning and 43.2MB in the end (delta: -6.6MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. * TraceAbstraction took 61307.54ms. Allocated memory was 81.8MB in the beginning and 119.5MB in the end (delta: 37.7MB). Free memory was 42.9MB in the beginning and 36.6MB in the end (delta: 6.3MB). Peak memory consumption was 45.1MB. Max. memory is 16.1GB. * Witness Printer took 7.27ms. Allocated memory is still 119.5MB. Free memory is still 36.6MB. There was no memory consumed. 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 - UnprovableResult [Line: 537]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 537. Possible FailurePath: [L539] struct item *list = ((void *)0); VAL [list={10:0}] [L541] CALL append(&list) [L530] struct item *item = malloc(sizeof *item); [L531] EXPR \read(**plist) VAL [\read(**plist)={0:0}, item={3:0}, plist={10:0}, plist={10:0}] [L531] item->next = *plist VAL [\read(**plist)={0:0}, item={3:0}, plist={10:0}, plist={10:0}] [L532] EXPR item->next VAL [item={3:0}, item->next={0:0}, plist={10:0}, plist={10:0}] [L532-L534] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L532-L534] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={7:0}, item={3:0}, item->next={0:0}, malloc(sizeof *item)={7:0}, plist={10:0}, plist={10:0}] [L532-L534] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={7:0}, item={3:0}, item->next={0:0}, malloc(sizeof *item)={7:0}, plist={10:0}, plist={10:0}] [L535] *plist = item VAL [item={3:0}, plist={10:0}, plist={10:0}] [L541] RET append(&list) [L542] COND FALSE !(__VERIFIER_nondet_int()) [L543] \read(*list) VAL [\read(*list)={3:0}, list={10:0}] [L543] COND TRUE \read(*list) [L544] EXPR \read(*list) VAL [\read(*list)={3:0}, list={10:0}] [L544] EXPR list->next VAL [\read(*list)={3:0}, list={10:0}, list->next={0:0}] [L544] struct item *next = list->next; [L545] EXPR \read(*list) VAL [\read(*list)={3:0}, list={10:0}, next={0:0}] [L545] free(list) VAL [\read(*list)={3:0}, list={10:0}, next={0:0}] [L545] free(list) VAL [\read(*list)={3:0}, list={10:0}, next={0:0}] [L545] free(list) [L546] list = next VAL [list={10:0}, next={0:0}] [L548] \read(*list) VAL [\read(*list)={0:0}, list={10:0}, next={0:0}] [L548] COND FALSE !(\read(*list)) [L553] return 0; [L539] struct item *list = ((void *)0); [L553] return 0; VAL [\result=0, next={0:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 81 locations, 41 error locations. Started 1 CEGAR loops. OverallTime: 61.2s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1610 SdHoareTripleChecker+Valid, 7.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1610 mSDsluCounter, 1653 SdHoareTripleChecker+Invalid, 7.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 73 IncrementalHoareTripleChecker+Unchecked, 1115 mSDsCounter, 101 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2221 IncrementalHoareTripleChecker+Invalid, 2395 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 101 mSolverCounterUnsat, 538 mSDtfsCounter, 2221 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 473 GetRequests, 328 SyntacticMatches, 9 SemanticMatches, 136 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 36.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=0, InterpolantAutomatonStates: 107, 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, 175 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 42.3s InterpolantComputationTime, 354 NumberOfCodeBlocks, 354 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 427 ConstructedInterpolants, 53 QuantifiedInterpolants, 6766 SizeOfPredicates, 206 NumberOfNonLiveVariables, 2239 ConjunctsInSsa, 294 ConjunctsInUnsatCore, 26 InterpolantComputations, 14 PerfectInterpolantSequences, 12/72 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-25 23:34:38,427 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928454fc-2f66-483f-bfb8-49a4d072d003/bin/utaipan-ByfvJB40ur/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: UNKNOWN: Overapproximated counterexample