./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0218.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0218.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh --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 d0144744ce48339ff9171f70682ff014d707c8affcdd45929fe7382e980b7693 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 15:34:33,937 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 15:34:33,939 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 15:34:33,951 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 15:34:33,951 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 15:34:33,952 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 15:34:33,953 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 15:34:33,954 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 15:34:33,955 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 15:34:33,955 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 15:34:33,956 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 15:34:33,957 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 15:34:33,957 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 15:34:33,957 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 15:34:33,958 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 15:34:33,959 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 15:34:33,959 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 15:34:33,960 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 15:34:33,961 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 15:34:33,962 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 15:34:33,963 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 15:34:33,964 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 15:34:33,965 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 15:34:33,965 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 15:34:33,973 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 15:34:33,973 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 15:34:33,973 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 15:34:33,974 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 15:34:33,974 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 15:34:33,975 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 15:34:33,975 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 15:34:33,976 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 15:34:33,976 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 15:34:33,977 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 15:34:33,977 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 15:34:33,978 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 15:34:33,978 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 15:34:33,978 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 15:34:33,978 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 15:34:33,979 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 15:34:33,980 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 15:34:33,980 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-12-14 15:34:33,995 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 15:34:33,995 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 15:34:33,995 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 15:34:33,995 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 15:34:33,996 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 15:34:34,001 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 15:34:34,001 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 15:34:34,001 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 15:34:34,001 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 15:34:34,001 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 15:34:34,001 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 15:34:34,001 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 15:34:34,001 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 15:34:34,002 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 15:34:34,002 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 15:34:34,002 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 15:34:34,002 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 15:34:34,002 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 15:34:34,002 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 15:34:34,002 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 15:34:34,003 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 15:34:34,003 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 15:34:34,003 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 15:34:34,003 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 15:34:34,003 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 15:34:34,003 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 15:34:34,003 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 15:34:34,003 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 15:34:34,003 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 15:34:34,003 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 15:34:34,004 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 15:34:34,004 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 15:34:34,004 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 15:34:34,004 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 15:34:34,004 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 15:34:34,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 15:34:34,004 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 15:34:34,004 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 15:34:34,004 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 15:34:34,004 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 15:34:34,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 15:34:34,005 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 15:34:34,005 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_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh 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 -> d0144744ce48339ff9171f70682ff014d707c8affcdd45929fe7382e980b7693 [2022-12-14 15:34:34,189 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 15:34:34,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 15:34:34,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 15:34:34,211 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 15:34:34,212 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 15:34:34,213 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/memsafety/test-0218.i [2022-12-14 15:34:36,842 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 15:34:37,038 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 15:34:37,038 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/sv-benchmarks/c/memsafety/test-0218.i [2022-12-14 15:34:37,050 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/data/61f82869e/6c9f58e867b0408c94be9a7a1837afc3/FLAG5de8d47ab [2022-12-14 15:34:37,063 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/data/61f82869e/6c9f58e867b0408c94be9a7a1837afc3 [2022-12-14 15:34:37,066 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 15:34:37,067 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 15:34:37,069 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 15:34:37,069 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 15:34:37,072 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 15:34:37,073 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:34:37" (1/1) ... [2022-12-14 15:34:37,074 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3463c30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:34:37, skipping insertion in model container [2022-12-14 15:34:37,074 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:34:37" (1/1) ... [2022-12-14 15:34:37,081 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 15:34:37,120 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 15:34:37,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 15:34:37,362 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 15:34:37,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 15:34:37,413 INFO L208 MainTranslator]: Completed translation [2022-12-14 15:34:37,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:34:37 WrapperNode [2022-12-14 15:34:37,414 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 15:34:37,414 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 15:34:37,414 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 15:34:37,414 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 15:34:37,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:34:37" (1/1) ... [2022-12-14 15:34:37,430 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:34:37" (1/1) ... [2022-12-14 15:34:37,448 INFO L138 Inliner]: procedures = 181, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 208 [2022-12-14 15:34:37,449 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 15:34:37,449 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 15:34:37,449 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 15:34:37,449 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 15:34:37,457 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:34:37" (1/1) ... [2022-12-14 15:34:37,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:34:37" (1/1) ... [2022-12-14 15:34:37,461 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:34:37" (1/1) ... [2022-12-14 15:34:37,461 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:34:37" (1/1) ... [2022-12-14 15:34:37,470 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:34:37" (1/1) ... [2022-12-14 15:34:37,474 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:34:37" (1/1) ... [2022-12-14 15:34:37,476 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:34:37" (1/1) ... [2022-12-14 15:34:37,478 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:34:37" (1/1) ... [2022-12-14 15:34:37,481 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 15:34:37,482 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 15:34:37,482 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 15:34:37,482 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 15:34:37,483 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:34:37" (1/1) ... [2022-12-14 15:34:37,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 15:34:37,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:34:37,510 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 15:34:37,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 15:34:37,545 INFO L130 BoogieDeclarations]: Found specification of procedure rand_end_point [2022-12-14 15:34:37,545 INFO L138 BoogieDeclarations]: Found implementation of procedure rand_end_point [2022-12-14 15:34:37,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 15:34:37,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 15:34:37,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 15:34:37,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 15:34:37,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 15:34:37,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-14 15:34:37,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 15:34:37,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 15:34:37,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 15:34:37,639 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 15:34:37,640 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 15:34:38,031 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 15:34:38,107 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 15:34:38,107 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-12-14 15:34:38,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:34:38 BoogieIcfgContainer [2022-12-14 15:34:38,110 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 15:34:38,112 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 15:34:38,113 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 15:34:38,115 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 15:34:38,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 03:34:37" (1/3) ... [2022-12-14 15:34:38,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19183510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:34:38, skipping insertion in model container [2022-12-14 15:34:38,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:34:37" (2/3) ... [2022-12-14 15:34:38,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19183510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:34:38, skipping insertion in model container [2022-12-14 15:34:38,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:34:38" (3/3) ... [2022-12-14 15:34:38,118 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0218.i [2022-12-14 15:34:38,133 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 15:34:38,133 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2022-12-14 15:34:38,174 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 15:34:38,180 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;@6b4e13c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 15:34:38,180 INFO L358 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2022-12-14 15:34:38,184 INFO L276 IsEmpty]: Start isEmpty. Operand has 135 states, 66 states have (on average 2.257575757575758) internal successors, (149), 131 states have internal predecessors, (149), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 15:34:38,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 15:34:38,189 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:34:38,189 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 15:34:38,190 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:34:38,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:34:38,194 INFO L85 PathProgramCache]: Analyzing trace with hash 10112027, now seen corresponding path program 1 times [2022-12-14 15:34:38,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:34:38,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282509052] [2022-12-14 15:34:38,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:38,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:34:38,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:38,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:38,311 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:34:38,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282509052] [2022-12-14 15:34:38,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282509052] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:34:38,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:34:38,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:34:38,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27400018] [2022-12-14 15:34:38,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:34:38,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 15:34:38,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:34:38,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 15:34:38,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 15:34:38,348 INFO L87 Difference]: Start difference. First operand has 135 states, 66 states have (on average 2.257575757575758) internal successors, (149), 131 states have internal predecessors, (149), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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-12-14 15:34:38,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:34:38,407 INFO L93 Difference]: Finished difference Result 135 states and 149 transitions. [2022-12-14 15:34:38,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 15:34:38,409 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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-12-14 15:34:38,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:34:38,416 INFO L225 Difference]: With dead ends: 135 [2022-12-14 15:34:38,416 INFO L226 Difference]: Without dead ends: 134 [2022-12-14 15:34:38,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 15:34:38,420 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:34:38,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:34:38,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-12-14 15:34:38,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-12-14 15:34:38,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 66 states have (on average 2.1818181818181817) internal successors, (144), 130 states have internal predecessors, (144), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 15:34:38,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 148 transitions. [2022-12-14 15:34:38,456 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 148 transitions. Word has length 4 [2022-12-14 15:34:38,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:34:38,456 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 148 transitions. [2022-12-14 15:34:38,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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-12-14 15:34:38,457 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 148 transitions. [2022-12-14 15:34:38,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 15:34:38,457 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:34:38,457 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 15:34:38,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 15:34:38,457 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:34:38,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:34:38,458 INFO L85 PathProgramCache]: Analyzing trace with hash 306098105, now seen corresponding path program 1 times [2022-12-14 15:34:38,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:34:38,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124093979] [2022-12-14 15:34:38,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:38,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:34:38,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:38,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:38,561 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:34:38,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124093979] [2022-12-14 15:34:38,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124093979] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:34:38,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:34:38,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 15:34:38,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645701140] [2022-12-14 15:34:38,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:34:38,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:34:38,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:34:38,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:34:38,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:34:38,564 INFO L87 Difference]: Start difference. First operand 134 states and 148 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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-12-14 15:34:38,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:34:38,748 INFO L93 Difference]: Finished difference Result 261 states and 288 transitions. [2022-12-14 15:34:38,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:34:38,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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-12-14 15:34:38,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:34:38,751 INFO L225 Difference]: With dead ends: 261 [2022-12-14 15:34:38,751 INFO L226 Difference]: Without dead ends: 261 [2022-12-14 15:34:38,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-12-14 15:34:38,752 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 132 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:34:38,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 158 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:34:38,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-12-14 15:34:38,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 176. [2022-12-14 15:34:38,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 105 states have (on average 2.1619047619047618) internal successors, (227), 169 states have internal predecessors, (227), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-14 15:34:38,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 235 transitions. [2022-12-14 15:34:38,766 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 235 transitions. Word has length 5 [2022-12-14 15:34:38,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:34:38,767 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 235 transitions. [2022-12-14 15:34:38,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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-12-14 15:34:38,767 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 235 transitions. [2022-12-14 15:34:38,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 15:34:38,767 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:34:38,767 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 15:34:38,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 15:34:38,768 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:34:38,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:34:38,768 INFO L85 PathProgramCache]: Analyzing trace with hash 306098106, now seen corresponding path program 1 times [2022-12-14 15:34:38,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:34:38,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399134] [2022-12-14 15:34:38,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:38,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:34:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:38,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:38,940 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:34:38,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399134] [2022-12-14 15:34:38,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399134] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:34:38,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:34:38,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:34:38,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989651129] [2022-12-14 15:34:38,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:34:38,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:34:38,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:34:38,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:34:38,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:34:38,943 INFO L87 Difference]: Start difference. First operand 176 states and 235 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) 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-12-14 15:34:39,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:34:39,045 INFO L93 Difference]: Finished difference Result 175 states and 233 transitions. [2022-12-14 15:34:39,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:34:39,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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-12-14 15:34:39,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:34:39,046 INFO L225 Difference]: With dead ends: 175 [2022-12-14 15:34:39,046 INFO L226 Difference]: Without dead ends: 175 [2022-12-14 15:34:39,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-12-14 15:34:39,048 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 156 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:34:39,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 158 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:34:39,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-12-14 15:34:39,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2022-12-14 15:34:39,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 105 states have (on average 2.142857142857143) internal successors, (225), 168 states have internal predecessors, (225), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-14 15:34:39,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 233 transitions. [2022-12-14 15:34:39,060 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 233 transitions. Word has length 5 [2022-12-14 15:34:39,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:34:39,060 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 233 transitions. [2022-12-14 15:34:39,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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-12-14 15:34:39,060 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 233 transitions. [2022-12-14 15:34:39,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 15:34:39,060 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:34:39,061 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:34:39,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 15:34:39,061 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:34:39,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:34:39,061 INFO L85 PathProgramCache]: Analyzing trace with hash 2102544157, now seen corresponding path program 1 times [2022-12-14 15:34:39,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:34:39,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119211270] [2022-12-14 15:34:39,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:39,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:34:39,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:39,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:39,300 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:34:39,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119211270] [2022-12-14 15:34:39,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119211270] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:34:39,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:34:39,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:34:39,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107577836] [2022-12-14 15:34:39,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:34:39,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 15:34:39,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:34:39,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 15:34:39,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:34:39,302 INFO L87 Difference]: Start difference. First operand 175 states and 233 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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-12-14 15:34:39,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:34:39,524 INFO L93 Difference]: Finished difference Result 292 states and 383 transitions. [2022-12-14 15:34:39,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 15:34:39,525 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-12-14 15:34:39,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:34:39,527 INFO L225 Difference]: With dead ends: 292 [2022-12-14 15:34:39,527 INFO L226 Difference]: Without dead ends: 292 [2022-12-14 15:34:39,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:34:39,528 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 93 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:34:39,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 362 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:34:39,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-12-14 15:34:39,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 227. [2022-12-14 15:34:39,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 151 states have (on average 2.0264900662251657) internal successors, (306), 216 states have internal predecessors, (306), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-14 15:34:39,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 322 transitions. [2022-12-14 15:34:39,536 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 322 transitions. Word has length 7 [2022-12-14 15:34:39,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:34:39,536 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 322 transitions. [2022-12-14 15:34:39,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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-12-14 15:34:39,536 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 322 transitions. [2022-12-14 15:34:39,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 15:34:39,537 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:34:39,537 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:34:39,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 15:34:39,537 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:34:39,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:34:39,537 INFO L85 PathProgramCache]: Analyzing trace with hash 2102545535, now seen corresponding path program 1 times [2022-12-14 15:34:39,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:34:39,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372827323] [2022-12-14 15:34:39,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:39,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:34:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:39,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:39,551 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:34:39,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372827323] [2022-12-14 15:34:39,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372827323] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:34:39,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:34:39,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 15:34:39,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424180622] [2022-12-14 15:34:39,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:34:39,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:34:39,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:34:39,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:34:39,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:34:39,553 INFO L87 Difference]: Start difference. First operand 227 states and 322 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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-12-14 15:34:39,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:34:39,652 INFO L93 Difference]: Finished difference Result 274 states and 365 transitions. [2022-12-14 15:34:39,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:34:39,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-12-14 15:34:39,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:34:39,655 INFO L225 Difference]: With dead ends: 274 [2022-12-14 15:34:39,655 INFO L226 Difference]: Without dead ends: 270 [2022-12-14 15:34:39,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-12-14 15:34:39,656 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 58 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:34:39,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 183 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:34:39,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-12-14 15:34:39,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 225. [2022-12-14 15:34:39,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 149 states have (on average 2.033557046979866) internal successors, (303), 214 states have internal predecessors, (303), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-14 15:34:39,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 319 transitions. [2022-12-14 15:34:39,666 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 319 transitions. Word has length 7 [2022-12-14 15:34:39,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:34:39,666 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 319 transitions. [2022-12-14 15:34:39,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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-12-14 15:34:39,666 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 319 transitions. [2022-12-14 15:34:39,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 15:34:39,667 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:34:39,667 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:34:39,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 15:34:39,667 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:34:39,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:34:39,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1319665124, now seen corresponding path program 1 times [2022-12-14 15:34:39,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:34:39,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969682282] [2022-12-14 15:34:39,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:39,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:34:39,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:39,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:39,758 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:34:39,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969682282] [2022-12-14 15:34:39,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969682282] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:34:39,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:34:39,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:34:39,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316541768] [2022-12-14 15:34:39,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:34:39,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:34:39,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:34:39,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:34:39,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:34:39,760 INFO L87 Difference]: Start difference. First operand 225 states and 319 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:34:39,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:34:39,980 INFO L93 Difference]: Finished difference Result 423 states and 491 transitions. [2022-12-14 15:34:39,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 15:34:39,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-12-14 15:34:39,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:34:39,983 INFO L225 Difference]: With dead ends: 423 [2022-12-14 15:34:39,983 INFO L226 Difference]: Without dead ends: 423 [2022-12-14 15:34:39,983 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-12-14 15:34:39,984 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 373 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:34:39,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 279 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:34:39,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-12-14 15:34:39,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 222. [2022-12-14 15:34:39,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 150 states have (on average 1.98) internal successors, (297), 211 states have internal predecessors, (297), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-14 15:34:39,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 313 transitions. [2022-12-14 15:34:39,995 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 313 transitions. Word has length 10 [2022-12-14 15:34:39,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:34:39,995 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 313 transitions. [2022-12-14 15:34:39,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:34:39,996 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 313 transitions. [2022-12-14 15:34:39,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 15:34:39,996 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:34:39,996 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:34:39,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 15:34:39,996 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:34:39,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:34:39,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1319665123, now seen corresponding path program 1 times [2022-12-14 15:34:39,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:34:39,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13974594] [2022-12-14 15:34:39,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:39,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:34:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:40,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:40,209 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:34:40,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13974594] [2022-12-14 15:34:40,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13974594] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:34:40,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:34:40,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 15:34:40,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82579352] [2022-12-14 15:34:40,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:34:40,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 15:34:40,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:34:40,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 15:34:40,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:34:40,211 INFO L87 Difference]: Start difference. First operand 222 states and 313 transitions. Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:34:40,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:34:40,779 INFO L93 Difference]: Finished difference Result 505 states and 604 transitions. [2022-12-14 15:34:40,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 15:34:40,779 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-12-14 15:34:40,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:34:40,781 INFO L225 Difference]: With dead ends: 505 [2022-12-14 15:34:40,781 INFO L226 Difference]: Without dead ends: 505 [2022-12-14 15:34:40,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-12-14 15:34:40,782 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 486 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:34:40,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 363 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 15:34:40,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-12-14 15:34:40,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 236. [2022-12-14 15:34:40,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 164 states have (on average 1.975609756097561) internal successors, (324), 225 states have internal predecessors, (324), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-14 15:34:40,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 340 transitions. [2022-12-14 15:34:40,793 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 340 transitions. Word has length 10 [2022-12-14 15:34:40,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:34:40,793 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 340 transitions. [2022-12-14 15:34:40,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:34:40,794 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 340 transitions. [2022-12-14 15:34:40,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 15:34:40,794 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:34:40,794 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:34:40,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 15:34:40,795 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:34:40,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:34:40,795 INFO L85 PathProgramCache]: Analyzing trace with hash 618160145, now seen corresponding path program 1 times [2022-12-14 15:34:40,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:34:40,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721639972] [2022-12-14 15:34:40,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:40,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:34:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:40,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:40,836 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:34:40,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721639972] [2022-12-14 15:34:40,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721639972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:34:40,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:34:40,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:34:40,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588846035] [2022-12-14 15:34:40,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:34:40,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:34:40,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:34:40,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:34:40,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:34:40,838 INFO L87 Difference]: Start difference. First operand 236 states and 340 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:34:41,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:34:41,020 INFO L93 Difference]: Finished difference Result 417 states and 533 transitions. [2022-12-14 15:34:41,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:34:41,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-12-14 15:34:41,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:34:41,022 INFO L225 Difference]: With dead ends: 417 [2022-12-14 15:34:41,022 INFO L226 Difference]: Without dead ends: 417 [2022-12-14 15:34:41,023 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-12-14 15:34:41,023 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 242 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:34:41,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 271 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:34:41,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2022-12-14 15:34:41,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 242. [2022-12-14 15:34:41,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 170 states have (on average 1.9411764705882353) internal successors, (330), 231 states have internal predecessors, (330), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-14 15:34:41,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 346 transitions. [2022-12-14 15:34:41,033 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 346 transitions. Word has length 12 [2022-12-14 15:34:41,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:34:41,033 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 346 transitions. [2022-12-14 15:34:41,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:34:41,033 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 346 transitions. [2022-12-14 15:34:41,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 15:34:41,034 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:34:41,034 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:34:41,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 15:34:41,034 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:34:41,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:34:41,035 INFO L85 PathProgramCache]: Analyzing trace with hash 618160146, now seen corresponding path program 1 times [2022-12-14 15:34:41,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:34:41,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469766949] [2022-12-14 15:34:41,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:41,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:34:41,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:41,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:41,108 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:34:41,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469766949] [2022-12-14 15:34:41,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469766949] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:34:41,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:34:41,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:34:41,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570147561] [2022-12-14 15:34:41,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:34:41,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:34:41,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:34:41,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:34:41,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:34:41,109 INFO L87 Difference]: Start difference. First operand 242 states and 346 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:34:41,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:34:41,255 INFO L93 Difference]: Finished difference Result 333 states and 457 transitions. [2022-12-14 15:34:41,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:34:41,255 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-12-14 15:34:41,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:34:41,257 INFO L225 Difference]: With dead ends: 333 [2022-12-14 15:34:41,257 INFO L226 Difference]: Without dead ends: 333 [2022-12-14 15:34:41,257 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-12-14 15:34:41,257 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 264 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:34:41,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 158 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:34:41,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-12-14 15:34:41,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 239. [2022-12-14 15:34:41,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 170 states have (on average 1.8705882352941177) internal successors, (318), 228 states have internal predecessors, (318), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-14 15:34:41,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 334 transitions. [2022-12-14 15:34:41,265 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 334 transitions. Word has length 12 [2022-12-14 15:34:41,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:34:41,266 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 334 transitions. [2022-12-14 15:34:41,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:34:41,266 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 334 transitions. [2022-12-14 15:34:41,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 15:34:41,266 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:34:41,266 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:34:41,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 15:34:41,267 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:34:41,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:34:41,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1994574821, now seen corresponding path program 1 times [2022-12-14 15:34:41,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:34:41,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388502489] [2022-12-14 15:34:41,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:41,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:34:41,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:41,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:41,521 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:34:41,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388502489] [2022-12-14 15:34:41,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388502489] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:34:41,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:34:41,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 15:34:41,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310596855] [2022-12-14 15:34:41,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:34:41,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 15:34:41,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:34:41,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 15:34:41,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-14 15:34:41,523 INFO L87 Difference]: Start difference. First operand 239 states and 334 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:34:41,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:34:41,787 INFO L93 Difference]: Finished difference Result 328 states and 428 transitions. [2022-12-14 15:34:41,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 15:34:41,787 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-12-14 15:34:41,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:34:41,788 INFO L225 Difference]: With dead ends: 328 [2022-12-14 15:34:41,788 INFO L226 Difference]: Without dead ends: 328 [2022-12-14 15:34:41,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-12-14 15:34:41,789 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 141 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:34:41,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 569 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:34:41,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-12-14 15:34:41,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 245. [2022-12-14 15:34:41,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 176 states have (on average 1.8522727272727273) internal successors, (326), 232 states have internal predecessors, (326), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-14 15:34:41,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 342 transitions. [2022-12-14 15:34:41,794 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 342 transitions. Word has length 13 [2022-12-14 15:34:41,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:34:41,794 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 342 transitions. [2022-12-14 15:34:41,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:34:41,794 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 342 transitions. [2022-12-14 15:34:41,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 15:34:41,795 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:34:41,795 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:34:41,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 15:34:41,795 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:34:41,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:34:41,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1247070466, now seen corresponding path program 1 times [2022-12-14 15:34:41,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:34:41,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926829621] [2022-12-14 15:34:41,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:41,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:34:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:42,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:42,017 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:34:42,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926829621] [2022-12-14 15:34:42,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926829621] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:34:42,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:34:42,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 15:34:42,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927967904] [2022-12-14 15:34:42,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:34:42,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 15:34:42,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:34:42,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 15:34:42,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-14 15:34:42,019 INFO L87 Difference]: Start difference. First operand 245 states and 342 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:34:42,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:34:42,274 INFO L93 Difference]: Finished difference Result 324 states and 428 transitions. [2022-12-14 15:34:42,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 15:34:42,275 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-12-14 15:34:42,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:34:42,276 INFO L225 Difference]: With dead ends: 324 [2022-12-14 15:34:42,276 INFO L226 Difference]: Without dead ends: 324 [2022-12-14 15:34:42,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-12-14 15:34:42,277 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 458 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:34:42,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 440 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:34:42,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-12-14 15:34:42,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 244. [2022-12-14 15:34:42,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 176 states have (on average 1.8352272727272727) internal successors, (323), 231 states have internal predecessors, (323), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-14 15:34:42,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 339 transitions. [2022-12-14 15:34:42,285 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 339 transitions. Word has length 15 [2022-12-14 15:34:42,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:34:42,285 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 339 transitions. [2022-12-14 15:34:42,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:34:42,285 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 339 transitions. [2022-12-14 15:34:42,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 15:34:42,286 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:34:42,286 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:34:42,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 15:34:42,286 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:34:42,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:34:42,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1247070465, now seen corresponding path program 1 times [2022-12-14 15:34:42,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:34:42,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956748667] [2022-12-14 15:34:42,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:42,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:34:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:42,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:42,322 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:34:42,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956748667] [2022-12-14 15:34:42,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956748667] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:34:42,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:34:42,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:34:42,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530703011] [2022-12-14 15:34:42,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:34:42,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:34:42,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:34:42,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:34:42,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:34:42,324 INFO L87 Difference]: Start difference. First operand 244 states and 339 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:34:42,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:34:42,416 INFO L93 Difference]: Finished difference Result 314 states and 413 transitions. [2022-12-14 15:34:42,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:34:42,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-12-14 15:34:42,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:34:42,418 INFO L225 Difference]: With dead ends: 314 [2022-12-14 15:34:42,418 INFO L226 Difference]: Without dead ends: 314 [2022-12-14 15:34:42,418 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-12-14 15:34:42,418 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 115 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:34:42,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 181 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:34:42,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2022-12-14 15:34:42,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 242. [2022-12-14 15:34:42,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 176 states have (on average 1.8011363636363635) internal successors, (317), 229 states have internal predecessors, (317), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-14 15:34:42,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 333 transitions. [2022-12-14 15:34:42,426 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 333 transitions. Word has length 15 [2022-12-14 15:34:42,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:34:42,426 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 333 transitions. [2022-12-14 15:34:42,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:34:42,427 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 333 transitions. [2022-12-14 15:34:42,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 15:34:42,427 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:34:42,427 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:34:42,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 15:34:42,428 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:34:42,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:34:42,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1247072285, now seen corresponding path program 1 times [2022-12-14 15:34:42,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:34:42,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253073117] [2022-12-14 15:34:42,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:42,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:34:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:42,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:42,466 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:34:42,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253073117] [2022-12-14 15:34:42,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253073117] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:34:42,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:34:42,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:34:42,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128353972] [2022-12-14 15:34:42,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:34:42,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:34:42,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:34:42,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:34:42,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:34:42,468 INFO L87 Difference]: Start difference. First operand 242 states and 333 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:34:42,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:34:42,507 INFO L93 Difference]: Finished difference Result 248 states and 339 transitions. [2022-12-14 15:34:42,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:34:42,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-12-14 15:34:42,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:34:42,508 INFO L225 Difference]: With dead ends: 248 [2022-12-14 15:34:42,508 INFO L226 Difference]: Without dead ends: 248 [2022-12-14 15:34:42,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:34:42,509 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:34:42,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 341 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:34:42,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-12-14 15:34:42,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2022-12-14 15:34:42,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 182 states have (on average 1.7747252747252746) internal successors, (323), 235 states have internal predecessors, (323), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-14 15:34:42,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 339 transitions. [2022-12-14 15:34:42,515 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 339 transitions. Word has length 15 [2022-12-14 15:34:42,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:34:42,516 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 339 transitions. [2022-12-14 15:34:42,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:34:42,516 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 339 transitions. [2022-12-14 15:34:42,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 15:34:42,517 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:34:42,517 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:34:42,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 15:34:42,517 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:34:42,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:34:42,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1249371700, now seen corresponding path program 1 times [2022-12-14 15:34:42,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:34:42,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649231565] [2022-12-14 15:34:42,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:42,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:34:42,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:42,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:42,707 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:34:42,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649231565] [2022-12-14 15:34:42,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649231565] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:34:42,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:34:42,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 15:34:42,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748182031] [2022-12-14 15:34:42,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:34:42,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 15:34:42,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:34:42,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 15:34:42,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:34:42,708 INFO L87 Difference]: Start difference. First operand 248 states and 339 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:34:42,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:34:42,996 INFO L93 Difference]: Finished difference Result 428 states and 556 transitions. [2022-12-14 15:34:42,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 15:34:42,996 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-12-14 15:34:42,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:34:42,997 INFO L225 Difference]: With dead ends: 428 [2022-12-14 15:34:42,997 INFO L226 Difference]: Without dead ends: 428 [2022-12-14 15:34:42,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-14 15:34:42,998 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 327 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:34:42,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 585 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:34:42,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-12-14 15:34:43,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 242. [2022-12-14 15:34:43,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 176 states have (on average 1.7727272727272727) internal successors, (312), 229 states have internal predecessors, (312), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-14 15:34:43,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 328 transitions. [2022-12-14 15:34:43,003 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 328 transitions. Word has length 16 [2022-12-14 15:34:43,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:34:43,003 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 328 transitions. [2022-12-14 15:34:43,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:34:43,003 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 328 transitions. [2022-12-14 15:34:43,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 15:34:43,004 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:34:43,004 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:34:43,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 15:34:43,004 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:34:43,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:34:43,004 INFO L85 PathProgramCache]: Analyzing trace with hash 76171312, now seen corresponding path program 1 times [2022-12-14 15:34:43,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:34:43,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123810692] [2022-12-14 15:34:43,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:43,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:34:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:43,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:43,039 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:34:43,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123810692] [2022-12-14 15:34:43,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123810692] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:34:43,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:34:43,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:34:43,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23230114] [2022-12-14 15:34:43,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:34:43,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:34:43,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:34:43,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:34:43,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:34:43,041 INFO L87 Difference]: Start difference. First operand 242 states and 328 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:34:43,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:34:43,252 INFO L93 Difference]: Finished difference Result 410 states and 508 transitions. [2022-12-14 15:34:43,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:34:43,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-12-14 15:34:43,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:34:43,255 INFO L225 Difference]: With dead ends: 410 [2022-12-14 15:34:43,255 INFO L226 Difference]: Without dead ends: 410 [2022-12-14 15:34:43,255 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-12-14 15:34:43,255 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 215 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:34:43,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 266 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:34:43,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-12-14 15:34:43,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 254. [2022-12-14 15:34:43,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 188 states have (on average 1.797872340425532) internal successors, (338), 241 states have internal predecessors, (338), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-14 15:34:43,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 354 transitions. [2022-12-14 15:34:43,262 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 354 transitions. Word has length 17 [2022-12-14 15:34:43,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:34:43,263 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 354 transitions. [2022-12-14 15:34:43,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:34:43,263 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 354 transitions. [2022-12-14 15:34:43,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 15:34:43,263 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:34:43,263 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:34:43,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-14 15:34:43,264 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:34:43,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:34:43,264 INFO L85 PathProgramCache]: Analyzing trace with hash 76171313, now seen corresponding path program 1 times [2022-12-14 15:34:43,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:34:43,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901881617] [2022-12-14 15:34:43,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:43,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:34:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:43,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:43,344 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:34:43,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901881617] [2022-12-14 15:34:43,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901881617] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:34:43,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:34:43,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:34:43,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299182989] [2022-12-14 15:34:43,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:34:43,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 15:34:43,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:34:43,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 15:34:43,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:34:43,345 INFO L87 Difference]: Start difference. First operand 254 states and 354 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:34:43,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:34:43,495 INFO L93 Difference]: Finished difference Result 349 states and 466 transitions. [2022-12-14 15:34:43,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:34:43,495 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-12-14 15:34:43,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:34:43,496 INFO L225 Difference]: With dead ends: 349 [2022-12-14 15:34:43,496 INFO L226 Difference]: Without dead ends: 349 [2022-12-14 15:34:43,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:34:43,497 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 251 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:34:43,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 191 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:34:43,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-12-14 15:34:43,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 251. [2022-12-14 15:34:43,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 188 states have (on average 1.7340425531914894) internal successors, (326), 238 states have internal predecessors, (326), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-14 15:34:43,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 342 transitions. [2022-12-14 15:34:43,501 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 342 transitions. Word has length 17 [2022-12-14 15:34:43,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:34:43,502 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 342 transitions. [2022-12-14 15:34:43,502 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:34:43,502 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 342 transitions. [2022-12-14 15:34:43,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 15:34:43,502 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:34:43,502 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:34:43,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-14 15:34:43,502 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:34:43,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:34:43,503 INFO L85 PathProgramCache]: Analyzing trace with hash 138843490, now seen corresponding path program 1 times [2022-12-14 15:34:43,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:34:43,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116279561] [2022-12-14 15:34:43,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:43,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:34:43,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:43,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:43,554 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:34:43,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116279561] [2022-12-14 15:34:43,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116279561] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:34:43,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:34:43,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 15:34:43,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079045] [2022-12-14 15:34:43,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:34:43,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 15:34:43,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:34:43,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 15:34:43,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:34:43,555 INFO L87 Difference]: Start difference. First operand 251 states and 342 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:34:43,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:34:43,672 INFO L93 Difference]: Finished difference Result 401 states and 534 transitions. [2022-12-14 15:34:43,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 15:34:43,673 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-12-14 15:34:43,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:34:43,674 INFO L225 Difference]: With dead ends: 401 [2022-12-14 15:34:43,674 INFO L226 Difference]: Without dead ends: 401 [2022-12-14 15:34:43,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:34:43,675 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 116 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:34:43,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 410 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:34:43,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2022-12-14 15:34:43,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 266. [2022-12-14 15:34:43,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 203 states have (on average 1.7044334975369457) internal successors, (346), 253 states have internal predecessors, (346), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-14 15:34:43,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 362 transitions. [2022-12-14 15:34:43,682 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 362 transitions. Word has length 17 [2022-12-14 15:34:43,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:34:43,683 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 362 transitions. [2022-12-14 15:34:43,683 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:34:43,683 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 362 transitions. [2022-12-14 15:34:43,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 15:34:43,683 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:34:43,683 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:34:43,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-14 15:34:43,684 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:34:43,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:34:43,684 INFO L85 PathProgramCache]: Analyzing trace with hash 138843684, now seen corresponding path program 1 times [2022-12-14 15:34:43,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:34:43,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098542182] [2022-12-14 15:34:43,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:43,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:34:43,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:43,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:43,907 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:34:43,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098542182] [2022-12-14 15:34:43,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098542182] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:34:43,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:34:43,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 15:34:43,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84027661] [2022-12-14 15:34:43,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:34:43,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 15:34:43,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:34:43,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 15:34:43,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-14 15:34:43,908 INFO L87 Difference]: Start difference. First operand 266 states and 362 transitions. Second operand has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:34:44,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:34:44,111 INFO L93 Difference]: Finished difference Result 346 states and 452 transitions. [2022-12-14 15:34:44,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 15:34:44,111 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-12-14 15:34:44,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:34:44,112 INFO L225 Difference]: With dead ends: 346 [2022-12-14 15:34:44,112 INFO L226 Difference]: Without dead ends: 346 [2022-12-14 15:34:44,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-12-14 15:34:44,113 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 433 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:34:44,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 435 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:34:44,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-12-14 15:34:44,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 265. [2022-12-14 15:34:44,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 203 states have (on average 1.6748768472906403) internal successors, (340), 252 states have internal predecessors, (340), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-14 15:34:44,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 356 transitions. [2022-12-14 15:34:44,117 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 356 transitions. Word has length 17 [2022-12-14 15:34:44,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:34:44,118 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 356 transitions. [2022-12-14 15:34:44,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:34:44,118 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 356 transitions. [2022-12-14 15:34:44,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 15:34:44,118 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:34:44,118 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-12-14 15:34:44,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-14 15:34:44,118 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:34:44,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:34:44,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1476989240, now seen corresponding path program 1 times [2022-12-14 15:34:44,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:34:44,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087672121] [2022-12-14 15:34:44,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:44,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:34:44,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:44,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:44,283 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:34:44,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087672121] [2022-12-14 15:34:44,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087672121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:34:44,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:34:44,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 15:34:44,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100187110] [2022-12-14 15:34:44,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:34:44,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 15:34:44,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:34:44,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 15:34:44,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-14 15:34:44,284 INFO L87 Difference]: Start difference. First operand 265 states and 356 transitions. Second operand has 8 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:34:44,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:34:44,712 INFO L93 Difference]: Finished difference Result 461 states and 596 transitions. [2022-12-14 15:34:44,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 15:34:44,712 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-12-14 15:34:44,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:34:44,715 INFO L225 Difference]: With dead ends: 461 [2022-12-14 15:34:44,715 INFO L226 Difference]: Without dead ends: 461 [2022-12-14 15:34:44,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:34:44,716 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 500 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:34:44,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 646 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:34:44,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2022-12-14 15:34:44,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 263. [2022-12-14 15:34:44,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 203 states have (on average 1.6551724137931034) internal successors, (336), 250 states have internal predecessors, (336), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-14 15:34:44,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 352 transitions. [2022-12-14 15:34:44,721 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 352 transitions. Word has length 20 [2022-12-14 15:34:44,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:34:44,721 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 352 transitions. [2022-12-14 15:34:44,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:34:44,721 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 352 transitions. [2022-12-14 15:34:44,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 15:34:44,722 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:34:44,722 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-12-14 15:34:44,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-14 15:34:44,722 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:34:44,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:34:44,722 INFO L85 PathProgramCache]: Analyzing trace with hash 244645951, now seen corresponding path program 1 times [2022-12-14 15:34:44,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:34:44,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179711884] [2022-12-14 15:34:44,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:44,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:34:44,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:44,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:44,803 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:34:44,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179711884] [2022-12-14 15:34:44,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179711884] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:34:44,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:34:44,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:34:44,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305513943] [2022-12-14 15:34:44,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:34:44,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:34:44,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:34:44,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:34:44,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:34:44,804 INFO L87 Difference]: Start difference. First operand 263 states and 352 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:34:44,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:34:44,919 INFO L93 Difference]: Finished difference Result 338 states and 439 transitions. [2022-12-14 15:34:44,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:34:44,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-12-14 15:34:44,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:34:44,922 INFO L225 Difference]: With dead ends: 338 [2022-12-14 15:34:44,922 INFO L226 Difference]: Without dead ends: 338 [2022-12-14 15:34:44,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:34:44,922 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 206 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:34:44,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 271 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:34:44,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-12-14 15:34:44,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 262. [2022-12-14 15:34:44,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 203 states have (on average 1.645320197044335) internal successors, (334), 249 states have internal predecessors, (334), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-14 15:34:44,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 350 transitions. [2022-12-14 15:34:44,927 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 350 transitions. Word has length 20 [2022-12-14 15:34:44,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:34:44,927 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 350 transitions. [2022-12-14 15:34:44,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:34:44,927 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 350 transitions. [2022-12-14 15:34:44,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 15:34:44,927 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:34:44,928 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-12-14 15:34:44,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-14 15:34:44,928 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:34:44,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:34:44,928 INFO L85 PathProgramCache]: Analyzing trace with hash 244645950, now seen corresponding path program 1 times [2022-12-14 15:34:44,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:34:44,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482871618] [2022-12-14 15:34:44,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:44,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:34:44,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:44,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:44,963 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:34:44,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482871618] [2022-12-14 15:34:44,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482871618] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:34:44,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:34:44,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:34:44,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705234123] [2022-12-14 15:34:44,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:34:44,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:34:44,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:34:44,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:34:44,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:34:44,965 INFO L87 Difference]: Start difference. First operand 262 states and 350 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:34:45,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:34:45,080 INFO L93 Difference]: Finished difference Result 332 states and 431 transitions. [2022-12-14 15:34:45,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:34:45,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-12-14 15:34:45,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:34:45,083 INFO L225 Difference]: With dead ends: 332 [2022-12-14 15:34:45,083 INFO L226 Difference]: Without dead ends: 332 [2022-12-14 15:34:45,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:34:45,084 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 189 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:34:45,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 223 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:34:45,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2022-12-14 15:34:45,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 261. [2022-12-14 15:34:45,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 203 states have (on average 1.6354679802955665) internal successors, (332), 248 states have internal predecessors, (332), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-14 15:34:45,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 348 transitions. [2022-12-14 15:34:45,092 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 348 transitions. Word has length 20 [2022-12-14 15:34:45,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:34:45,092 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 348 transitions. [2022-12-14 15:34:45,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:34:45,092 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 348 transitions. [2022-12-14 15:34:45,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 15:34:45,092 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:34:45,092 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-12-14 15:34:45,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-14 15:34:45,092 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:34:45,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:34:45,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1457971447, now seen corresponding path program 1 times [2022-12-14 15:34:45,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:34:45,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401054506] [2022-12-14 15:34:45,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:45,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:34:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:45,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:45,213 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:34:45,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401054506] [2022-12-14 15:34:45,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401054506] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:34:45,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:34:45,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 15:34:45,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905681177] [2022-12-14 15:34:45,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:34:45,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 15:34:45,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:34:45,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 15:34:45,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-14 15:34:45,215 INFO L87 Difference]: Start difference. First operand 261 states and 348 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:34:45,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:34:45,433 INFO L93 Difference]: Finished difference Result 337 states and 428 transitions. [2022-12-14 15:34:45,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 15:34:45,433 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-12-14 15:34:45,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:34:45,434 INFO L225 Difference]: With dead ends: 337 [2022-12-14 15:34:45,434 INFO L226 Difference]: Without dead ends: 337 [2022-12-14 15:34:45,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-12-14 15:34:45,435 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 216 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:34:45,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 828 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:34:45,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-12-14 15:34:45,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 224. [2022-12-14 15:34:45,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 169 states have (on average 1.6390532544378698) internal successors, (277), 214 states have internal predecessors, (277), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-14 15:34:45,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 289 transitions. [2022-12-14 15:34:45,441 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 289 transitions. Word has length 21 [2022-12-14 15:34:45,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:34:45,441 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 289 transitions. [2022-12-14 15:34:45,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:34:45,442 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 289 transitions. [2022-12-14 15:34:45,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 15:34:45,442 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:34:45,442 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:34:45,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-14 15:34:45,442 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:34:45,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:34:45,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1118440097, now seen corresponding path program 1 times [2022-12-14 15:34:45,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:34:45,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606302773] [2022-12-14 15:34:45,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:45,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:34:45,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:45,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:45,502 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:34:45,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606302773] [2022-12-14 15:34:45,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606302773] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:34:45,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:34:45,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:34:45,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408451091] [2022-12-14 15:34:45,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:34:45,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 15:34:45,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:34:45,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 15:34:45,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:34:45,503 INFO L87 Difference]: Start difference. First operand 224 states and 289 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:34:45,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:34:45,668 INFO L93 Difference]: Finished difference Result 507 states and 619 transitions. [2022-12-14 15:34:45,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 15:34:45,668 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-12-14 15:34:45,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:34:45,670 INFO L225 Difference]: With dead ends: 507 [2022-12-14 15:34:45,670 INFO L226 Difference]: Without dead ends: 507 [2022-12-14 15:34:45,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:34:45,671 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 375 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:34:45,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 271 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:34:45,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2022-12-14 15:34:45,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 221. [2022-12-14 15:34:45,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 169 states have (on average 1.6035502958579881) internal successors, (271), 211 states have internal predecessors, (271), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-14 15:34:45,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 283 transitions. [2022-12-14 15:34:45,678 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 283 transitions. Word has length 22 [2022-12-14 15:34:45,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:34:45,678 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 283 transitions. [2022-12-14 15:34:45,678 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:34:45,679 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 283 transitions. [2022-12-14 15:34:45,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 15:34:45,679 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:34:45,679 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-12-14 15:34:45,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-14 15:34:45,679 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:34:45,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:34:45,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1118440096, now seen corresponding path program 1 times [2022-12-14 15:34:45,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:34:45,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627028138] [2022-12-14 15:34:45,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:45,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:34:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:45,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:45,819 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:34:45,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627028138] [2022-12-14 15:34:45,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627028138] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:34:45,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:34:45,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 15:34:45,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368090052] [2022-12-14 15:34:45,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:34:45,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 15:34:45,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:34:45,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 15:34:45,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:34:45,821 INFO L87 Difference]: Start difference. First operand 221 states and 283 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:34:45,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:34:45,952 INFO L93 Difference]: Finished difference Result 371 states and 465 transitions. [2022-12-14 15:34:45,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 15:34:45,952 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-12-14 15:34:45,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:34:45,953 INFO L225 Difference]: With dead ends: 371 [2022-12-14 15:34:45,953 INFO L226 Difference]: Without dead ends: 371 [2022-12-14 15:34:45,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-14 15:34:45,954 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 551 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:34:45,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 190 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:34:45,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2022-12-14 15:34:45,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 220. [2022-12-14 15:34:45,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 169 states have (on average 1.5917159763313609) internal successors, (269), 210 states have internal predecessors, (269), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-14 15:34:45,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 281 transitions. [2022-12-14 15:34:45,961 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 281 transitions. Word has length 22 [2022-12-14 15:34:45,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:34:45,961 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 281 transitions. [2022-12-14 15:34:45,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:34:45,961 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 281 transitions. [2022-12-14 15:34:45,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 15:34:45,961 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:34:45,962 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-12-14 15:34:45,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-14 15:34:45,962 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:34:45,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:34:45,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1118439935, now seen corresponding path program 1 times [2022-12-14 15:34:45,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:34:45,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953253933] [2022-12-14 15:34:45,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:45,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:34:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:46,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:46,117 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:34:46,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953253933] [2022-12-14 15:34:46,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953253933] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:34:46,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:34:46,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:34:46,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598679639] [2022-12-14 15:34:46,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:34:46,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 15:34:46,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:34:46,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 15:34:46,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:34:46,119 INFO L87 Difference]: Start difference. First operand 220 states and 281 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:34:46,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:34:46,306 INFO L93 Difference]: Finished difference Result 333 states and 384 transitions. [2022-12-14 15:34:46,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 15:34:46,306 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-12-14 15:34:46,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:34:46,307 INFO L225 Difference]: With dead ends: 333 [2022-12-14 15:34:46,307 INFO L226 Difference]: Without dead ends: 333 [2022-12-14 15:34:46,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:34:46,308 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 431 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:34:46,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 202 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:34:46,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-12-14 15:34:46,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 220. [2022-12-14 15:34:46,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 169 states have (on average 1.5798816568047338) internal successors, (267), 210 states have internal predecessors, (267), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-14 15:34:46,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 279 transitions. [2022-12-14 15:34:46,313 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 279 transitions. Word has length 22 [2022-12-14 15:34:46,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:34:46,314 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 279 transitions. [2022-12-14 15:34:46,314 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:34:46,314 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 279 transitions. [2022-12-14 15:34:46,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 15:34:46,314 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:34:46,314 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:34:46,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-14 15:34:46,315 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:34:46,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:34:46,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1202041654, now seen corresponding path program 1 times [2022-12-14 15:34:46,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:34:46,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585709572] [2022-12-14 15:34:46,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:46,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:34:46,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:48,521 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 15:34:48,521 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:34:48,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585709572] [2022-12-14 15:34:48,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585709572] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:34:48,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509140082] [2022-12-14 15:34:48,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:48,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:34:48,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:34:48,523 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:34:48,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 15:34:48,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:48,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 70 conjunts are in the unsatisfiable core [2022-12-14 15:34:48,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:34:48,840 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 15:34:48,841 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 11 treesize of output 11 [2022-12-14 15:34:49,012 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 15 treesize of output 11 [2022-12-14 15:34:49,016 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 15 treesize of output 11 [2022-12-14 15:34:49,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:34:49,197 INFO L321 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2022-12-14 15:34:49,198 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 2 case distinctions, treesize of input 69 treesize of output 87 [2022-12-14 15:34:49,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:34:49,226 INFO L321 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2022-12-14 15:34:49,227 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 2 case distinctions, treesize of input 53 treesize of output 71 [2022-12-14 15:34:49,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-12-14 15:34:49,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-12-14 15:34:49,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:34:49,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 28 treesize of output 10 [2022-12-14 15:34:49,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:34:49,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 28 treesize of output 10 [2022-12-14 15:34:49,494 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:49,494 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:34:49,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509140082] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:34:49,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 15:34:49,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [19] total 28 [2022-12-14 15:34:49,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078404026] [2022-12-14 15:34:49,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:34:49,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 15:34:49,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:34:49,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 15:34:49,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=693, Unknown=0, NotChecked=0, Total=756 [2022-12-14 15:34:49,497 INFO L87 Difference]: Start difference. First operand 220 states and 279 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 15:34:50,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:34:50,673 INFO L93 Difference]: Finished difference Result 531 states and 605 transitions. [2022-12-14 15:34:50,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 15:34:50,673 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2022-12-14 15:34:50,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:34:50,674 INFO L225 Difference]: With dead ends: 531 [2022-12-14 15:34:50,674 INFO L226 Difference]: Without dead ends: 531 [2022-12-14 15:34:50,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=148, Invalid=1184, Unknown=0, NotChecked=0, Total=1332 [2022-12-14 15:34:50,675 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 629 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 15:34:50,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 1114 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 15:34:50,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2022-12-14 15:34:50,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 223. [2022-12-14 15:34:50,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 172 states have (on average 1.569767441860465) internal successors, (270), 213 states have internal predecessors, (270), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-14 15:34:50,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 282 transitions. [2022-12-14 15:34:50,681 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 282 transitions. Word has length 34 [2022-12-14 15:34:50,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:34:50,681 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 282 transitions. [2022-12-14 15:34:50,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 15:34:50,682 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 282 transitions. [2022-12-14 15:34:50,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 15:34:50,682 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:34:50,682 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:34:50,688 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 15:34:50,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-14 15:34:50,883 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:34:50,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:34:50,884 INFO L85 PathProgramCache]: Analyzing trace with hash 15038627, now seen corresponding path program 1 times [2022-12-14 15:34:50,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:34:50,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791196093] [2022-12-14 15:34:50,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:50,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:34:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:52,302 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 15:34:52,302 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:34:52,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791196093] [2022-12-14 15:34:52,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791196093] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:34:52,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730123908] [2022-12-14 15:34:52,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:52,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:34:52,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:34:52,304 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:34:52,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 15:34:52,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:52,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 97 conjunts are in the unsatisfiable core [2022-12-14 15:34:52,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:34:52,450 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 15:34:52,450 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 11 treesize of output 11 [2022-12-14 15:34:52,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 15:34:52,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 15:34:52,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 15:34:52,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 15:34:52,653 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-14 15:34:52,654 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 21 treesize of output 26 [2022-12-14 15:34:52,665 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-14 15:34:52,665 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 21 treesize of output 20 [2022-12-14 15:34:52,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:34:52,895 INFO L321 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2022-12-14 15:34:52,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 54 [2022-12-14 15:34:52,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:34:52,914 INFO L321 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2022-12-14 15:34:52,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 81 [2022-12-14 15:34:52,990 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:34:52,990 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2022-12-14 15:34:53,230 INFO L321 Elim1Store]: treesize reduction 57, result has 38.7 percent of original size [2022-12-14 15:34:53,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 47 [2022-12-14 15:34:53,343 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:34:53,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:34:53,351 INFO L321 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2022-12-14 15:34:53,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 23 [2022-12-14 15:34:53,382 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:53,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:34:53,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730123908] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:34:53,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1784785859] [2022-12-14 15:34:53,598 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2022-12-14 15:34:53,598 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:34:53,601 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:34:53,605 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:34:53,605 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:34:53,737 INFO L321 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2022-12-14 15:34:53,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 214 treesize of output 216 [2022-12-14 15:34:53,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:34:53,951 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:34:53,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:34:53,986 INFO L321 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2022-12-14 15:34:53,986 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 4 case distinctions, treesize of input 253 treesize of output 244 [2022-12-14 15:34:54,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:34:54,004 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:34:54,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:34:54,027 INFO L321 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2022-12-14 15:34:54,027 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 4 case distinctions, treesize of input 253 treesize of output 244 [2022-12-14 15:34:54,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:34:54,058 INFO L321 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-12-14 15:34:54,058 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 1 case distinctions, treesize of input 247 treesize of output 222 [2022-12-14 15:34:54,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:34:54,161 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:34:54,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:34:54,206 INFO L321 Elim1Store]: treesize reduction 189, result has 12.9 percent of original size [2022-12-14 15:34:54,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 257 treesize of output 248 [2022-12-14 15:34:54,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:34:54,229 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:34:54,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:34:54,274 INFO L321 Elim1Store]: treesize reduction 189, result has 12.9 percent of original size [2022-12-14 15:34:54,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 257 treesize of output 248 [2022-12-14 15:34:54,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:34:54,298 INFO L321 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-12-14 15:34:54,298 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 1 case distinctions, treesize of input 247 treesize of output 222 [2022-12-14 15:34:54,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:34:54,406 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:34:54,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:34:54,445 INFO L321 Elim1Store]: treesize reduction 154, result has 15.4 percent of original size [2022-12-14 15:34:54,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 257 treesize of output 255 [2022-12-14 15:34:54,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:34:54,458 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 239 treesize of output 222 [2022-12-14 15:34:54,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:34:54,473 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:34:54,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:34:54,521 INFO L321 Elim1Store]: treesize reduction 144, result has 20.9 percent of original size [2022-12-14 15:34:54,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 257 treesize of output 265 [2022-12-14 15:34:54,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:34:54,763 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:34:54,765 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:34:54,768 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:34:54,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:34:54,829 INFO L321 Elim1Store]: treesize reduction 281, result has 11.9 percent of original size [2022-12-14 15:34:54,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 504 treesize of output 482 [2022-12-14 15:34:54,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:34:54,855 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 464 treesize of output 423 [2022-12-14 15:34:54,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:34:54,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:34:54,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:34:54,877 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:34:54,878 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:34:54,887 INFO L321 Elim1Store]: treesize reduction 85, result has 1.2 percent of original size [2022-12-14 15:34:54,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 496 treesize of output 462 [2022-12-14 15:34:55,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:34:55,365 INFO L321 Elim1Store]: treesize reduction 92, result has 10.7 percent of original size [2022-12-14 15:34:55,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 484 treesize of output 402 [2022-12-14 15:34:55,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:34:55,767 INFO L321 Elim1Store]: treesize reduction 92, result has 10.7 percent of original size [2022-12-14 15:34:55,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 484 treesize of output 402 [2022-12-14 15:34:56,281 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 9 [2022-12-14 15:34:56,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 15:34:56,419 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-14 15:34:56,419 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 22 [2022-12-14 15:34:56,440 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-14 15:34:56,440 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 22 [2022-12-14 15:34:56,448 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 23 treesize of output 1 [2022-12-14 15:34:56,476 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 23 treesize of output 1 [2022-12-14 15:34:56,505 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-12-14 15:34:56,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-12-14 15:34:56,538 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-12-14 15:34:56,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-12-14 15:34:56,592 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-12-14 15:34:56,637 INFO L321 Elim1Store]: treesize reduction 92, result has 33.8 percent of original size [2022-12-14 15:34:56,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 63 [2022-12-14 15:34:56,681 INFO L321 Elim1Store]: treesize reduction 116, result has 16.5 percent of original size [2022-12-14 15:34:56,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 39 [2022-12-14 15:34:56,753 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:34:56,756 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:34:56,807 INFO L321 Elim1Store]: treesize reduction 224, result has 15.5 percent of original size [2022-12-14 15:34:56,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 64 [2022-12-14 15:34:56,838 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:34:56,841 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:34:56,918 INFO L321 Elim1Store]: treesize reduction 183, result has 30.9 percent of original size [2022-12-14 15:34:56,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 129 [2022-12-14 15:34:56,944 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 23 treesize of output 1 [2022-12-14 15:34:57,436 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 9 [2022-12-14 15:34:57,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 15:34:57,534 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 23 treesize of output 1 [2022-12-14 15:34:57,558 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-14 15:34:57,559 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 22 [2022-12-14 15:34:57,581 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-14 15:34:57,581 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 22 [2022-12-14 15:34:57,631 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-12-14 15:34:57,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-12-14 15:34:57,640 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 23 treesize of output 1 [2022-12-14 15:34:57,677 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-12-14 15:34:57,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-12-14 15:34:57,725 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-12-14 15:34:57,767 INFO L321 Elim1Store]: treesize reduction 116, result has 16.5 percent of original size [2022-12-14 15:34:57,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 39 [2022-12-14 15:34:57,827 INFO L321 Elim1Store]: treesize reduction 92, result has 33.8 percent of original size [2022-12-14 15:34:57,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 63 [2022-12-14 15:34:57,917 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 23 treesize of output 1 [2022-12-14 15:34:57,934 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:34:57,937 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:34:58,012 INFO L321 Elim1Store]: treesize reduction 183, result has 30.9 percent of original size [2022-12-14 15:34:58,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 129 [2022-12-14 15:34:58,051 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:34:58,054 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:34:58,104 INFO L321 Elim1Store]: treesize reduction 224, result has 15.5 percent of original size [2022-12-14 15:34:58,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 64 [2022-12-14 15:34:58,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 15:34:58,341 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 9 [2022-12-14 15:34:58,457 INFO L197 IcfgInterpreter]: Interpreting procedure rand_end_point with input of size 17 for LOIs [2022-12-14 15:34:58,463 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:35:04,067 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '15843#(and (<= |ULTIMATE.start_create_item_#in~cursor#1.offset| 8589934588) (<= |~#list~0.base| 3) (<= 3 |ULTIMATE.start_create_item_#in~cursor#1.base|) (<= 3 |ULTIMATE.start_create_item_~cursor#1.base|) (<= (+ |ULTIMATE.start_create_item_~cursor#1.offset| 4) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)) (<= |ULTIMATE.start_main_#t~ret30#1| 2147483647) (<= 0 (+ |ULTIMATE.start_append_one_~cursor~0#1.offset| 8589934592)) (<= 0 |#NULL.base|) (<= |ULTIMATE.start_append_one_#in~to#1| 2147483647) (<= |ULTIMATE.start_create_item_#in~at#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_#t~ret30#1| 2147483648)) (<= |ULTIMATE.start_append_one_~to#1| 2147483647) (<= |ULTIMATE.start_append_one_~list#1.base| 3) (<= |ULTIMATE.start_append_one_#in~list#1.offset| 0) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (= (select |#valid| |ULTIMATE.start_create_item_~cursor#1.base|) 1) (<= 3 |ULTIMATE.start_append_one_~cursor~0#1.base|) (<= |ULTIMATE.start_create_item_~cursor#1.base| 3) (<= 0 (+ 2147483648 |ULTIMATE.start_append_one_~to#1|)) (<= 0 |ULTIMATE.start_create_item_~cursor#1.offset|) (not (= (select |#valid| |ULTIMATE.start_create_item_#t~mem7#1.base|) 1)) (<= |ULTIMATE.start_append_one_~cursor~0#1.base| 3) (<= |#NULL.offset| 0) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~at#1| 2147483647) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) |ULTIMATE.start_create_item_#t~mem7#1.offset|) (<= 0 (+ |ULTIMATE.start_append_one_#in~to#1| 2147483648)) (<= 0 |ULTIMATE.start_append_one_#in~list#1.offset|) (<= 3 |ULTIMATE.start_append_one_~list#1.base|) (<= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_create_item_~at#1| 2147483648)) |ULTIMATE.start_create_item_#t~short10#1| (<= |ULTIMATE.start_append_one_~cursor~0#1.offset| 8589934588) (<= |ULTIMATE.start_create_item_#in~cursor#1.base| 3) (<= 0 (+ |ULTIMATE.start_create_item_#in~at#1| 2147483648)) (<= 0 (+ 8589934592 |ULTIMATE.start_create_item_#in~cursor#1.offset|)) (<= 0 |~#list~0.offset|) (<= 3 |~#list~0.base|) (<= 0 |#NULL.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| 8589934588) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) |ULTIMATE.start_create_item_#t~mem7#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_append_one_#in~list#1.base| 3) (<= |~#list~0.offset| 0) (<= 3 |ULTIMATE.start_append_one_#in~list#1.base|))' at error location [2022-12-14 15:35:04,067 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 15:35:04,068 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 15:35:04,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 25 [2022-12-14 15:35:04,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895120294] [2022-12-14 15:35:04,068 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 15:35:04,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 15:35:04,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:35:04,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 15:35:04,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=2444, Unknown=0, NotChecked=0, Total=2652 [2022-12-14 15:35:04,069 INFO L87 Difference]: Start difference. First operand 223 states and 282 transitions. Second operand has 26 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 24 states have internal predecessors, (57), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-14 15:35:06,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:35:06,817 INFO L93 Difference]: Finished difference Result 481 states and 574 transitions. [2022-12-14 15:35:06,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-14 15:35:06,817 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 24 states have internal predecessors, (57), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-12-14 15:35:06,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:35:06,820 INFO L225 Difference]: With dead ends: 481 [2022-12-14 15:35:06,820 INFO L226 Difference]: Without dead ends: 481 [2022-12-14 15:35:06,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1696 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=503, Invalid=5346, Unknown=3, NotChecked=0, Total=5852 [2022-12-14 15:35:06,821 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 1037 mSDsluCounter, 1364 mSDsCounter, 0 mSdLazyCounter, 1578 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 1458 SdHoareTripleChecker+Invalid, 1647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:35:06,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 1458 Invalid, 1647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1578 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-12-14 15:35:06,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2022-12-14 15:35:06,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 260. [2022-12-14 15:35:06,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 206 states have (on average 1.5145631067961165) internal successors, (312), 247 states have internal predecessors, (312), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-14 15:35:06,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 328 transitions. [2022-12-14 15:35:06,828 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 328 transitions. Word has length 35 [2022-12-14 15:35:06,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:35:06,828 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 328 transitions. [2022-12-14 15:35:06,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 24 states have internal predecessors, (57), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-14 15:35:06,828 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 328 transitions. [2022-12-14 15:35:06,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 15:35:06,828 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:35:06,828 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:35:06,833 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 15:35:07,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-14 15:35:07,030 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:35:07,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:35:07,032 INFO L85 PathProgramCache]: Analyzing trace with hash 15038628, now seen corresponding path program 1 times [2022-12-14 15:35:07,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:35:07,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253317710] [2022-12-14 15:35:07,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:35:07,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:35:07,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:35:08,824 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 15:35:08,824 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:35:08,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253317710] [2022-12-14 15:35:08,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253317710] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:35:08,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101116080] [2022-12-14 15:35:08,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:35:08,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:35:08,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:35:08,826 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:35:08,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 15:35:08,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:35:08,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 113 conjunts are in the unsatisfiable core [2022-12-14 15:35:08,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:35:08,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 15:35:09,008 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 15:35:09,008 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 17 treesize of output 21 [2022-12-14 15:35:09,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 15:35:09,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 15:35:09,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 15:35:09,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 15:35:09,318 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-14 15:35:09,318 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 21 treesize of output 20 [2022-12-14 15:35:09,332 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-14 15:35:09,333 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 21 treesize of output 26 [2022-12-14 15:35:09,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:09,571 INFO L321 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2022-12-14 15:35:09,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 54 [2022-12-14 15:35:09,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:09,591 INFO L321 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2022-12-14 15:35:09,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 81 [2022-12-14 15:35:10,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:10,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2022-12-14 15:35:10,179 INFO L321 Elim1Store]: treesize reduction 8, result has 73.3 percent of original size [2022-12-14 15:35:10,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2022-12-14 15:35:10,396 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:35:10,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:10,403 INFO L321 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2022-12-14 15:35:10,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 23 [2022-12-14 15:35:10,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:10,413 INFO L321 Elim1Store]: treesize reduction 20, result has 13.0 percent of original size [2022-12-14 15:35:10,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 13 [2022-12-14 15:35:10,463 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:35:10,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:35:15,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101116080] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:35:15,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1711531206] [2022-12-14 15:35:15,584 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2022-12-14 15:35:15,584 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:35:15,584 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:35:15,584 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:35:15,584 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:35:15,684 INFO L321 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2022-12-14 15:35:15,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 214 treesize of output 216 [2022-12-14 15:35:15,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:15,875 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:35:15,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:15,900 INFO L321 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2022-12-14 15:35:15,900 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 4 case distinctions, treesize of input 253 treesize of output 244 [2022-12-14 15:35:15,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:15,922 INFO L321 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-12-14 15:35:15,922 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 1 case distinctions, treesize of input 247 treesize of output 222 [2022-12-14 15:35:15,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:15,932 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:35:15,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:15,953 INFO L321 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2022-12-14 15:35:15,953 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 4 case distinctions, treesize of input 253 treesize of output 244 [2022-12-14 15:35:16,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:16,030 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:35:16,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:16,076 INFO L321 Elim1Store]: treesize reduction 189, result has 12.9 percent of original size [2022-12-14 15:35:16,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 257 treesize of output 248 [2022-12-14 15:35:16,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:16,095 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:35:16,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:16,140 INFO L321 Elim1Store]: treesize reduction 189, result has 12.9 percent of original size [2022-12-14 15:35:16,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 264 treesize of output 251 [2022-12-14 15:35:16,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:16,164 INFO L321 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-12-14 15:35:16,165 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 1 case distinctions, treesize of input 247 treesize of output 222 [2022-12-14 15:35:16,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:16,254 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:35:16,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:16,301 INFO L321 Elim1Store]: treesize reduction 154, result has 15.4 percent of original size [2022-12-14 15:35:16,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 257 treesize of output 255 [2022-12-14 15:35:16,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:16,319 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:35:16,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:16,364 INFO L321 Elim1Store]: treesize reduction 144, result has 20.9 percent of original size [2022-12-14 15:35:16,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 257 treesize of output 265 [2022-12-14 15:35:16,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:16,379 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 219 treesize of output 202 [2022-12-14 15:35:16,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:16,623 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:35:16,625 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:35:16,630 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:35:16,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:16,691 INFO L321 Elim1Store]: treesize reduction 278, result has 12.9 percent of original size [2022-12-14 15:35:16,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 498 treesize of output 483 [2022-12-14 15:35:16,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:16,717 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:35:16,719 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:35:16,721 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:35:16,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:16,770 INFO L321 Elim1Store]: treesize reduction 296, result has 7.2 percent of original size [2022-12-14 15:35:16,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 482 treesize of output 437 [2022-12-14 15:35:16,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:16,792 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 434 treesize of output 393 [2022-12-14 15:35:17,352 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 9 [2022-12-14 15:35:17,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 15:35:17,459 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-14 15:35:17,459 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 22 [2022-12-14 15:35:17,476 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-14 15:35:17,477 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 22 [2022-12-14 15:35:17,485 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 23 treesize of output 1 [2022-12-14 15:35:17,514 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 23 treesize of output 1 [2022-12-14 15:35:17,538 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-12-14 15:35:17,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-12-14 15:35:17,574 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-12-14 15:35:17,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-12-14 15:35:17,614 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-12-14 15:35:17,645 INFO L321 Elim1Store]: treesize reduction 116, result has 16.5 percent of original size [2022-12-14 15:35:17,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 39 [2022-12-14 15:35:17,699 INFO L321 Elim1Store]: treesize reduction 92, result has 33.8 percent of original size [2022-12-14 15:35:17,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 63 [2022-12-14 15:35:17,773 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:35:17,775 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:35:17,820 INFO L321 Elim1Store]: treesize reduction 224, result has 15.5 percent of original size [2022-12-14 15:35:17,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 64 [2022-12-14 15:35:17,837 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 23 treesize of output 1 [2022-12-14 15:35:17,862 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:35:17,864 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:35:17,938 INFO L321 Elim1Store]: treesize reduction 183, result has 30.9 percent of original size [2022-12-14 15:35:17,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 129 [2022-12-14 15:35:18,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 15:35:18,412 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 9 [2022-12-14 15:35:18,508 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-14 15:35:18,509 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 22 [2022-12-14 15:35:18,517 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 23 treesize of output 1 [2022-12-14 15:35:18,535 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-14 15:35:18,535 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 22 [2022-12-14 15:35:18,591 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-12-14 15:35:18,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-12-14 15:35:18,604 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 23 treesize of output 1 [2022-12-14 15:35:18,633 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-12-14 15:35:18,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-12-14 15:35:18,716 INFO L321 Elim1Store]: treesize reduction 92, result has 33.8 percent of original size [2022-12-14 15:35:18,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 63 [2022-12-14 15:35:18,760 INFO L321 Elim1Store]: treesize reduction 116, result has 16.5 percent of original size [2022-12-14 15:35:18,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 39 [2022-12-14 15:35:18,772 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-12-14 15:35:18,850 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:35:18,853 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:35:18,892 INFO L321 Elim1Store]: treesize reduction 224, result has 15.5 percent of original size [2022-12-14 15:35:18,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 64 [2022-12-14 15:35:18,908 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 23 treesize of output 1 [2022-12-14 15:35:18,930 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:35:18,933 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:35:18,997 INFO L321 Elim1Store]: treesize reduction 183, result has 30.9 percent of original size [2022-12-14 15:35:18,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 129 [2022-12-14 15:35:19,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 15:35:19,207 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 9 [2022-12-14 15:35:19,325 INFO L197 IcfgInterpreter]: Interpreting procedure rand_end_point with input of size 17 for LOIs [2022-12-14 15:35:19,331 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:35:24,632 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '16809#(and (<= |ULTIMATE.start_create_item_#in~cursor#1.offset| 8589934588) (<= |~#list~0.base| 3) (<= 3 |ULTIMATE.start_create_item_#in~cursor#1.base|) (<= 3 |ULTIMATE.start_create_item_~cursor#1.base|) (<= (+ |ULTIMATE.start_create_item_~cursor#1.offset| 4) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)) (<= |ULTIMATE.start_main_#t~ret30#1| 2147483647) (<= 0 (+ |ULTIMATE.start_append_one_~cursor~0#1.offset| 8589934592)) (<= 0 |#NULL.base|) (<= |ULTIMATE.start_append_one_#in~to#1| 2147483647) (<= |ULTIMATE.start_create_item_#in~at#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_#t~ret30#1| 2147483648)) (<= |ULTIMATE.start_append_one_~to#1| 2147483647) (<= |ULTIMATE.start_append_one_~list#1.base| 3) (<= |ULTIMATE.start_append_one_#in~list#1.offset| 0) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (= (select |#valid| |ULTIMATE.start_create_item_~cursor#1.base|) 1) (<= 3 |ULTIMATE.start_append_one_~cursor~0#1.base|) (or (not (= |ULTIMATE.start_create_item_#t~mem8#1.offset| 0)) (not (= |ULTIMATE.start_create_item_#t~mem8#1.base| 0))) (<= |ULTIMATE.start_create_item_~cursor#1.base| 3) (<= 0 (+ 2147483648 |ULTIMATE.start_append_one_~to#1|)) (<= 0 |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_append_one_~cursor~0#1.base| 3) (<= |#NULL.offset| 0) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= |ULTIMATE.start_create_item_#t~mem8#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|)) (<= |ULTIMATE.start_create_item_~at#1| 2147483647) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) |ULTIMATE.start_create_item_#t~mem7#1.offset|) (<= 0 (+ |ULTIMATE.start_append_one_#in~to#1| 2147483648)) (<= 0 |ULTIMATE.start_append_one_#in~list#1.offset|) (<= 3 |ULTIMATE.start_append_one_~list#1.base|) (<= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_create_item_~at#1| 2147483648)) |ULTIMATE.start_create_item_#t~short10#1| (<= |ULTIMATE.start_append_one_~cursor~0#1.offset| 8589934588) (<= |ULTIMATE.start_create_item_#in~cursor#1.base| 3) (or (not (<= 0 (+ (* 4 |ULTIMATE.start_create_item_~link_field~0#1|) |ULTIMATE.start_create_item_#t~mem7#1.offset|))) (not (<= (+ (* 4 |ULTIMATE.start_create_item_~link_field~0#1|) |ULTIMATE.start_create_item_#t~mem7#1.offset| 4) (select |#length| |ULTIMATE.start_create_item_#t~mem7#1.base|)))) (<= 0 (+ |ULTIMATE.start_create_item_#in~at#1| 2147483648)) (<= 0 (+ 8589934592 |ULTIMATE.start_create_item_#in~cursor#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) |ULTIMATE.start_create_item_#t~mem8#1.offset|) (<= 0 |~#list~0.offset|) (<= 3 |~#list~0.base|) (<= 0 |#NULL.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| 8589934588) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) |ULTIMATE.start_create_item_#t~mem7#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_append_one_#in~list#1.base| 3) (<= |~#list~0.offset| 0) (<= 3 |ULTIMATE.start_append_one_#in~list#1.base|))' at error location [2022-12-14 15:35:24,633 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 15:35:24,633 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 15:35:24,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 25 [2022-12-14 15:35:24,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532561915] [2022-12-14 15:35:24,633 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 15:35:24,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 15:35:24,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:35:24,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 15:35:24,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=2757, Unknown=0, NotChecked=0, Total=2970 [2022-12-14 15:35:24,636 INFO L87 Difference]: Start difference. First operand 260 states and 328 transitions. Second operand has 26 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 24 states have internal predecessors, (57), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-14 15:35:28,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:35:28,139 INFO L93 Difference]: Finished difference Result 479 states and 572 transitions. [2022-12-14 15:35:28,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-14 15:35:28,139 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 24 states have internal predecessors, (57), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-12-14 15:35:28,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:35:28,140 INFO L225 Difference]: With dead ends: 479 [2022-12-14 15:35:28,140 INFO L226 Difference]: Without dead ends: 479 [2022-12-14 15:35:28,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1547 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=491, Invalid=5515, Unknown=0, NotChecked=0, Total=6006 [2022-12-14 15:35:28,141 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 1078 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 2128 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1081 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 2192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 2128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:35:28,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1081 Valid, 1483 Invalid, 2192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 2128 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-14 15:35:28,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2022-12-14 15:35:28,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 260. [2022-12-14 15:35:28,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 206 states have (on average 1.5097087378640777) internal successors, (311), 247 states have internal predecessors, (311), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-14 15:35:28,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 327 transitions. [2022-12-14 15:35:28,145 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 327 transitions. Word has length 35 [2022-12-14 15:35:28,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:35:28,145 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 327 transitions. [2022-12-14 15:35:28,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 24 states have internal predecessors, (57), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-14 15:35:28,146 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 327 transitions. [2022-12-14 15:35:28,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 15:35:28,146 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:35:28,146 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:35:28,150 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-14 15:35:28,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-14 15:35:28,347 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:35:28,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:35:28,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1481395130, now seen corresponding path program 1 times [2022-12-14 15:35:28,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:35:28,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749571880] [2022-12-14 15:35:28,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:35:28,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:35:28,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:35:29,266 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:35:29,266 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:35:29,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749571880] [2022-12-14 15:35:29,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749571880] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:35:29,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914997089] [2022-12-14 15:35:29,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:35:29,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:35:29,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:35:29,268 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:35:29,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 15:35:29,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:35:29,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 66 conjunts are in the unsatisfiable core [2022-12-14 15:35:29,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:35:29,417 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 15:35:29,417 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 11 treesize of output 11 [2022-12-14 15:35:29,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 15:35:29,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 15:35:29,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 15:35:29,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 15:35:29,577 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-14 15:35:29,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 15:35:29,587 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-14 15:35:29,587 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 21 treesize of output 26 [2022-12-14 15:35:29,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:29,732 INFO L321 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2022-12-14 15:35:29,732 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 2 case distinctions, treesize of input 50 treesize of output 54 [2022-12-14 15:35:29,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:29,751 INFO L321 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2022-12-14 15:35:29,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 81 [2022-12-14 15:35:29,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:29,974 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:35:29,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 42 [2022-12-14 15:35:29,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:29,984 INFO L321 Elim1Store]: treesize reduction 20, result has 13.0 percent of original size [2022-12-14 15:35:29,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 13 [2022-12-14 15:35:30,071 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:35:30,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:35:30,469 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:35:30,469 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 170 treesize of output 228 [2022-12-14 15:35:32,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914997089] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:35:32,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [770617313] [2022-12-14 15:35:32,249 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2022-12-14 15:35:32,249 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:35:32,249 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:35:32,250 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:35:32,250 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:35:32,396 INFO L321 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2022-12-14 15:35:32,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 214 treesize of output 216 [2022-12-14 15:35:32,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:32,577 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:35:32,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:32,601 INFO L321 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2022-12-14 15:35:32,601 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 4 case distinctions, treesize of input 253 treesize of output 244 [2022-12-14 15:35:32,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:32,614 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:35:32,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:32,641 INFO L321 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2022-12-14 15:35:32,641 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 4 case distinctions, treesize of input 253 treesize of output 244 [2022-12-14 15:35:32,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:32,667 INFO L321 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-12-14 15:35:32,668 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 1 case distinctions, treesize of input 247 treesize of output 222 [2022-12-14 15:35:32,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:32,746 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:35:32,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:32,809 INFO L321 Elim1Store]: treesize reduction 189, result has 12.9 percent of original size [2022-12-14 15:35:32,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 257 treesize of output 248 [2022-12-14 15:35:32,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:32,839 INFO L321 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-12-14 15:35:32,839 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 1 case distinctions, treesize of input 247 treesize of output 222 [2022-12-14 15:35:32,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:32,855 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:35:32,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:32,899 INFO L321 Elim1Store]: treesize reduction 189, result has 12.9 percent of original size [2022-12-14 15:35:32,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 257 treesize of output 248 [2022-12-14 15:35:32,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:32,987 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 239 treesize of output 222 [2022-12-14 15:35:33,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:33,004 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:35:33,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:33,044 INFO L321 Elim1Store]: treesize reduction 144, result has 20.9 percent of original size [2022-12-14 15:35:33,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 257 treesize of output 265 [2022-12-14 15:35:33,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:33,062 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:35:33,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:33,096 INFO L321 Elim1Store]: treesize reduction 154, result has 15.4 percent of original size [2022-12-14 15:35:33,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 237 treesize of output 235 [2022-12-14 15:35:33,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:33,254 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:35:33,256 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:35:33,259 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:35:33,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:33,315 INFO L321 Elim1Store]: treesize reduction 281, result has 11.9 percent of original size [2022-12-14 15:35:33,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 299 treesize of output 289 [2022-12-14 15:35:33,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:33,339 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:35:33,340 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:35:33,343 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:35:33,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:33,388 INFO L321 Elim1Store]: treesize reduction 296, result has 7.2 percent of original size [2022-12-14 15:35:33,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 291 treesize of output 266 [2022-12-14 15:35:33,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:33,407 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 251 treesize of output 226 [2022-12-14 15:35:34,427 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 9 [2022-12-14 15:35:34,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 15:35:34,586 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-14 15:35:34,586 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 22 [2022-12-14 15:35:34,606 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-14 15:35:34,606 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 22 [2022-12-14 15:35:34,616 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 23 treesize of output 1 [2022-12-14 15:35:34,670 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-12-14 15:35:34,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-12-14 15:35:34,679 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 23 treesize of output 1 [2022-12-14 15:35:34,711 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-12-14 15:35:34,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-12-14 15:35:34,763 INFO L321 Elim1Store]: treesize reduction 116, result has 16.5 percent of original size [2022-12-14 15:35:34,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 39 [2022-12-14 15:35:34,808 INFO L321 Elim1Store]: treesize reduction 92, result has 33.8 percent of original size [2022-12-14 15:35:34,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 63 [2022-12-14 15:35:34,822 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-12-14 15:35:34,879 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 23 treesize of output 1 [2022-12-14 15:35:34,891 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:35:34,893 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:35:34,931 INFO L321 Elim1Store]: treesize reduction 224, result has 15.5 percent of original size [2022-12-14 15:35:34,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 64 [2022-12-14 15:35:34,951 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:35:34,953 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:35:35,032 INFO L321 Elim1Store]: treesize reduction 183, result has 30.9 percent of original size [2022-12-14 15:35:35,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 129 [2022-12-14 15:35:35,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 15:35:35,681 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 9 [2022-12-14 15:35:35,785 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-14 15:35:35,785 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 22 [2022-12-14 15:35:35,795 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 23 treesize of output 1 [2022-12-14 15:35:35,816 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-14 15:35:35,817 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 22 [2022-12-14 15:35:35,875 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-12-14 15:35:35,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-12-14 15:35:35,886 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 23 treesize of output 1 [2022-12-14 15:35:35,920 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-12-14 15:35:35,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-12-14 15:35:35,979 INFO L321 Elim1Store]: treesize reduction 116, result has 16.5 percent of original size [2022-12-14 15:35:35,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 39 [2022-12-14 15:35:36,026 INFO L321 Elim1Store]: treesize reduction 92, result has 33.8 percent of original size [2022-12-14 15:35:36,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 63 [2022-12-14 15:35:36,041 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-12-14 15:35:36,110 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:35:36,112 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:35:36,149 INFO L321 Elim1Store]: treesize reduction 224, result has 15.5 percent of original size [2022-12-14 15:35:36,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 64 [2022-12-14 15:35:36,173 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:35:36,176 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:35:36,231 INFO L321 Elim1Store]: treesize reduction 183, result has 30.9 percent of original size [2022-12-14 15:35:36,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 129 [2022-12-14 15:35:36,254 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 23 treesize of output 1 [2022-12-14 15:35:36,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 15:35:36,737 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 9 [2022-12-14 15:35:36,817 INFO L197 IcfgInterpreter]: Interpreting procedure rand_end_point with input of size 17 for LOIs [2022-12-14 15:35:36,823 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:35:42,699 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '17833#(and (<= |~#list~0.base| 3) (<= 0 |#NULL.base|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|)) |ULTIMATE.start_main_~cursor~1#1.offset|) (= (select |#valid| |~#list~0.base|) 1) (or (not (= |ULTIMATE.start_main_~cursor~1#1.offset| 0)) (not (= |ULTIMATE.start_main_~cursor~1#1.base| 0))) (<= (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= |#NULL.offset| 0) (= |ULTIMATE.start_main_~cursor~1#1.base| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|))) (or (and (= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_main_~direction~0#1|) (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_main_~end_point~0#1|)) (and (= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_main_~direction~0#1|) (= ~unnamed1~0~LIST_END |ULTIMATE.start_main_~end_point~0#1|))) (<= |#NULL.base| 0) (<= 0 |~#list~0.offset|) (<= 3 |~#list~0.base|) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (not (= (select |#valid| |ULTIMATE.start_main_~cursor~1#1.base|) 1)) (<= |~#list~0.offset| 0))' at error location [2022-12-14 15:35:42,699 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 15:35:42,699 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 15:35:42,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 19 [2022-12-14 15:35:42,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623614755] [2022-12-14 15:35:42,699 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 15:35:42,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 15:35:42,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:35:42,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 15:35:42,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2556, Unknown=2, NotChecked=0, Total=2756 [2022-12-14 15:35:42,702 INFO L87 Difference]: Start difference. First operand 260 states and 327 transitions. Second operand has 20 states, 19 states have (on average 3.210526315789474) internal successors, (61), 20 states have internal predecessors, (61), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 15:35:46,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:35:46,256 INFO L93 Difference]: Finished difference Result 535 states and 637 transitions. [2022-12-14 15:35:46,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-14 15:35:46,256 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.210526315789474) internal successors, (61), 20 states have internal predecessors, (61), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2022-12-14 15:35:46,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:35:46,257 INFO L225 Difference]: With dead ends: 535 [2022-12-14 15:35:46,257 INFO L226 Difference]: Without dead ends: 535 [2022-12-14 15:35:46,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1544 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=592, Invalid=5258, Unknown=2, NotChecked=0, Total=5852 [2022-12-14 15:35:46,259 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 1078 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 1424 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1080 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 1496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:35:46,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1080 Valid, 1258 Invalid, 1496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1424 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-14 15:35:46,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2022-12-14 15:35:46,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 286. [2022-12-14 15:35:46,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 230 states have (on average 1.491304347826087) internal successors, (343), 271 states have internal predecessors, (343), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-12-14 15:35:46,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 363 transitions. [2022-12-14 15:35:46,263 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 363 transitions. Word has length 35 [2022-12-14 15:35:46,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:35:46,263 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 363 transitions. [2022-12-14 15:35:46,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.210526315789474) internal successors, (61), 20 states have internal predecessors, (61), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 15:35:46,263 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 363 transitions. [2022-12-14 15:35:46,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 15:35:46,263 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:35:46,263 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:35:46,268 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 15:35:46,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-14 15:35:46,465 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:35:46,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:35:46,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1481395129, now seen corresponding path program 1 times [2022-12-14 15:35:46,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:35:46,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775930956] [2022-12-14 15:35:46,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:35:46,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:35:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:35:47,707 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:35:47,708 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:35:47,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775930956] [2022-12-14 15:35:47,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775930956] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:35:47,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625985043] [2022-12-14 15:35:47,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:35:47,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:35:47,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:35:47,709 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:35:47,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 15:35:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:35:47,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 72 conjunts are in the unsatisfiable core [2022-12-14 15:35:47,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:35:47,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 15:35:47,896 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 15:35:47,896 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 17 treesize of output 21 [2022-12-14 15:35:48,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 15:35:48,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 15:35:48,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 15:35:48,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 15:35:48,132 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-14 15:35:48,132 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 21 treesize of output 26 [2022-12-14 15:35:48,143 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-14 15:35:48,143 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 21 treesize of output 20 [2022-12-14 15:35:48,249 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 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 15:35:48,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:48,347 INFO L321 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2022-12-14 15:35:48,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 54 [2022-12-14 15:35:48,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:48,366 INFO L321 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2022-12-14 15:35:48,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 81 [2022-12-14 15:35:48,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:48,681 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:35:48,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 42 [2022-12-14 15:35:48,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:48,692 INFO L321 Elim1Store]: treesize reduction 20, result has 13.0 percent of original size [2022-12-14 15:35:48,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 13 [2022-12-14 15:35:48,826 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:35:48,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:35:58,248 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:35:58,248 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 369 treesize of output 374 [2022-12-14 15:36:01,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625985043] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:36:01,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1844087551] [2022-12-14 15:36:01,956 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2022-12-14 15:36:01,956 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:36:01,956 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:36:01,957 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:36:01,957 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:36:02,097 INFO L321 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2022-12-14 15:36:02,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 214 treesize of output 216 [2022-12-14 15:36:02,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:02,284 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:36:02,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:02,314 INFO L321 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2022-12-14 15:36:02,314 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 4 case distinctions, treesize of input 253 treesize of output 244 [2022-12-14 15:36:02,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:02,340 INFO L321 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-12-14 15:36:02,340 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 1 case distinctions, treesize of input 247 treesize of output 222 [2022-12-14 15:36:02,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:02,350 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:36:02,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:02,377 INFO L321 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2022-12-14 15:36:02,377 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 4 case distinctions, treesize of input 253 treesize of output 244 [2022-12-14 15:36:02,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:02,460 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:36:02,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:02,524 INFO L321 Elim1Store]: treesize reduction 189, result has 12.9 percent of original size [2022-12-14 15:36:02,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 257 treesize of output 248 [2022-12-14 15:36:02,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:02,558 INFO L321 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-12-14 15:36:02,558 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 1 case distinctions, treesize of input 247 treesize of output 222 [2022-12-14 15:36:02,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:02,572 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:36:02,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:02,623 INFO L321 Elim1Store]: treesize reduction 189, result has 12.9 percent of original size [2022-12-14 15:36:02,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 257 treesize of output 248 [2022-12-14 15:36:02,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:02,708 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:36:02,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:02,769 INFO L321 Elim1Store]: treesize reduction 154, result has 15.4 percent of original size [2022-12-14 15:36:02,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 257 treesize of output 255 [2022-12-14 15:36:02,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:02,785 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 239 treesize of output 222 [2022-12-14 15:36:02,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:02,803 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:36:02,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:02,858 INFO L321 Elim1Store]: treesize reduction 144, result has 20.9 percent of original size [2022-12-14 15:36:02,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 257 treesize of output 265 [2022-12-14 15:36:03,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:03,021 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:36:03,023 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:36:03,028 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:36:03,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:03,106 INFO L321 Elim1Store]: treesize reduction 281, result has 11.9 percent of original size [2022-12-14 15:36:03,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 299 treesize of output 289 [2022-12-14 15:36:03,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:03,127 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 259 treesize of output 234 [2022-12-14 15:36:03,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:03,149 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:36:03,151 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:36:03,154 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:36:03,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:03,206 INFO L321 Elim1Store]: treesize reduction 296, result has 7.2 percent of original size [2022-12-14 15:36:03,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 291 treesize of output 266 [2022-12-14 15:36:03,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 15:36:03,920 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 9 [2022-12-14 15:36:04,030 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-14 15:36:04,030 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 22 [2022-12-14 15:36:04,054 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-14 15:36:04,054 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 22 [2022-12-14 15:36:04,065 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 23 treesize of output 1 [2022-12-14 15:36:04,125 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-12-14 15:36:04,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-12-14 15:36:04,161 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-12-14 15:36:04,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-12-14 15:36:04,172 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 23 treesize of output 1 [2022-12-14 15:36:04,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 15:36:04,260 INFO L321 Elim1Store]: treesize reduction 92, result has 33.8 percent of original size [2022-12-14 15:36:04,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 63 [2022-12-14 15:36:04,310 INFO L321 Elim1Store]: treesize reduction 116, result has 16.5 percent of original size [2022-12-14 15:36:04,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 39 [2022-12-14 15:36:04,369 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 23 treesize of output 1 [2022-12-14 15:36:04,387 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:36:04,390 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:36:04,472 INFO L321 Elim1Store]: treesize reduction 183, result has 30.9 percent of original size [2022-12-14 15:36:04,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 129 [2022-12-14 15:36:04,506 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:36:04,509 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:36:04,564 INFO L321 Elim1Store]: treesize reduction 224, result has 15.5 percent of original size [2022-12-14 15:36:04,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 64 [2022-12-14 15:36:05,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 15:36:05,204 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 9 [2022-12-14 15:36:05,277 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 23 treesize of output 1 [2022-12-14 15:36:05,300 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-14 15:36:05,301 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 22 [2022-12-14 15:36:05,325 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-14 15:36:05,325 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 22 [2022-12-14 15:36:05,357 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 23 treesize of output 1 [2022-12-14 15:36:05,394 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-12-14 15:36:05,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-12-14 15:36:05,433 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-12-14 15:36:05,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-12-14 15:36:05,518 INFO L321 Elim1Store]: treesize reduction 92, result has 33.8 percent of original size [2022-12-14 15:36:05,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 63 [2022-12-14 15:36:05,570 INFO L321 Elim1Store]: treesize reduction 116, result has 16.5 percent of original size [2022-12-14 15:36:05,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 39 [2022-12-14 15:36:05,586 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-12-14 15:36:05,649 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 23 treesize of output 1 [2022-12-14 15:36:05,671 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:36:05,673 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:36:05,726 INFO L321 Elim1Store]: treesize reduction 224, result has 15.5 percent of original size [2022-12-14 15:36:05,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 64 [2022-12-14 15:36:05,751 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:36:05,753 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:36:05,837 INFO L321 Elim1Store]: treesize reduction 183, result has 30.9 percent of original size [2022-12-14 15:36:05,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 129 [2022-12-14 15:36:06,356 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 9 [2022-12-14 15:36:06,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 15:36:06,443 INFO L197 IcfgInterpreter]: Interpreting procedure rand_end_point with input of size 17 for LOIs [2022-12-14 15:36:06,451 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:36:15,003 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '18944#(and (<= |~#list~0.base| 3) (<= 0 |#NULL.base|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|)) |ULTIMATE.start_main_~cursor~1#1.offset|) (= (select |#valid| |~#list~0.base|) 1) (or (not (= |ULTIMATE.start_main_~cursor~1#1.offset| 0)) (not (= |ULTIMATE.start_main_~cursor~1#1.base| 0))) (or (not (<= (+ (* 4 |ULTIMATE.start_main_~direction~0#1|) 4 |ULTIMATE.start_main_~cursor~1#1.offset|) (select |#length| |ULTIMATE.start_main_~cursor~1#1.base|))) (not (<= 0 (+ (* 4 |ULTIMATE.start_main_~direction~0#1|) |ULTIMATE.start_main_~cursor~1#1.offset|)))) (<= (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= |#NULL.offset| 0) (= |ULTIMATE.start_main_~cursor~1#1.base| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|))) (or (and (= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_main_~direction~0#1|) (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_main_~end_point~0#1|)) (and (= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_main_~direction~0#1|) (= ~unnamed1~0~LIST_END |ULTIMATE.start_main_~end_point~0#1|))) (<= |#NULL.base| 0) (<= 0 |~#list~0.offset|) (<= 3 |~#list~0.base|) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (<= |~#list~0.offset| 0))' at error location [2022-12-14 15:36:15,003 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 15:36:15,003 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 15:36:15,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 20 [2022-12-14 15:36:15,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102059085] [2022-12-14 15:36:15,003 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 15:36:15,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-14 15:36:15,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:36:15,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-14 15:36:15,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=2761, Unknown=1, NotChecked=0, Total=2970 [2022-12-14 15:36:15,005 INFO L87 Difference]: Start difference. First operand 286 states and 363 transitions. Second operand has 21 states, 20 states have (on average 3.3) internal successors, (66), 21 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 15:36:20,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:36:20,180 INFO L93 Difference]: Finished difference Result 537 states and 647 transitions. [2022-12-14 15:36:20,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 15:36:20,180 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.3) internal successors, (66), 21 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2022-12-14 15:36:20,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:36:20,182 INFO L225 Difference]: With dead ends: 537 [2022-12-14 15:36:20,182 INFO L226 Difference]: Without dead ends: 537 [2022-12-14 15:36:20,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1179 ImplicationChecksByTransitivity, 24.4s TimeCoverageRelationStatistics Valid=473, Invalid=4356, Unknown=1, NotChecked=0, Total=4830 [2022-12-14 15:36:20,184 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 1264 mSDsluCounter, 1303 mSDsCounter, 0 mSdLazyCounter, 1521 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1268 SdHoareTripleChecker+Valid, 1388 SdHoareTripleChecker+Invalid, 1593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:36:20,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1268 Valid, 1388 Invalid, 1593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1521 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-12-14 15:36:20,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2022-12-14 15:36:20,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 327. [2022-12-14 15:36:20,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 268 states have (on average 1.507462686567164) internal successors, (404), 310 states have internal predecessors, (404), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-14 15:36:20,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 428 transitions. [2022-12-14 15:36:20,188 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 428 transitions. Word has length 35 [2022-12-14 15:36:20,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:36:20,188 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 428 transitions. [2022-12-14 15:36:20,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.3) internal successors, (66), 21 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 15:36:20,188 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 428 transitions. [2022-12-14 15:36:20,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 15:36:20,189 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:36:20,189 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:36:20,193 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 15:36:20,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:36:20,389 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:36:20,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:36:20,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1481393752, now seen corresponding path program 1 times [2022-12-14 15:36:20,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:36:20,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472193533] [2022-12-14 15:36:20,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:36:20,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:36:20,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:36:20,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:36:20,723 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:36:20,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472193533] [2022-12-14 15:36:20,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472193533] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:36:20,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:36:20,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-14 15:36:20,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168854151] [2022-12-14 15:36:20,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:36:20,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 15:36:20,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:36:20,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 15:36:20,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-14 15:36:20,724 INFO L87 Difference]: Start difference. First operand 327 states and 428 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:36:21,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:36:21,197 INFO L93 Difference]: Finished difference Result 479 states and 616 transitions. [2022-12-14 15:36:21,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 15:36:21,198 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-12-14 15:36:21,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:36:21,199 INFO L225 Difference]: With dead ends: 479 [2022-12-14 15:36:21,199 INFO L226 Difference]: Without dead ends: 479 [2022-12-14 15:36:21,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2022-12-14 15:36:21,199 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 719 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:36:21,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 565 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:36:21,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2022-12-14 15:36:21,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 394. [2022-12-14 15:36:21,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 329 states have (on average 1.4984802431610942) internal successors, (493), 373 states have internal predecessors, (493), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 12 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-14 15:36:21,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 525 transitions. [2022-12-14 15:36:21,204 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 525 transitions. Word has length 35 [2022-12-14 15:36:21,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:36:21,204 INFO L495 AbstractCegarLoop]: Abstraction has 394 states and 525 transitions. [2022-12-14 15:36:21,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:36:21,204 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 525 transitions. [2022-12-14 15:36:21,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 15:36:21,204 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:36:21,205 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:36:21,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-14 15:36:21,205 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:36:21,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:36:21,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1397689214, now seen corresponding path program 1 times [2022-12-14 15:36:21,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:36:21,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342968379] [2022-12-14 15:36:21,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:36:21,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:36:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:36:21,755 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:36:21,755 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:36:21,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342968379] [2022-12-14 15:36:21,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342968379] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:36:21,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:36:21,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 15:36:21,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877201516] [2022-12-14 15:36:21,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:36:21,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 15:36:21,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:36:21,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 15:36:21,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-14 15:36:21,756 INFO L87 Difference]: Start difference. First operand 394 states and 525 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:36:22,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:36:22,390 INFO L93 Difference]: Finished difference Result 588 states and 745 transitions. [2022-12-14 15:36:22,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 15:36:22,391 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-12-14 15:36:22,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:36:22,392 INFO L225 Difference]: With dead ends: 588 [2022-12-14 15:36:22,392 INFO L226 Difference]: Without dead ends: 588 [2022-12-14 15:36:22,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2022-12-14 15:36:22,392 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 547 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:36:22,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 551 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 15:36:22,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2022-12-14 15:36:22,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 393. [2022-12-14 15:36:22,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 328 states have (on average 1.4969512195121952) internal successors, (491), 372 states have internal predecessors, (491), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 12 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-14 15:36:22,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 523 transitions. [2022-12-14 15:36:22,397 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 523 transitions. Word has length 36 [2022-12-14 15:36:22,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:36:22,398 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 523 transitions. [2022-12-14 15:36:22,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:36:22,398 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 523 transitions. [2022-12-14 15:36:22,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 15:36:22,398 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:36:22,398 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:36:22,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-14 15:36:22,398 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:36:22,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:36:22,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1986504344, now seen corresponding path program 1 times [2022-12-14 15:36:22,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:36:22,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323584703] [2022-12-14 15:36:22,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:36:22,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:36:22,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:36:23,410 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:36:23,410 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:36:23,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323584703] [2022-12-14 15:36:23,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323584703] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:36:23,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405089772] [2022-12-14 15:36:23,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:36:23,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:36:23,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:36:23,411 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:36:23,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 15:36:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:36:23,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-14 15:36:23,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:36:23,604 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 15:36:23,604 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 11 treesize of output 11 [2022-12-14 15:36:23,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 15:36:23,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 15:36:23,822 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-14 15:36:23,822 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 21 treesize of output 26 [2022-12-14 15:36:23,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:23,962 INFO L321 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2022-12-14 15:36:23,963 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 2 case distinctions, treesize of input 43 treesize of output 47 [2022-12-14 15:36:24,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:24,222 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:36:24,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 40 [2022-12-14 15:36:24,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:36:24,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:36:24,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405089772] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:36:24,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [189539089] [2022-12-14 15:36:24,909 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2022-12-14 15:36:24,909 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:36:24,909 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:36:24,909 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:36:24,909 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:36:25,039 INFO L321 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2022-12-14 15:36:25,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 214 treesize of output 216 [2022-12-14 15:36:25,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:25,229 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:36:25,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:25,265 INFO L321 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2022-12-14 15:36:25,265 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 4 case distinctions, treesize of input 253 treesize of output 244 [2022-12-14 15:36:25,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:25,280 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:36:25,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:25,313 INFO L321 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2022-12-14 15:36:25,313 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 4 case distinctions, treesize of input 253 treesize of output 244 [2022-12-14 15:36:25,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:25,342 INFO L321 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-12-14 15:36:25,343 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 1 case distinctions, treesize of input 247 treesize of output 222 [2022-12-14 15:36:25,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:25,425 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:36:25,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:25,499 INFO L321 Elim1Store]: treesize reduction 189, result has 12.9 percent of original size [2022-12-14 15:36:25,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 264 treesize of output 251 [2022-12-14 15:36:25,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:25,521 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:36:25,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:25,586 INFO L321 Elim1Store]: treesize reduction 189, result has 12.9 percent of original size [2022-12-14 15:36:25,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 257 treesize of output 248 [2022-12-14 15:36:25,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:25,620 INFO L321 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-12-14 15:36:25,620 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 1 case distinctions, treesize of input 247 treesize of output 222 [2022-12-14 15:36:25,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:25,725 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:36:25,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:25,779 INFO L321 Elim1Store]: treesize reduction 154, result has 15.4 percent of original size [2022-12-14 15:36:25,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 257 treesize of output 255 [2022-12-14 15:36:25,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:25,800 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 239 treesize of output 222 [2022-12-14 15:36:25,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:25,820 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:36:25,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:25,865 INFO L321 Elim1Store]: treesize reduction 144, result has 20.9 percent of original size [2022-12-14 15:36:25,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 257 treesize of output 265 [2022-12-14 15:36:26,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:26,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:26,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:26,084 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:36:26,086 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:36:26,098 INFO L321 Elim1Store]: treesize reduction 85, result has 1.2 percent of original size [2022-12-14 15:36:26,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 498 treesize of output 464 [2022-12-14 15:36:26,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:26,127 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:36:26,128 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:36:26,131 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:36:26,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:26,200 INFO L321 Elim1Store]: treesize reduction 278, result has 12.9 percent of original size [2022-12-14 15:36:26,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 482 treesize of output 467 [2022-12-14 15:36:26,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:26,224 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 434 treesize of output 393 [2022-12-14 15:36:26,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 15:36:26,901 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 9 [2022-12-14 15:36:26,993 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 23 treesize of output 1 [2022-12-14 15:36:27,011 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-14 15:36:27,012 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 22 [2022-12-14 15:36:27,034 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-14 15:36:27,035 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 22 [2022-12-14 15:36:27,095 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-12-14 15:36:27,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-12-14 15:36:27,129 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-12-14 15:36:27,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-12-14 15:36:27,140 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 23 treesize of output 1 [2022-12-14 15:36:27,194 INFO L321 Elim1Store]: treesize reduction 116, result has 16.5 percent of original size [2022-12-14 15:36:27,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 39 [2022-12-14 15:36:27,240 INFO L321 Elim1Store]: treesize reduction 92, result has 33.8 percent of original size [2022-12-14 15:36:27,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 63 [2022-12-14 15:36:27,256 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-12-14 15:36:27,315 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 23 treesize of output 1 [2022-12-14 15:36:27,333 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:36:27,335 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:36:27,378 INFO L321 Elim1Store]: treesize reduction 224, result has 15.5 percent of original size [2022-12-14 15:36:27,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 64 [2022-12-14 15:36:27,402 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:36:27,405 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:36:27,480 INFO L321 Elim1Store]: treesize reduction 183, result has 30.9 percent of original size [2022-12-14 15:36:27,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 129 [2022-12-14 15:36:28,137 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 9 [2022-12-14 15:36:28,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 15:36:28,239 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 23 treesize of output 1 [2022-12-14 15:36:28,260 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-14 15:36:28,260 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 22 [2022-12-14 15:36:28,283 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-14 15:36:28,283 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 22 [2022-12-14 15:36:28,318 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 23 treesize of output 1 [2022-12-14 15:36:28,352 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-12-14 15:36:28,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-12-14 15:36:28,388 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-12-14 15:36:28,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-12-14 15:36:28,460 INFO L321 Elim1Store]: treesize reduction 116, result has 16.5 percent of original size [2022-12-14 15:36:28,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 39 [2022-12-14 15:36:28,514 INFO L321 Elim1Store]: treesize reduction 92, result has 33.8 percent of original size [2022-12-14 15:36:28,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 63 [2022-12-14 15:36:28,531 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-12-14 15:36:28,608 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:36:28,610 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:36:28,701 INFO L321 Elim1Store]: treesize reduction 183, result has 30.9 percent of original size [2022-12-14 15:36:28,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 129 [2022-12-14 15:36:28,728 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 23 treesize of output 1 [2022-12-14 15:36:28,749 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:36:28,751 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:36:28,808 INFO L321 Elim1Store]: treesize reduction 224, result has 15.5 percent of original size [2022-12-14 15:36:28,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 64 [2022-12-14 15:36:29,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 15:36:29,327 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 9 [2022-12-14 15:36:29,403 INFO L197 IcfgInterpreter]: Interpreting procedure rand_end_point with input of size 17 for LOIs [2022-12-14 15:36:29,408 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:36:35,857 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '21987#(and (<= |~#list~0.base| 3) (<= 0 |#NULL.base|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|)) |ULTIMATE.start_main_~cursor~1#1.offset|) (= (select |#valid| |~#list~0.base|) 1) (not (= |ULTIMATE.start_main_~cursor~1#1.base| 0)) (<= (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= |#NULL.offset| 0) (= |ULTIMATE.start_main_~cursor~1#1.offset| 0) (= |ULTIMATE.start_main_~cursor~1#1.base| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|))) (= |ULTIMATE.start_main_~next~1#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~cursor~1#1.base|) (+ (* 4 |ULTIMATE.start_main_~direction~0#1|) |ULTIMATE.start_main_~cursor~1#1.offset|))) (or (and (= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_main_~direction~0#1|) (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_main_~end_point~0#1|)) (and (= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_main_~direction~0#1|) (= ~unnamed1~0~LIST_END |ULTIMATE.start_main_~end_point~0#1|))) (<= (+ (* 4 |ULTIMATE.start_main_~direction~0#1|) 4 |ULTIMATE.start_main_~cursor~1#1.offset|) (select |#length| |ULTIMATE.start_main_~cursor~1#1.base|)) (<= |#NULL.base| 0) (= |ULTIMATE.start_main_~next~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~cursor~1#1.base|) (+ (* 4 |ULTIMATE.start_main_~direction~0#1|) |ULTIMATE.start_main_~cursor~1#1.offset|))) (<= 0 |~#list~0.offset|) (<= 3 |~#list~0.base|) (<= 0 |#NULL.offset|) (= (select |#valid| |ULTIMATE.start_main_~cursor~1#1.base|) 1) (not (< |ULTIMATE.start_main_~cursor~1#1.base| |#StackHeapBarrier|)) (<= 0 |#StackHeapBarrier|) (<= |~#list~0.offset| 0))' at error location [2022-12-14 15:36:35,858 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 15:36:35,858 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 15:36:35,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 17 [2022-12-14 15:36:35,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280356696] [2022-12-14 15:36:35,858 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 15:36:35,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-14 15:36:35,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:36:35,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-14 15:36:35,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2351, Unknown=1, NotChecked=0, Total=2550 [2022-12-14 15:36:35,859 INFO L87 Difference]: Start difference. First operand 393 states and 523 transitions. Second operand has 18 states, 17 states have (on average 4.117647058823529) internal successors, (70), 18 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 15:36:38,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:36:38,968 INFO L93 Difference]: Finished difference Result 747 states and 948 transitions. [2022-12-14 15:36:38,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-14 15:36:38,969 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.117647058823529) internal successors, (70), 18 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2022-12-14 15:36:38,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:36:38,970 INFO L225 Difference]: With dead ends: 747 [2022-12-14 15:36:38,970 INFO L226 Difference]: Without dead ends: 747 [2022-12-14 15:36:38,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1306 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=519, Invalid=4450, Unknown=1, NotChecked=0, Total=4970 [2022-12-14 15:36:38,971 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 1153 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1153 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 15:36:38,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1153 Valid, 1155 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 15:36:38,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2022-12-14 15:36:38,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 471. [2022-12-14 15:36:38,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 400 states have (on average 1.525) internal successors, (610), 446 states have internal predecessors, (610), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 14 states have call predecessors, (20), 20 states have call successors, (20) [2022-12-14 15:36:38,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 650 transitions. [2022-12-14 15:36:38,977 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 650 transitions. Word has length 37 [2022-12-14 15:36:38,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:36:38,977 INFO L495 AbstractCegarLoop]: Abstraction has 471 states and 650 transitions. [2022-12-14 15:36:38,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.117647058823529) internal successors, (70), 18 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 15:36:38,978 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 650 transitions. [2022-12-14 15:36:38,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-14 15:36:38,978 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:36:38,978 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:36:38,983 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 15:36:39,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:36:39,180 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:36:39,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:36:39,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1212409674, now seen corresponding path program 1 times [2022-12-14 15:36:39,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:36:39,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732411589] [2022-12-14 15:36:39,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:36:39,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:36:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:36:39,721 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 15:36:39,721 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:36:39,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732411589] [2022-12-14 15:36:39,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732411589] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:36:39,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:36:39,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 15:36:39,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77859803] [2022-12-14 15:36:39,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:36:39,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 15:36:39,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:36:39,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 15:36:39,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-14 15:36:39,723 INFO L87 Difference]: Start difference. First operand 471 states and 650 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 15:36:40,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:36:40,572 INFO L93 Difference]: Finished difference Result 946 states and 1262 transitions. [2022-12-14 15:36:40,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 15:36:40,573 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2022-12-14 15:36:40,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:36:40,574 INFO L225 Difference]: With dead ends: 946 [2022-12-14 15:36:40,575 INFO L226 Difference]: Without dead ends: 946 [2022-12-14 15:36:40,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650 [2022-12-14 15:36:40,575 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 991 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:36:40,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [991 Valid, 881 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 15:36:40,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2022-12-14 15:36:40,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 453. [2022-12-14 15:36:40,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 382 states have (on average 1.5104712041884816) internal successors, (577), 428 states have internal predecessors, (577), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 14 states have call predecessors, (20), 20 states have call successors, (20) [2022-12-14 15:36:40,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 617 transitions. [2022-12-14 15:36:40,585 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 617 transitions. Word has length 38 [2022-12-14 15:36:40,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:36:40,585 INFO L495 AbstractCegarLoop]: Abstraction has 453 states and 617 transitions. [2022-12-14 15:36:40,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 15:36:40,585 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 617 transitions. [2022-12-14 15:36:40,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 15:36:40,586 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:36:40,586 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:36:40,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-14 15:36:40,586 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:36:40,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:36:40,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1208787294, now seen corresponding path program 1 times [2022-12-14 15:36:40,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:36:40,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612032691] [2022-12-14 15:36:40,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:36:40,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:36:40,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:36:40,646 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 15:36:40,646 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:36:40,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612032691] [2022-12-14 15:36:40,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612032691] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:36:40,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:36:40,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:36:40,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318239744] [2022-12-14 15:36:40,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:36:40,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 15:36:40,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:36:40,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 15:36:40,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:36:40,647 INFO L87 Difference]: Start difference. First operand 453 states and 617 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:36:40,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:36:40,854 INFO L93 Difference]: Finished difference Result 579 states and 785 transitions. [2022-12-14 15:36:40,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 15:36:40,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-12-14 15:36:40,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:36:40,856 INFO L225 Difference]: With dead ends: 579 [2022-12-14 15:36:40,856 INFO L226 Difference]: Without dead ends: 579 [2022-12-14 15:36:40,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-14 15:36:40,857 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 112 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:36:40,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 309 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:36:40,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2022-12-14 15:36:40,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 454. [2022-12-14 15:36:40,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 383 states have (on average 1.5091383812010444) internal successors, (578), 429 states have internal predecessors, (578), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 14 states have call predecessors, (20), 20 states have call successors, (20) [2022-12-14 15:36:40,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 618 transitions. [2022-12-14 15:36:40,862 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 618 transitions. Word has length 39 [2022-12-14 15:36:40,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:36:40,863 INFO L495 AbstractCegarLoop]: Abstraction has 454 states and 618 transitions. [2022-12-14 15:36:40,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:36:40,863 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 618 transitions. [2022-12-14 15:36:40,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 15:36:40,863 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:36:40,863 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:36:40,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-14 15:36:40,863 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:36:40,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:36:40,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1208787293, now seen corresponding path program 1 times [2022-12-14 15:36:40,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:36:40,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832118330] [2022-12-14 15:36:40,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:36:40,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:36:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:36:40,954 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 15:36:40,954 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:36:40,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832118330] [2022-12-14 15:36:40,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832118330] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:36:40,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:36:40,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:36:40,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678688025] [2022-12-14 15:36:40,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:36:40,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 15:36:40,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:36:40,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 15:36:40,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:36:40,956 INFO L87 Difference]: Start difference. First operand 454 states and 618 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:36:41,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:36:41,148 INFO L93 Difference]: Finished difference Result 450 states and 606 transitions. [2022-12-14 15:36:41,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 15:36:41,148 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-12-14 15:36:41,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:36:41,151 INFO L225 Difference]: With dead ends: 450 [2022-12-14 15:36:41,151 INFO L226 Difference]: Without dead ends: 450 [2022-12-14 15:36:41,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-12-14 15:36:41,151 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 115 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:36:41,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 278 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:36:41,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2022-12-14 15:36:41,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 444. [2022-12-14 15:36:41,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 377 states have (on average 1.4721485411140585) internal successors, (555), 419 states have internal predecessors, (555), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 14 states have call predecessors, (20), 20 states have call successors, (20) [2022-12-14 15:36:41,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 595 transitions. [2022-12-14 15:36:41,156 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 595 transitions. Word has length 39 [2022-12-14 15:36:41,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:36:41,156 INFO L495 AbstractCegarLoop]: Abstraction has 444 states and 595 transitions. [2022-12-14 15:36:41,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:36:41,156 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 595 transitions. [2022-12-14 15:36:41,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 15:36:41,157 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:36:41,157 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:36:41,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-14 15:36:41,157 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:36:41,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:36:41,157 INFO L85 PathProgramCache]: Analyzing trace with hash 403768979, now seen corresponding path program 1 times [2022-12-14 15:36:41,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:36:41,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444214059] [2022-12-14 15:36:41,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:36:41,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:36:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:36:43,492 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:36:43,492 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:36:43,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444214059] [2022-12-14 15:36:43,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444214059] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:36:43,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152816494] [2022-12-14 15:36:43,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:36:43,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:36:43,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:36:43,493 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:36:43,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 15:36:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:36:43,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 116 conjunts are in the unsatisfiable core [2022-12-14 15:36:43,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:36:43,813 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 15:36:43,813 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 11 treesize of output 11 [2022-12-14 15:36:43,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 15:36:44,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-12-14 15:36:44,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 15:36:44,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:44,445 INFO L321 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2022-12-14 15:36:44,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 91 [2022-12-14 15:36:44,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-12-14 15:36:44,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 12 [2022-12-14 15:36:44,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:44,694 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-14 15:36:44,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 99 [2022-12-14 15:36:44,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:44,712 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-14 15:36:44,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 115 [2022-12-14 15:36:45,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:45,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:45,431 INFO L321 Elim1Store]: treesize reduction 52, result has 42.9 percent of original size [2022-12-14 15:36:45,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 131 treesize of output 148 [2022-12-14 15:36:45,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:45,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:45,440 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 195 treesize of output 186 [2022-12-14 15:36:46,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:46,441 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:36:46,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:46,451 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:36:46,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 53 [2022-12-14 15:36:46,456 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:36:46,457 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:36:46,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:46,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:46,462 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:36:46,486 INFO L321 Elim1Store]: treesize reduction 56, result has 37.1 percent of original size [2022-12-14 15:36:46,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 97 treesize of output 72 [2022-12-14 15:36:46,650 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:36:46,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:36:52,185 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:36:52,185 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 276 treesize of output 230 [2022-12-14 15:36:52,234 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:36:52,234 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 230 treesize of output 198 [2022-12-14 15:36:52,280 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:36:52,281 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 37 [2022-12-14 15:36:52,307 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:36:52,307 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 69 [2022-12-14 15:36:52,356 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:36:52,356 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 230 treesize of output 198 [2022-12-14 15:36:52,394 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:36:52,395 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 276 treesize of output 230 [2022-12-14 15:36:52,441 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:36:52,441 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 37 [2022-12-14 15:36:52,464 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:36:52,464 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 69 [2022-12-14 15:37:01,118 WARN L233 SmtUtils]: Spent 5.18s on a formula simplification that was a NOOP. DAG size: 231 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:37:05,042 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 8 treesize of output 4 [2022-12-14 15:37:07,185 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4)))) (or (let ((.cse6 (* ~unnamed2~0~ITEM_NEXT 4))) (let ((.cse0 (= ~unnamed1~0~LIST_BEG |c_ULTIMATE.start_main_#t~ret30#1|)) (.cse13 (+ |c_~#list~0.offset| (* ~unnamed1~0~LIST_END 4))) (.cse7 (+ |c_~#list~0.offset| .cse6)) (.cse4 (+ |c_~#list~0.offset| (* 4 |c_ULTIMATE.start_main_#t~ret30#1|))) (.cse3 (* ~unnamed2~0~ITEM_PREV 4))) (and (or (not .cse0) (and (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) 0)) (forall ((|v_ULTIMATE.start_create_item_~cursor#1.offset_47| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse6 0) .cse3 0)))) (let ((.cse2 (store (select .cse1 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (or (not (= (select (select (store .cse1 |c_~#list~0.base| .cse2) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3) 0)) (< .cse4 |v_ULTIMATE.start_create_item_~cursor#1.offset_47|) (= (select (select (store .cse1 |c_~#list~0.base| (store .cse2 .cse5 |v_ULTIMATE.start_create_item_~item~0#1.base_31|)) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse6) 0) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_717 Int) (v_ArrVal_713 Int)) (or (not (= (select v_arrayElimArr_6 .cse3) 0)) (= (select (store (store (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_31| v_arrayElimArr_6) |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| v_ArrVal_713) .cse5 v_ArrVal_717) .cse7) 0))))))))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) 0)) (forall ((|v_ULTIMATE.start_create_item_~cursor#1.offset_47| Int)) (let ((.cse8 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse6 0) .cse3 0)))) (let ((.cse9 (store (select .cse8 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (let ((.cse10 (store .cse9 .cse5 |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (or (not (= (select (select (store .cse8 |c_~#list~0.base| .cse9) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3) 0)) (< .cse4 |v_ULTIMATE.start_create_item_~cursor#1.offset_47|) (= (select .cse10 .cse7) 0) (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_717 Int) (v_ArrVal_713 Int)) (let ((.cse11 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_31| v_arrayElimArr_7))) (let ((.cse12 (store (select .cse11 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| v_ArrVal_713))) (or (= (select (select (store .cse11 |c_~#list~0.base| (store .cse12 .cse5 v_ArrVal_717)) (select .cse10 .cse13)) .cse3) 0) (not (= (select (select (store .cse11 |c_~#list~0.base| .cse12) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3) 0)) (not (= (select v_arrayElimArr_7 .cse3) 0))))))))))))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) 0)) (forall ((|v_ULTIMATE.start_create_item_~cursor#1.offset_47| Int)) (let ((.cse14 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse6 0) .cse3 0)))) (let ((.cse15 (store (select .cse14 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (or (not (= (select (select (store .cse14 |c_~#list~0.base| .cse15) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3) 0)) (< .cse4 |v_ULTIMATE.start_create_item_~cursor#1.offset_47|) (= (select (store .cse15 .cse5 |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse7) 0) (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_717 Int) (v_ArrVal_713 Int)) (let ((.cse16 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_31| v_arrayElimArr_4))) (let ((.cse17 (store (select .cse16 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| v_ArrVal_713))) (or (= (select (select (store .cse16 |c_~#list~0.base| (store .cse17 .cse5 v_ArrVal_717)) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse6) 0) (not (= (select (select (store .cse16 |c_~#list~0.base| .cse17) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3) 0)) (not (= (select v_arrayElimArr_4 .cse3) 0)))))))))))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) 0)) (forall ((|v_ULTIMATE.start_create_item_~cursor#1.offset_47| Int)) (or (not (= (select (select (let ((.cse18 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse6 0) .cse3 0)))) (store .cse18 |c_~#list~0.base| (store (select .cse18 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3) 0)) (forall ((v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_717 Int) (v_ArrVal_713 Int)) (let ((.cse19 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_31| v_arrayElimArr_3))) (let ((.cse20 (store (select .cse19 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| v_ArrVal_713))) (let ((.cse21 (store .cse20 .cse5 v_ArrVal_717))) (or (not (= (select (select (store .cse19 |c_~#list~0.base| .cse20) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3) 0)) (not (= (select v_arrayElimArr_3 .cse3) 0)) (= (select .cse21 .cse7) 0) (= (select (select (store .cse19 |c_~#list~0.base| .cse21) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse6) 0)))))) (< .cse4 |v_ULTIMATE.start_create_item_~cursor#1.offset_47|))))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) 0)) (forall ((|v_ULTIMATE.start_create_item_~cursor#1.offset_47| Int)) (let ((.cse23 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse6 0) .cse3 0)))) (let ((.cse24 (store (select .cse23 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (let ((.cse25 (store .cse24 .cse5 |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (or (forall ((v_ArrVal_713 Int) (v_arrayElimArr_9 (Array Int Int))) (or (not (= (select (select (let ((.cse22 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_31| v_arrayElimArr_9))) (store .cse22 |c_~#list~0.base| (store (select .cse22 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| v_ArrVal_713))) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3) 0)) (not (= 0 (select v_arrayElimArr_9 .cse3))))) (not (= (select (select (store .cse23 |c_~#list~0.base| .cse24) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3) 0)) (< .cse4 |v_ULTIMATE.start_create_item_~cursor#1.offset_47|) (= (select (select (store .cse23 |c_~#list~0.base| .cse25) (select .cse25 .cse13)) .cse3) 0) (= (select .cse25 .cse7) 0)))))))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) 0)) (forall ((|v_ULTIMATE.start_create_item_~cursor#1.offset_47| Int)) (let ((.cse26 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse6 0) .cse3 0)))) (let ((.cse27 (store (select .cse26 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (or (not (= (select (select (store .cse26 |c_~#list~0.base| .cse27) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3) 0)) (< .cse4 |v_ULTIMATE.start_create_item_~cursor#1.offset_47|) (= (select (let ((.cse28 (store .cse27 .cse5 |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (select (store .cse26 |c_~#list~0.base| .cse28) (select .cse28 .cse13))) .cse3) 0) (forall ((v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_717 Int) (v_ArrVal_713 Int)) (let ((.cse29 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_31| v_arrayElimArr_10))) (let ((.cse30 (store (select .cse29 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| v_ArrVal_713))) (or (not (= (select (select (store .cse29 |c_~#list~0.base| .cse30) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3) 0)) (= (select (store .cse30 .cse5 v_ArrVal_717) .cse7) 0) (not (= (select v_arrayElimArr_10 .cse3) 0)))))))))))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_31| Int)) (or (forall ((|v_ULTIMATE.start_create_item_~cursor#1.offset_47| Int)) (let ((.cse31 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse6 0) .cse3 0)))) (let ((.cse32 (store (select .cse31 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (or (not (= (select (select (store .cse31 |c_~#list~0.base| .cse32) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3) 0)) (< .cse4 |v_ULTIMATE.start_create_item_~cursor#1.offset_47|) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_717 Int) (v_ArrVal_713 Int)) (let ((.cse33 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_31| v_arrayElimArr_8))) (let ((.cse34 (store (select .cse33 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| v_ArrVal_713))) (let ((.cse35 (store .cse34 .cse5 v_ArrVal_717))) (or (not (= (select v_arrayElimArr_8 .cse3) 0)) (not (= (select (select (store .cse33 |c_~#list~0.base| .cse34) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3) 0)) (= (select (select (store .cse33 |c_~#list~0.base| .cse35) (select (store .cse32 .cse5 |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse13)) .cse3) 0) (= (select .cse35 .cse7) 0)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) 0)))) (forall ((|v_ULTIMATE.start_create_item_~cursor#1.offset_47| Int) (|v_ULTIMATE.start_create_item_~item~0#1.base_31| Int)) (let ((.cse36 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse6 0) .cse3 0)))) (let ((.cse37 (store (select .cse36 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (let ((.cse38 (store .cse37 .cse5 |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (or (not (= (select (select (store .cse36 |c_~#list~0.base| .cse37) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) 0)) (< .cse4 |v_ULTIMATE.start_create_item_~cursor#1.offset_47|) (= (select (select (store .cse36 |c_~#list~0.base| .cse38) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse6) 0) (= (select .cse38 .cse7) 0)))))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) 0)) (forall ((|v_ULTIMATE.start_create_item_~cursor#1.offset_47| Int)) (or (forall ((v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_717 Int) (v_ArrVal_713 Int)) (let ((.cse39 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_31| v_arrayElimArr_3))) (let ((.cse40 (store (select .cse39 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| v_ArrVal_713))) (let ((.cse41 (store .cse40 .cse5 v_ArrVal_717))) (or (not (= (select (select (store .cse39 |c_~#list~0.base| .cse40) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3) 0)) (not (= (select v_arrayElimArr_3 .cse6) 0)) (= (select .cse41 .cse7) 0) (= (select (select (store .cse39 |c_~#list~0.base| .cse41) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse6) 0)))))) (not (= (select (select (let ((.cse42 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3 0) .cse6 0)))) (store .cse42 |c_~#list~0.base| (store (select .cse42 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3) 0)) (< .cse4 |v_ULTIMATE.start_create_item_~cursor#1.offset_47|))))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) 0)) (forall ((|v_ULTIMATE.start_create_item_~cursor#1.offset_47| Int)) (let ((.cse43 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3 0) .cse6 0)))) (let ((.cse46 (store (select .cse43 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (let ((.cse44 (store .cse46 .cse5 |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (or (= (select (select (store .cse43 |c_~#list~0.base| .cse44) (select .cse44 .cse13)) .cse3) 0) (forall ((v_ArrVal_713 Int) (v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse6) 0)) (not (= (select (select (let ((.cse45 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_31| v_arrayElimArr_9))) (store .cse45 |c_~#list~0.base| (store (select .cse45 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| v_ArrVal_713))) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3) 0)))) (not (= (select (select (store .cse43 |c_~#list~0.base| .cse46) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3) 0)) (< .cse4 |v_ULTIMATE.start_create_item_~cursor#1.offset_47|) (= (select .cse44 .cse7) 0)))))))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) 0)) (forall ((|v_ULTIMATE.start_create_item_~cursor#1.offset_47| Int)) (let ((.cse50 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3 0) .cse6 0)))) (let ((.cse51 (store (select .cse50 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (let ((.cse49 (store .cse51 .cse5 |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_717 Int) (v_ArrVal_713 Int)) (let ((.cse47 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_31| v_arrayElimArr_7))) (let ((.cse48 (store (select .cse47 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| v_ArrVal_713))) (or (not (= (select v_arrayElimArr_7 .cse6) 0)) (= (select (select (store .cse47 |c_~#list~0.base| (store .cse48 .cse5 v_ArrVal_717)) (select .cse49 .cse13)) .cse3) 0) (not (= (select (select (store .cse47 |c_~#list~0.base| .cse48) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3) 0)))))) (not (= (select (select (store .cse50 |c_~#list~0.base| .cse51) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3) 0)) (< .cse4 |v_ULTIMATE.start_create_item_~cursor#1.offset_47|) (= (select .cse49 .cse7) 0)))))))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_31| Int)) (or (forall ((|v_ULTIMATE.start_create_item_~cursor#1.offset_47| Int)) (let ((.cse53 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3 0) .cse6 0)))) (let ((.cse54 (store (select .cse53 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (let ((.cse55 (store .cse54 .cse5 |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_713 Int)) (or (not (= 0 (select (select (let ((.cse52 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_31| v_arrayElimArr_5))) (store .cse52 |c_~#list~0.base| (store (select .cse52 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| v_ArrVal_713))) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3))) (not (= (select v_arrayElimArr_5 .cse6) 0)))) (not (= (select (select (store .cse53 |c_~#list~0.base| .cse54) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3) 0)) (< .cse4 |v_ULTIMATE.start_create_item_~cursor#1.offset_47|) (= (select .cse55 .cse7) 0) (= (select (select (store .cse53 |c_~#list~0.base| .cse55) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse6) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) 0)))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_31| Int)) (or (forall ((|v_ULTIMATE.start_create_item_~cursor#1.offset_47| Int)) (let ((.cse60 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3 0) .cse6 0)))) (let ((.cse59 (store (select .cse60 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (or (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_717 Int) (v_ArrVal_713 Int)) (let ((.cse56 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_31| v_arrayElimArr_8))) (let ((.cse57 (store (select .cse56 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| v_ArrVal_713))) (let ((.cse58 (store .cse57 .cse5 v_ArrVal_717))) (or (not (= (select (select (store .cse56 |c_~#list~0.base| .cse57) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3) 0)) (= (select .cse58 .cse7) 0) (= (select (select (store .cse56 |c_~#list~0.base| .cse58) (select (store .cse59 .cse5 |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse13)) .cse3) 0) (not (= (select v_arrayElimArr_8 .cse6) 0))))))) (not (= (select (select (store .cse60 |c_~#list~0.base| .cse59) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3) 0)) (< .cse4 |v_ULTIMATE.start_create_item_~cursor#1.offset_47|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) 0)))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_31| Int)) (or (forall ((|v_ULTIMATE.start_create_item_~cursor#1.offset_47| Int)) (let ((.cse63 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3 0) .cse6 0)))) (let ((.cse64 (store (select .cse63 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_717 Int) (v_ArrVal_713 Int)) (let ((.cse61 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_31| v_arrayElimArr_4))) (let ((.cse62 (store (select .cse61 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| v_ArrVal_713))) (or (not (= (select v_arrayElimArr_4 .cse6) 0)) (= (select (select (store .cse61 |c_~#list~0.base| (store .cse62 .cse5 v_ArrVal_717)) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse6) 0) (not (= (select (select (store .cse61 |c_~#list~0.base| .cse62) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3) 0)))))) (not (= (select (select (store .cse63 |c_~#list~0.base| .cse64) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3) 0)) (< .cse4 |v_ULTIMATE.start_create_item_~cursor#1.offset_47|) (= (select (store .cse64 .cse5 |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse7) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) 0)))) (or (and (forall ((|v_ULTIMATE.start_create_item_~term_field~0#1_81| Int)) (let ((.cse65 (* 4 |v_ULTIMATE.start_create_item_~term_field~0#1_81|))) (or (< 4 .cse65) (forall ((|v_ULTIMATE.start_create_item_~link_field~0#1_80| Int) (|v_ULTIMATE.start_create_item_~item~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) 0)) (forall ((|v_ULTIMATE.start_create_item_~cursor#1.offset_47| Int)) (let ((.cse67 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) (* |v_ULTIMATE.start_create_item_~link_field~0#1_80| 4) 0) .cse65 0)))) (let ((.cse68 (store (select .cse67 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (let ((.cse66 (store .cse68 .cse5 |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (or (= (select .cse66 .cse7) 0) (not (= (select (select (store .cse67 |c_~#list~0.base| .cse68) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3) 0)) (= (select (select (store .cse67 |c_~#list~0.base| .cse66) (select .cse66 .cse13)) .cse3) 0) (< .cse4 |v_ULTIMATE.start_create_item_~cursor#1.offset_47|) (forall ((v_ArrVal_713 Int) (v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse65) 0)) (not (= (select (select (let ((.cse69 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_31| v_arrayElimArr_9))) (store .cse69 |c_~#list~0.base| (store (select .cse69 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| v_ArrVal_713))) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3) 0)))))))))))))) (forall ((|v_ULTIMATE.start_create_item_~term_field~0#1_81| Int)) (let ((.cse70 (* 4 |v_ULTIMATE.start_create_item_~term_field~0#1_81|))) (or (< 4 .cse70) (forall ((|v_ULTIMATE.start_create_item_~link_field~0#1_80| Int) (|v_ULTIMATE.start_create_item_~item~0#1.base_31| Int)) (or (forall ((|v_ULTIMATE.start_create_item_~cursor#1.offset_47| Int)) (let ((.cse71 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) (* |v_ULTIMATE.start_create_item_~link_field~0#1_80| 4) 0) .cse70 0)))) (let ((.cse72 (store (select .cse71 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (or (not (= (select (select (store .cse71 |c_~#list~0.base| .cse72) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3) 0)) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_717 Int) (v_ArrVal_713 Int)) (let ((.cse73 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_31| v_arrayElimArr_8))) (let ((.cse74 (store (select .cse73 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| v_ArrVal_713))) (let ((.cse75 (store .cse74 .cse5 v_ArrVal_717))) (or (not (= (select (select (store .cse73 |c_~#list~0.base| .cse74) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3) 0)) (= (select (select (store .cse73 |c_~#list~0.base| .cse75) (select (store .cse72 .cse5 |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse13)) .cse3) 0) (not (= (select v_arrayElimArr_8 .cse70) 0)) (= (select .cse75 .cse7) 0)))))) (< .cse4 |v_ULTIMATE.start_create_item_~cursor#1.offset_47|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) 0))))))) (forall ((|v_ULTIMATE.start_create_item_~term_field~0#1_81| Int)) (let ((.cse76 (* 4 |v_ULTIMATE.start_create_item_~term_field~0#1_81|))) (or (< 4 .cse76) (forall ((|v_ULTIMATE.start_create_item_~link_field~0#1_80| Int) (|v_ULTIMATE.start_create_item_~item~0#1.base_31| Int)) (or (forall ((|v_ULTIMATE.start_create_item_~cursor#1.offset_47| Int)) (let ((.cse78 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) (* |v_ULTIMATE.start_create_item_~link_field~0#1_80| 4) 0) .cse76 0)))) (let ((.cse79 (store (select .cse78 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (let ((.cse77 (store .cse79 .cse5 |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (or (= (select .cse77 .cse7) 0) (= (select (select (store .cse78 |c_~#list~0.base| .cse77) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse6) 0) (not (= (select (select (store .cse78 |c_~#list~0.base| .cse79) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3) 0)) (< .cse4 |v_ULTIMATE.start_create_item_~cursor#1.offset_47|) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_713 Int)) (or (not (= 0 (select (select (let ((.cse80 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_31| v_arrayElimArr_5))) (store .cse80 |c_~#list~0.base| (store (select .cse80 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| v_ArrVal_713))) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3))) (not (= (select v_arrayElimArr_5 .cse76) 0))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) 0))))))) (forall ((|v_ULTIMATE.start_create_item_~term_field~0#1_81| Int)) (let ((.cse81 (* 4 |v_ULTIMATE.start_create_item_~term_field~0#1_81|))) (or (< 4 .cse81) (forall ((|v_ULTIMATE.start_create_item_~link_field~0#1_80| Int) (|v_ULTIMATE.start_create_item_~item~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) 0)) (forall ((|v_ULTIMATE.start_create_item_~cursor#1.offset_47| Int)) (let ((.cse83 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) (* |v_ULTIMATE.start_create_item_~link_field~0#1_80| 4) 0) .cse81 0)))) (let ((.cse82 (store (select .cse83 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (or (= (select (store .cse82 .cse5 |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse7) 0) (not (= (select (select (store .cse83 |c_~#list~0.base| .cse82) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3) 0)) (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_717 Int) (v_ArrVal_713 Int)) (let ((.cse84 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_31| v_arrayElimArr_4))) (let ((.cse85 (store (select .cse84 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| v_ArrVal_713))) (or (not (= (select v_arrayElimArr_4 .cse81) 0)) (= (select (select (store .cse84 |c_~#list~0.base| (store .cse85 .cse5 v_ArrVal_717)) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse6) 0) (not (= (select (select (store .cse84 |c_~#list~0.base| .cse85) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3) 0)))))) (< .cse4 |v_ULTIMATE.start_create_item_~cursor#1.offset_47|)))))))))) (forall ((|v_ULTIMATE.start_create_item_~term_field~0#1_81| Int)) (let ((.cse88 (* 4 |v_ULTIMATE.start_create_item_~term_field~0#1_81|))) (or (forall ((|v_ULTIMATE.start_create_item_~link_field~0#1_80| Int) (|v_ULTIMATE.start_create_item_~item~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) 0)) (forall ((|v_ULTIMATE.start_create_item_~cursor#1.offset_47| Int)) (let ((.cse90 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) (* |v_ULTIMATE.start_create_item_~link_field~0#1_80| 4) 0) .cse88 0)))) (let ((.cse91 (store (select .cse90 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (let ((.cse89 (store .cse91 .cse5 |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_717 Int) (v_ArrVal_713 Int)) (let ((.cse86 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_31| v_arrayElimArr_7))) (let ((.cse87 (store (select .cse86 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| v_ArrVal_713))) (or (not (= (select (select (store .cse86 |c_~#list~0.base| .cse87) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3) 0)) (not (= (select v_arrayElimArr_7 .cse88) 0)) (= (select (select (store .cse86 |c_~#list~0.base| (store .cse87 .cse5 v_ArrVal_717)) (select .cse89 .cse13)) .cse3) 0))))) (= (select .cse89 .cse7) 0) (not (= (select (select (store .cse90 |c_~#list~0.base| .cse91) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3) 0)) (< .cse4 |v_ULTIMATE.start_create_item_~cursor#1.offset_47|)))))))) (< 4 .cse88)))) (forall ((|v_ULTIMATE.start_create_item_~term_field~0#1_81| Int)) (let ((.cse92 (* 4 |v_ULTIMATE.start_create_item_~term_field~0#1_81|))) (or (< 4 .cse92) (forall ((|v_ULTIMATE.start_create_item_~link_field~0#1_80| Int) (|v_ULTIMATE.start_create_item_~item~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) 0)) (forall ((|v_ULTIMATE.start_create_item_~cursor#1.offset_47| Int)) (let ((.cse95 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) (* |v_ULTIMATE.start_create_item_~link_field~0#1_80| 4) 0) .cse92 0)))) (let ((.cse96 (store (select .cse95 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (or (forall ((v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_717 Int) (v_ArrVal_713 Int)) (let ((.cse93 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_31| v_arrayElimArr_10))) (let ((.cse94 (store (select .cse93 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| v_ArrVal_713))) (or (not (= (select (select (store .cse93 |c_~#list~0.base| .cse94) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3) 0)) (= (select (store .cse94 .cse5 v_ArrVal_717) .cse7) 0) (not (= (select v_arrayElimArr_10 .cse92) 0)))))) (not (= (select (select (store .cse95 |c_~#list~0.base| .cse96) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3) 0)) (= (select (let ((.cse97 (store .cse96 .cse5 |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (select (store .cse95 |c_~#list~0.base| .cse97) (select .cse97 .cse13))) .cse3) 0) (< .cse4 |v_ULTIMATE.start_create_item_~cursor#1.offset_47|)))))))))) (forall ((|v_ULTIMATE.start_create_item_~term_field~0#1_81| Int)) (let ((.cse98 (* 4 |v_ULTIMATE.start_create_item_~term_field~0#1_81|))) (or (< 4 .cse98) (forall ((|v_ULTIMATE.start_create_item_~link_field~0#1_80| Int) (|v_ULTIMATE.start_create_item_~item~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) 0)) (forall ((|v_ULTIMATE.start_create_item_~cursor#1.offset_47| Int)) (let ((.cse99 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) (* |v_ULTIMATE.start_create_item_~link_field~0#1_80| 4) 0) .cse98 0)))) (let ((.cse100 (store (select .cse99 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (or (= (select (select (store .cse99 |c_~#list~0.base| (store .cse100 .cse5 |v_ULTIMATE.start_create_item_~item~0#1.base_31|)) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse6) 0) (not (= (select (select (store .cse99 |c_~#list~0.base| .cse100) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3) 0)) (< .cse4 |v_ULTIMATE.start_create_item_~cursor#1.offset_47|) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_717 Int) (v_ArrVal_713 Int)) (let ((.cse102 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_31| v_arrayElimArr_6))) (let ((.cse101 (store (select .cse102 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| v_ArrVal_713))) (or (= (select (store .cse101 .cse5 v_ArrVal_717) .cse7) 0) (not (= (select (select (store .cse102 |c_~#list~0.base| .cse101) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3) 0)) (not (= (select v_arrayElimArr_6 .cse98) 0))))))))))))))) (forall ((|v_ULTIMATE.start_create_item_~term_field~0#1_81| Int)) (let ((.cse103 (* 4 |v_ULTIMATE.start_create_item_~term_field~0#1_81|))) (or (< 4 .cse103) (forall ((|v_ULTIMATE.start_create_item_~link_field~0#1_80| Int) (|v_ULTIMATE.start_create_item_~item~0#1.base_31| Int)) (or (forall ((|v_ULTIMATE.start_create_item_~cursor#1.offset_47| Int)) (or (not (= (select (select (let ((.cse104 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) (* |v_ULTIMATE.start_create_item_~link_field~0#1_80| 4) 0) .cse103 0)))) (store .cse104 |c_~#list~0.base| (store (select .cse104 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3) 0)) (< .cse4 |v_ULTIMATE.start_create_item_~cursor#1.offset_47|) (forall ((v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_717 Int) (v_ArrVal_713 Int)) (let ((.cse105 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_31| v_arrayElimArr_3))) (let ((.cse106 (store (select .cse105 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| v_ArrVal_713))) (let ((.cse107 (store .cse106 .cse5 v_ArrVal_717))) (or (not (= (select (select (store .cse105 |c_~#list~0.base| .cse106) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3) 0)) (= (select .cse107 .cse7) 0) (= (select (select (store .cse105 |c_~#list~0.base| .cse107) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse6) 0) (not (= (select v_arrayElimArr_3 .cse103) 0))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) 0)))))))) (= ~unnamed1~0~LIST_END |c_ULTIMATE.start_main_#t~ret30#1|)) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_31| Int)) (or (forall ((|v_ULTIMATE.start_create_item_~cursor#1.offset_47| Int)) (let ((.cse110 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3 0) .cse6 0)))) (let ((.cse111 (store (select .cse110 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_717 Int) (v_ArrVal_713 Int)) (let ((.cse109 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_31| v_arrayElimArr_6))) (let ((.cse108 (store (select .cse109 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| v_ArrVal_713))) (or (not (= (select v_arrayElimArr_6 .cse6) 0)) (= (select (store .cse108 .cse5 v_ArrVal_717) .cse7) 0) (not (= (select (select (store .cse109 |c_~#list~0.base| .cse108) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3) 0)))))) (not (= (select (select (store .cse110 |c_~#list~0.base| .cse111) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3) 0)) (< .cse4 |v_ULTIMATE.start_create_item_~cursor#1.offset_47|) (= (select (select (store .cse110 |c_~#list~0.base| (store .cse111 .cse5 |v_ULTIMATE.start_create_item_~item~0#1.base_31|)) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse6) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) 0)))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_31| Int)) (or (forall ((|v_ULTIMATE.start_create_item_~cursor#1.offset_47| Int)) (let ((.cse112 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3 0) .cse6 0)))) (let ((.cse114 (store (select .cse112 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (or (= (select (let ((.cse113 (store .cse114 .cse5 |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (select (store .cse112 |c_~#list~0.base| .cse113) (select .cse113 .cse13))) .cse3) 0) (forall ((v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_717 Int) (v_ArrVal_713 Int)) (let ((.cse115 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_31| v_arrayElimArr_10))) (let ((.cse116 (store (select .cse115 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| v_ArrVal_713))) (or (not (= (select (select (store .cse115 |c_~#list~0.base| .cse116) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3) 0)) (= (select (store .cse116 .cse5 v_ArrVal_717) .cse7) 0) (not (= 0 (select v_arrayElimArr_10 .cse6))))))) (not (= (select (select (store .cse112 |c_~#list~0.base| .cse114) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse3) 0)) (< .cse4 |v_ULTIMATE.start_create_item_~cursor#1.offset_47|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) 0))))))))) (not (<= 0 .cse5)))) is different from true [2022-12-14 15:37:10,443 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4)))) (or (not (<= 0 .cse0)) (let ((.cse9 (* ~unnamed2~0~ITEM_NEXT 4))) (let ((.cse1 (+ |c_~#list~0.offset| (* ~unnamed1~0~LIST_END 4))) (.cse8 (+ |c_~#list~0.offset| .cse9)) (.cse5 (* ~unnamed2~0~ITEM_PREV 4))) (and (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_31| Int)) (or (forall ((|v_ULTIMATE.start_create_item_~cursor#1.offset_47| Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse5 0) .cse9 0)))) (let ((.cse4 (store (select .cse2 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (or (< .cse1 |v_ULTIMATE.start_create_item_~cursor#1.offset_47|) (= (select (let ((.cse3 (store .cse4 .cse0 |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (select (store .cse2 |c_~#list~0.base| .cse3) (select .cse3 .cse1))) .cse5) 0) (forall ((v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_717 Int) (v_ArrVal_713 Int)) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_31| v_arrayElimArr_10))) (let ((.cse7 (store (select .cse6 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| v_ArrVal_713))) (or (not (= (select (select (store .cse6 |c_~#list~0.base| .cse7) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse5) 0)) (= (select (store .cse7 .cse0 v_ArrVal_717) .cse8) 0) (not (= 0 (select v_arrayElimArr_10 .cse9))))))) (not (= (select (select (store .cse2 |c_~#list~0.base| .cse4) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse5) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) 0)))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_31| Int)) (or (forall ((|v_ULTIMATE.start_create_item_~cursor#1.offset_47| Int)) (let ((.cse12 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse5 0) .cse9 0)))) (let ((.cse13 (store (select .cse12 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (or (< .cse1 |v_ULTIMATE.start_create_item_~cursor#1.offset_47|) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_717 Int) (v_ArrVal_713 Int)) (let ((.cse11 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_31| v_arrayElimArr_6))) (let ((.cse10 (store (select .cse11 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| v_ArrVal_713))) (or (not (= (select v_arrayElimArr_6 .cse9) 0)) (= (select (store .cse10 .cse0 v_ArrVal_717) .cse8) 0) (not (= (select (select (store .cse11 |c_~#list~0.base| .cse10) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse5) 0)))))) (not (= (select (select (store .cse12 |c_~#list~0.base| .cse13) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse5) 0)) (= (select (select (store .cse12 |c_~#list~0.base| (store .cse13 .cse0 |v_ULTIMATE.start_create_item_~item~0#1.base_31|)) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse9) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) 0)))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_31| Int)) (or (forall ((|v_ULTIMATE.start_create_item_~cursor#1.offset_47| Int)) (let ((.cse16 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse5 0) .cse9 0)))) (let ((.cse17 (store (select .cse16 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (or (< .cse1 |v_ULTIMATE.start_create_item_~cursor#1.offset_47|) (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_717 Int) (v_ArrVal_713 Int)) (let ((.cse14 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_31| v_arrayElimArr_4))) (let ((.cse15 (store (select .cse14 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| v_ArrVal_713))) (or (not (= (select v_arrayElimArr_4 .cse9) 0)) (= (select (select (store .cse14 |c_~#list~0.base| (store .cse15 .cse0 v_ArrVal_717)) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse9) 0) (not (= (select (select (store .cse14 |c_~#list~0.base| .cse15) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse5) 0)))))) (not (= (select (select (store .cse16 |c_~#list~0.base| .cse17) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse5) 0)) (= (select (store .cse17 .cse0 |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse8) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) 0)))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_31| Int)) (or (forall ((|v_ULTIMATE.start_create_item_~cursor#1.offset_47| Int)) (let ((.cse18 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse5 0) .cse9 0)))) (let ((.cse21 (store (select .cse18 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (let ((.cse19 (store .cse21 .cse0 |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (or (< .cse1 |v_ULTIMATE.start_create_item_~cursor#1.offset_47|) (= (select (select (store .cse18 |c_~#list~0.base| .cse19) (select .cse19 .cse1)) .cse5) 0) (forall ((v_ArrVal_713 Int) (v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse9) 0)) (not (= (select (select (let ((.cse20 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_31| v_arrayElimArr_9))) (store .cse20 |c_~#list~0.base| (store (select .cse20 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| v_ArrVal_713))) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse5) 0)))) (not (= (select (select (store .cse18 |c_~#list~0.base| .cse21) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse5) 0)) (= (select .cse19 .cse8) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) 0)))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) 0)) (forall ((|v_ULTIMATE.start_create_item_~cursor#1.offset_47| Int)) (let ((.cse23 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse9 0) .cse5 0)))) (let ((.cse24 (store (select .cse23 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (let ((.cse25 (store .cse24 .cse0 |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (or (forall ((v_ArrVal_713 Int) (v_arrayElimArr_9 (Array Int Int))) (or (not (= (select (select (let ((.cse22 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_31| v_arrayElimArr_9))) (store .cse22 |c_~#list~0.base| (store (select .cse22 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| v_ArrVal_713))) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse5) 0)) (not (= 0 (select v_arrayElimArr_9 .cse5))))) (< .cse0 |v_ULTIMATE.start_create_item_~cursor#1.offset_47|) (not (= (select (select (store .cse23 |c_~#list~0.base| .cse24) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse5) 0)) (= (select (select (store .cse23 |c_~#list~0.base| .cse25) (select .cse25 .cse1)) .cse5) 0) (= (select .cse25 .cse8) 0)))))))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) 0)) (forall ((|v_ULTIMATE.start_create_item_~cursor#1.offset_47| Int)) (let ((.cse26 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse9 0) .cse5 0)))) (let ((.cse27 (store (select .cse26 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (or (< .cse0 |v_ULTIMATE.start_create_item_~cursor#1.offset_47|) (not (= (select (select (store .cse26 |c_~#list~0.base| .cse27) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse5) 0)) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_717 Int) (v_ArrVal_713 Int)) (let ((.cse28 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_31| v_arrayElimArr_8))) (let ((.cse29 (store (select .cse28 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| v_ArrVal_713))) (let ((.cse30 (store .cse29 .cse0 v_ArrVal_717))) (or (not (= (select v_arrayElimArr_8 .cse5) 0)) (not (= (select (select (store .cse28 |c_~#list~0.base| .cse29) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse5) 0)) (= (select (select (store .cse28 |c_~#list~0.base| .cse30) (select (store .cse27 .cse0 |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse1)) .cse5) 0) (= (select .cse30 .cse8) 0)))))))))))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) 0)) (forall ((|v_ULTIMATE.start_create_item_~cursor#1.offset_47| Int)) (or (< .cse0 |v_ULTIMATE.start_create_item_~cursor#1.offset_47|) (not (= (select (select (let ((.cse31 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse9 0) .cse5 0)))) (store .cse31 |c_~#list~0.base| (store (select .cse31 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse5) 0)) (forall ((v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_717 Int) (v_ArrVal_713 Int)) (let ((.cse32 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_31| v_arrayElimArr_3))) (let ((.cse33 (store (select .cse32 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| v_ArrVal_713))) (let ((.cse34 (store .cse33 .cse0 v_ArrVal_717))) (or (not (= (select (select (store .cse32 |c_~#list~0.base| .cse33) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse5) 0)) (not (= (select v_arrayElimArr_3 .cse5) 0)) (= (select .cse34 .cse8) 0) (= (select (select (store .cse32 |c_~#list~0.base| .cse34) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse9) 0)))))))))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_31| Int)) (or (forall ((|v_ULTIMATE.start_create_item_~cursor#1.offset_47| Int)) (let ((.cse36 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse5 0) .cse9 0)))) (let ((.cse37 (store (select .cse36 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (let ((.cse38 (store .cse37 .cse0 |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (or (< .cse1 |v_ULTIMATE.start_create_item_~cursor#1.offset_47|) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_713 Int)) (or (not (= 0 (select (select (let ((.cse35 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_31| v_arrayElimArr_5))) (store .cse35 |c_~#list~0.base| (store (select .cse35 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| v_ArrVal_713))) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse5))) (not (= (select v_arrayElimArr_5 .cse9) 0)))) (not (= (select (select (store .cse36 |c_~#list~0.base| .cse37) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse5) 0)) (= (select .cse38 .cse8) 0) (= (select (select (store .cse36 |c_~#list~0.base| .cse38) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse9) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) 0)))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) 0)) (forall ((|v_ULTIMATE.start_create_item_~cursor#1.offset_47| Int)) (let ((.cse42 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse5 0) .cse9 0)))) (let ((.cse43 (store (select .cse42 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (let ((.cse41 (store .cse43 .cse0 |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (or (< .cse1 |v_ULTIMATE.start_create_item_~cursor#1.offset_47|) (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_717 Int) (v_ArrVal_713 Int)) (let ((.cse39 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_31| v_arrayElimArr_7))) (let ((.cse40 (store (select .cse39 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| v_ArrVal_713))) (or (not (= (select v_arrayElimArr_7 .cse9) 0)) (= (select (select (store .cse39 |c_~#list~0.base| (store .cse40 .cse0 v_ArrVal_717)) (select .cse41 .cse1)) .cse5) 0) (not (= (select (select (store .cse39 |c_~#list~0.base| .cse40) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse5) 0)))))) (not (= (select (select (store .cse42 |c_~#list~0.base| .cse43) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse5) 0)) (= (select .cse41 .cse8) 0)))))))) (forall ((|v_ULTIMATE.start_create_item_~cursor#1.offset_47| Int) (|v_ULTIMATE.start_create_item_~item~0#1.base_31| Int)) (let ((.cse44 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse9 0) .cse5 0)))) (let ((.cse45 (store (select .cse44 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (let ((.cse46 (store .cse45 .cse0 |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (or (< .cse0 |v_ULTIMATE.start_create_item_~cursor#1.offset_47|) (not (= (select (select (store .cse44 |c_~#list~0.base| .cse45) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse5) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) 0)) (= (select (select (store .cse44 |c_~#list~0.base| .cse46) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse9) 0) (= (select .cse46 .cse8) 0)))))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) 0)) (forall ((|v_ULTIMATE.start_create_item_~cursor#1.offset_47| Int)) (or (< .cse1 |v_ULTIMATE.start_create_item_~cursor#1.offset_47|) (forall ((v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_717 Int) (v_ArrVal_713 Int)) (let ((.cse47 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_31| v_arrayElimArr_3))) (let ((.cse48 (store (select .cse47 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| v_ArrVal_713))) (let ((.cse49 (store .cse48 .cse0 v_ArrVal_717))) (or (not (= (select (select (store .cse47 |c_~#list~0.base| .cse48) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse5) 0)) (not (= (select v_arrayElimArr_3 .cse9) 0)) (= (select .cse49 .cse8) 0) (= (select (select (store .cse47 |c_~#list~0.base| .cse49) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse9) 0)))))) (not (= (select (select (let ((.cse50 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse5 0) .cse9 0)))) (store .cse50 |c_~#list~0.base| (store (select .cse50 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse5) 0)))))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_31| Int)) (or (forall ((|v_ULTIMATE.start_create_item_~cursor#1.offset_47| Int)) (let ((.cse55 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse5 0) .cse9 0)))) (let ((.cse54 (store (select .cse55 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (or (< .cse1 |v_ULTIMATE.start_create_item_~cursor#1.offset_47|) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_717 Int) (v_ArrVal_713 Int)) (let ((.cse51 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_31| v_arrayElimArr_8))) (let ((.cse52 (store (select .cse51 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| v_ArrVal_713))) (let ((.cse53 (store .cse52 .cse0 v_ArrVal_717))) (or (not (= (select (select (store .cse51 |c_~#list~0.base| .cse52) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse5) 0)) (= (select .cse53 .cse8) 0) (= (select (select (store .cse51 |c_~#list~0.base| .cse53) (select (store .cse54 .cse0 |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse1)) .cse5) 0) (not (= (select v_arrayElimArr_8 .cse9) 0))))))) (not (= (select (select (store .cse55 |c_~#list~0.base| .cse54) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse5) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) 0)))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_31| Int)) (or (forall ((|v_ULTIMATE.start_create_item_~cursor#1.offset_47| Int)) (let ((.cse56 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse9 0) .cse5 0)))) (let ((.cse57 (store (select .cse56 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (let ((.cse58 (store .cse57 .cse0 |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (or (< .cse0 |v_ULTIMATE.start_create_item_~cursor#1.offset_47|) (not (= (select (select (store .cse56 |c_~#list~0.base| .cse57) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse5) 0)) (= (select .cse58 .cse8) 0) (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_717 Int) (v_ArrVal_713 Int)) (let ((.cse59 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_31| v_arrayElimArr_7))) (let ((.cse60 (store (select .cse59 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| v_ArrVal_713))) (or (= (select (select (store .cse59 |c_~#list~0.base| (store .cse60 .cse0 v_ArrVal_717)) (select .cse58 .cse1)) .cse5) 0) (not (= (select (select (store .cse59 |c_~#list~0.base| .cse60) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse5) 0)) (not (= (select v_arrayElimArr_7 .cse5) 0))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) 0)))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) 0)) (forall ((|v_ULTIMATE.start_create_item_~cursor#1.offset_47| Int)) (let ((.cse61 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse9 0) .cse5 0)))) (let ((.cse62 (store (select .cse61 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (or (< .cse0 |v_ULTIMATE.start_create_item_~cursor#1.offset_47|) (not (= (select (select (store .cse61 |c_~#list~0.base| .cse62) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse5) 0)) (= (select (let ((.cse63 (store .cse62 .cse0 |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (select (store .cse61 |c_~#list~0.base| .cse63) (select .cse63 .cse1))) .cse5) 0) (forall ((v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_717 Int) (v_ArrVal_713 Int)) (let ((.cse64 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_31| v_arrayElimArr_10))) (let ((.cse65 (store (select .cse64 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| v_ArrVal_713))) (or (not (= (select (select (store .cse64 |c_~#list~0.base| .cse65) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse5) 0)) (= (select (store .cse65 .cse0 v_ArrVal_717) .cse8) 0) (not (= (select v_arrayElimArr_10 .cse5) 0)))))))))))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) 0)) (forall ((|v_ULTIMATE.start_create_item_~cursor#1.offset_47| Int)) (let ((.cse66 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse9 0) .cse5 0)))) (let ((.cse67 (store (select .cse66 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (or (< .cse0 |v_ULTIMATE.start_create_item_~cursor#1.offset_47|) (not (= (select (select (store .cse66 |c_~#list~0.base| .cse67) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse5) 0)) (= (select (store .cse67 .cse0 |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse8) 0) (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_717 Int) (v_ArrVal_713 Int)) (let ((.cse68 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_31| v_arrayElimArr_4))) (let ((.cse69 (store (select .cse68 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| v_ArrVal_713))) (or (= (select (select (store .cse68 |c_~#list~0.base| (store .cse69 .cse0 v_ArrVal_717)) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse9) 0) (not (= (select (select (store .cse68 |c_~#list~0.base| .cse69) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse5) 0)) (not (= (select v_arrayElimArr_4 .cse5) 0)))))))))))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_31| Int)) (or (forall ((|v_ULTIMATE.start_create_item_~cursor#1.offset_47| Int)) (let ((.cse70 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse9 0) .cse5 0)))) (let ((.cse71 (store (select .cse70 |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| |v_ULTIMATE.start_create_item_~item~0#1.base_31|))) (or (< .cse0 |v_ULTIMATE.start_create_item_~cursor#1.offset_47|) (not (= (select (select (store .cse70 |c_~#list~0.base| .cse71) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse5) 0)) (= (select (select (store .cse70 |c_~#list~0.base| (store .cse71 .cse0 |v_ULTIMATE.start_create_item_~item~0#1.base_31|)) |v_ULTIMATE.start_create_item_~item~0#1.base_31|) .cse9) 0) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_717 Int) (v_ArrVal_713 Int)) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (= (select (store (store (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_31| v_arrayElimArr_6) |c_~#list~0.base|) |v_ULTIMATE.start_create_item_~cursor#1.offset_47| v_ArrVal_713) .cse0 v_ArrVal_717) .cse8) 0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_31|) 0))))))))) is different from true [2022-12-14 15:37:10,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152816494] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:37:10,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [407992685] [2022-12-14 15:37:10,449 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-12-14 15:37:10,450 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:37:10,450 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:37:10,450 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:37:10,450 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:37:10,613 INFO L321 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2022-12-14 15:37:10,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 214 treesize of output 216 [2022-12-14 15:37:10,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:10,795 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:37:10,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:10,841 INFO L321 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2022-12-14 15:37:10,841 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 4 case distinctions, treesize of input 253 treesize of output 244 [2022-12-14 15:37:10,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:10,878 INFO L321 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-12-14 15:37:10,878 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 1 case distinctions, treesize of input 247 treesize of output 222 [2022-12-14 15:37:10,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:10,892 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:37:10,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:10,936 INFO L321 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2022-12-14 15:37:10,936 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 4 case distinctions, treesize of input 253 treesize of output 244 [2022-12-14 15:37:11,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:11,045 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:37:11,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:11,121 INFO L321 Elim1Store]: treesize reduction 189, result has 12.9 percent of original size [2022-12-14 15:37:11,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 257 treesize of output 248 [2022-12-14 15:37:11,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:11,161 INFO L321 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-12-14 15:37:11,161 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 1 case distinctions, treesize of input 247 treesize of output 222 [2022-12-14 15:37:11,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:11,181 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:37:11,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:11,248 INFO L321 Elim1Store]: treesize reduction 189, result has 12.9 percent of original size [2022-12-14 15:37:11,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 264 treesize of output 251 [2022-12-14 15:37:11,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:11,338 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:37:11,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:11,404 INFO L321 Elim1Store]: treesize reduction 154, result has 15.4 percent of original size [2022-12-14 15:37:11,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 257 treesize of output 255 [2022-12-14 15:37:11,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:11,429 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:37:11,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:11,502 INFO L321 Elim1Store]: treesize reduction 144, result has 20.9 percent of original size [2022-12-14 15:37:11,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 257 treesize of output 265 [2022-12-14 15:37:11,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:11,518 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 219 treesize of output 202 [2022-12-14 15:37:11,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:11,835 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 671 treesize of output 614 [2022-12-14 15:37:11,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:11,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:11,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:11,869 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:37:11,871 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:37:11,883 INFO L321 Elim1Store]: treesize reduction 85, result has 1.2 percent of original size [2022-12-14 15:37:11,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 703 treesize of output 649 [2022-12-14 15:37:11,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:11,914 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:37:11,916 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:37:11,921 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:37:11,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:12,003 INFO L321 Elim1Store]: treesize reduction 278, result has 12.9 percent of original size [2022-12-14 15:37:12,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 679 treesize of output 652 [2022-12-14 15:37:13,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 15:37:13,451 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 9 [2022-12-14 15:37:13,588 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-14 15:37:13,589 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 22 [2022-12-14 15:37:13,599 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 23 treesize of output 1 [2022-12-14 15:37:13,629 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-14 15:37:13,629 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 22 [2022-12-14 15:37:13,694 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-12-14 15:37:13,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-12-14 15:37:13,749 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-12-14 15:37:13,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-12-14 15:37:13,761 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 23 treesize of output 1 [2022-12-14 15:37:13,836 INFO L321 Elim1Store]: treesize reduction 116, result has 16.5 percent of original size [2022-12-14 15:37:13,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 39 [2022-12-14 15:37:13,921 INFO L321 Elim1Store]: treesize reduction 92, result has 33.8 percent of original size [2022-12-14 15:37:13,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 63 [2022-12-14 15:37:13,940 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-12-14 15:37:14,015 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:37:14,020 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:37:14,082 INFO L321 Elim1Store]: treesize reduction 224, result has 15.5 percent of original size [2022-12-14 15:37:14,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 64 [2022-12-14 15:37:14,098 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 23 treesize of output 1 [2022-12-14 15:37:14,119 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:37:14,123 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:37:14,225 INFO L321 Elim1Store]: treesize reduction 183, result has 30.9 percent of original size [2022-12-14 15:37:14,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 129 [2022-12-14 15:37:14,862 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 9 [2022-12-14 15:37:14,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 15:37:14,985 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-14 15:37:14,986 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 22 [2022-12-14 15:37:14,996 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 23 treesize of output 1 [2022-12-14 15:37:15,024 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-14 15:37:15,024 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 22 [2022-12-14 15:37:15,096 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-12-14 15:37:15,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-12-14 15:37:15,115 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 23 treesize of output 1 [2022-12-14 15:37:15,177 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-12-14 15:37:15,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-12-14 15:37:15,313 INFO L321 Elim1Store]: treesize reduction 92, result has 33.8 percent of original size [2022-12-14 15:37:15,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 63 [2022-12-14 15:37:15,335 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-12-14 15:37:15,400 INFO L321 Elim1Store]: treesize reduction 116, result has 16.5 percent of original size [2022-12-14 15:37:15,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 39 [2022-12-14 15:37:15,474 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 23 treesize of output 1 [2022-12-14 15:37:15,494 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:37:15,499 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:37:15,559 INFO L321 Elim1Store]: treesize reduction 224, result has 15.5 percent of original size [2022-12-14 15:37:15,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 64 [2022-12-14 15:37:15,593 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:37:15,601 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:37:15,738 INFO L321 Elim1Store]: treesize reduction 183, result has 30.9 percent of original size [2022-12-14 15:37:15,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 129 [2022-12-14 15:37:16,289 INFO L321 Elim1Store]: treesize reduction 35, result has 32.7 percent of original size [2022-12-14 15:37:16,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 37 [2022-12-14 15:37:16,315 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 9 [2022-12-14 15:37:16,383 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 9 [2022-12-14 15:37:16,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 15:37:16,486 INFO L197 IcfgInterpreter]: Interpreting procedure rand_end_point with input of size 17 for LOIs [2022-12-14 15:37:16,492 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:37:33,500 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '26933#(and (<= |~#list~0.base| 3) (<= 0 |#NULL.base|) (or (not (= |ULTIMATE.start_main_~cursor~1#1.offset| 0)) (not (= |ULTIMATE.start_main_~cursor~1#1.base| 0))) (<= |#NULL.offset| 0) (<= |#NULL.base| 0) (<= 0 |~#list~0.offset|) (<= 3 |~#list~0.base|) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (not (= (select |#valid| |ULTIMATE.start_main_~cursor~1#1.base|) 1)) (<= |~#list~0.offset| 0))' at error location [2022-12-14 15:37:33,500 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 15:37:33,500 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 15:37:33,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 37 [2022-12-14 15:37:33,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993359474] [2022-12-14 15:37:33,501 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 15:37:33,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-14 15:37:33,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:37:33,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-14 15:37:33,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=5381, Unknown=3, NotChecked=298, Total=6006 [2022-12-14 15:37:33,506 INFO L87 Difference]: Start difference. First operand 444 states and 595 transitions. Second operand has 37 states, 35 states have (on average 2.057142857142857) internal successors, (72), 34 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 15:37:46,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:37:46,356 INFO L93 Difference]: Finished difference Result 578 states and 753 transitions. [2022-12-14 15:37:46,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-14 15:37:46,356 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 2.057142857142857) internal successors, (72), 34 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2022-12-14 15:37:46,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:37:46,358 INFO L225 Difference]: With dead ends: 578 [2022-12-14 15:37:46,358 INFO L226 Difference]: Without dead ends: 578 [2022-12-14 15:37:46,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2674 ImplicationChecksByTransitivity, 45.9s TimeCoverageRelationStatistics Valid=774, Invalid=8543, Unknown=3, NotChecked=382, Total=9702 [2022-12-14 15:37:46,360 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 779 mSDsluCounter, 1984 mSDsCounter, 0 mSdLazyCounter, 1606 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 2086 SdHoareTripleChecker+Invalid, 1670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:37:46,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 2086 Invalid, 1670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1606 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-12-14 15:37:46,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2022-12-14 15:37:46,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 505. [2022-12-14 15:37:46,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 432 states have (on average 1.4652777777777777) internal successors, (633), 476 states have internal predecessors, (633), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (24), 16 states have call predecessors, (24), 24 states have call successors, (24) [2022-12-14 15:37:46,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 681 transitions. [2022-12-14 15:37:46,369 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 681 transitions. Word has length 40 [2022-12-14 15:37:46,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:37:46,369 INFO L495 AbstractCegarLoop]: Abstraction has 505 states and 681 transitions. [2022-12-14 15:37:46,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 2.057142857142857) internal successors, (72), 34 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 15:37:46,369 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 681 transitions. [2022-12-14 15:37:46,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 15:37:46,370 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:37:46,370 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:37:46,375 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-14 15:37:46,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-12-14 15:37:46,571 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:37:46,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:37:46,573 INFO L85 PathProgramCache]: Analyzing trace with hash 403770357, now seen corresponding path program 1 times [2022-12-14 15:37:46,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:37:46,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401256856] [2022-12-14 15:37:46,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:37:46,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:37:46,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:37:48,170 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:37:48,170 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:37:48,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401256856] [2022-12-14 15:37:48,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401256856] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:37:48,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783038968] [2022-12-14 15:37:48,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:37:48,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:37:48,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:37:48,172 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:37:48,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 15:37:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:37:48,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-14 15:37:48,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:37:48,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:48,569 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-12-14 15:37:48,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:48,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 15:37:48,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:48,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 15:37:49,084 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-14 15:37:49,085 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 21 treesize of output 26 [2022-12-14 15:37:49,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:49,327 INFO L321 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2022-12-14 15:37:49,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 47 [2022-12-14 15:37:49,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:49,809 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:37:49,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 44 [2022-12-14 15:37:49,818 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 15 treesize of output 11 [2022-12-14 15:37:50,282 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:37:50,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:37:50,445 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~end_point~0#1| Int)) (let ((.cse0 (* |ULTIMATE.start_main_~end_point~0#1| 4))) (let ((.cse1 (+ |c_~#list~0.offset| .cse0))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_~#list~0.base|) .cse1))) (or (not (<= (+ |c_~#list~0.offset| .cse0 4) (select |c_#length| |c_~#list~0.base|))) (not (<= 0 .cse1)) (= .cse2 0) (= |c_ULTIMATE.start_main_old_#valid#1| (store |c_#valid| .cse2 0))))))) is different from false [2022-12-14 15:37:50,625 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~end_point~0#1| Int)) (let ((.cse1 (* |ULTIMATE.start_main_~end_point~0#1| 4))) (let ((.cse2 (+ |c_~#list~0.offset| .cse1))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base|) (+ |c_ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4)) |c_ULTIMATE.start_append_one_~item~1#1.base|)) |c_~#list~0.base|) .cse2))) (or (= .cse0 0) (= (store |c_#valid| .cse0 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (<= (+ |c_~#list~0.offset| .cse1 4) (select |c_#length| |c_~#list~0.base|))) (not (<= 0 .cse2))))))) is different from false [2022-12-14 15:37:50,683 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_create_item_~cursor#1.offset| Int) (|ULTIMATE.start_main_~end_point~0#1| Int)) (let ((.cse1 (* |ULTIMATE.start_main_~end_point~0#1| 4))) (let ((.cse2 (+ |c_~#list~0.offset| .cse1))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~cursor#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset| |c_ULTIMATE.start_create_item_~item~0#1.base|)))) (store .cse3 |c_ULTIMATE.start_append_one_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_append_one_~list#1.base|) (+ |c_ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4)) |c_ULTIMATE.start_create_item_~item~0#1.base|))) |c_~#list~0.base|) .cse2))) (or (= .cse0 0) (= |c_ULTIMATE.start_main_old_#valid#1| (store |c_#valid| .cse0 0)) (not (<= (+ |c_~#list~0.offset| .cse1 4) (select |c_#length| |c_~#list~0.base|))) (not (<= 0 .cse2))))))) is different from false [2022-12-14 15:37:50,731 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_create_item_~cursor#1.offset| Int) (v_ArrVal_778 (Array Int Int)) (|ULTIMATE.start_main_~end_point~0#1| Int)) (let ((.cse1 (* |ULTIMATE.start_main_~end_point~0#1| 4))) (let ((.cse2 (+ |c_~#list~0.offset| .cse1))) (let ((.cse0 (select (select (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_778))) (store .cse4 |c_ULTIMATE.start_create_item_~cursor#1.base| (store (select .cse4 |c_ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset| |c_ULTIMATE.start_create_item_~item~0#1.base|))))) (store .cse3 |c_ULTIMATE.start_append_one_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_append_one_~list#1.base|) (+ |c_ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4)) |c_ULTIMATE.start_create_item_~item~0#1.base|))) |c_~#list~0.base|) .cse2))) (or (= (store |c_#valid| .cse0 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (<= (+ |c_~#list~0.offset| .cse1 4) (select |c_#length| |c_~#list~0.base|))) (= .cse0 0) (not (<= 0 .cse2))))))) is different from false [2022-12-14 15:37:51,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783038968] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:37:51,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [729917342] [2022-12-14 15:37:51,028 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2022-12-14 15:37:51,028 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:37:51,028 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:37:51,028 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:37:51,029 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:37:51,195 INFO L321 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2022-12-14 15:37:51,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 214 treesize of output 216 [2022-12-14 15:37:51,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:51,357 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:37:51,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:51,413 INFO L321 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2022-12-14 15:37:51,414 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 4 case distinctions, treesize of input 253 treesize of output 244 [2022-12-14 15:37:51,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:51,432 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:37:51,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:51,479 INFO L321 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2022-12-14 15:37:51,479 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 4 case distinctions, treesize of input 253 treesize of output 244 [2022-12-14 15:37:51,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:51,522 INFO L321 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-12-14 15:37:51,522 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 1 case distinctions, treesize of input 247 treesize of output 222 [2022-12-14 15:37:51,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:51,607 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:37:51,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:51,685 INFO L321 Elim1Store]: treesize reduction 189, result has 12.9 percent of original size [2022-12-14 15:37:51,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 257 treesize of output 248 [2022-12-14 15:37:51,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:51,710 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:37:51,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:51,785 INFO L321 Elim1Store]: treesize reduction 189, result has 12.9 percent of original size [2022-12-14 15:37:51,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 264 treesize of output 251 [2022-12-14 15:37:51,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:51,829 INFO L321 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-12-14 15:37:51,829 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 1 case distinctions, treesize of input 247 treesize of output 222 [2022-12-14 15:37:51,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:51,925 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:37:51,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:52,000 INFO L321 Elim1Store]: treesize reduction 154, result has 15.4 percent of original size [2022-12-14 15:37:52,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 257 treesize of output 255 [2022-12-14 15:37:52,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:52,021 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 239 treesize of output 222 [2022-12-14 15:37:52,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:52,045 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:37:52,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:52,130 INFO L321 Elim1Store]: treesize reduction 144, result has 20.9 percent of original size [2022-12-14 15:37:52,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 257 treesize of output 265 [2022-12-14 15:37:52,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:52,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:52,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:52,379 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:37:52,382 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:37:52,395 INFO L321 Elim1Store]: treesize reduction 85, result has 1.2 percent of original size [2022-12-14 15:37:52,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 498 treesize of output 464 [2022-12-14 15:37:52,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:52,430 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:37:52,433 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:37:52,439 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:37:52,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:52,530 INFO L321 Elim1Store]: treesize reduction 281, result has 11.9 percent of original size [2022-12-14 15:37:52,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 482 treesize of output 464 [2022-12-14 15:37:52,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:52,560 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 434 treesize of output 393 [2022-12-14 15:37:53,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 15:37:53,553 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 9 [2022-12-14 15:37:53,677 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-14 15:37:53,677 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 22 [2022-12-14 15:37:53,712 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-14 15:37:53,712 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 22 [2022-12-14 15:37:53,723 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 23 treesize of output 1 [2022-12-14 15:37:53,798 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-12-14 15:37:53,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-12-14 15:37:53,859 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-12-14 15:37:53,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-12-14 15:37:53,878 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 23 treesize of output 1 [2022-12-14 15:37:53,995 INFO L321 Elim1Store]: treesize reduction 92, result has 33.8 percent of original size [2022-12-14 15:37:53,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 63 [2022-12-14 15:37:54,062 INFO L321 Elim1Store]: treesize reduction 116, result has 16.5 percent of original size [2022-12-14 15:37:54,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 39 [2022-12-14 15:37:54,080 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-12-14 15:37:54,157 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:37:54,162 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:37:54,227 INFO L321 Elim1Store]: treesize reduction 224, result has 15.5 percent of original size [2022-12-14 15:37:54,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 64 [2022-12-14 15:37:54,256 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:37:54,263 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:37:54,380 INFO L321 Elim1Store]: treesize reduction 183, result has 30.9 percent of original size [2022-12-14 15:37:54,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 129 [2022-12-14 15:37:54,408 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 23 treesize of output 1 [2022-12-14 15:37:55,046 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 9 [2022-12-14 15:37:55,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 15:37:55,183 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-14 15:37:55,183 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 22 [2022-12-14 15:37:55,215 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-14 15:37:55,216 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 22 [2022-12-14 15:37:55,226 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 23 treesize of output 1 [2022-12-14 15:37:55,302 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-12-14 15:37:55,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-12-14 15:37:55,319 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 23 treesize of output 1 [2022-12-14 15:37:55,376 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-12-14 15:37:55,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-12-14 15:37:55,498 INFO L321 Elim1Store]: treesize reduction 92, result has 33.8 percent of original size [2022-12-14 15:37:55,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 63 [2022-12-14 15:37:55,515 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-12-14 15:37:55,576 INFO L321 Elim1Store]: treesize reduction 116, result has 16.5 percent of original size [2022-12-14 15:37:55,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 39 [2022-12-14 15:37:55,671 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:37:55,676 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:37:55,804 INFO L321 Elim1Store]: treesize reduction 183, result has 30.9 percent of original size [2022-12-14 15:37:55,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 129 [2022-12-14 15:37:55,850 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:37:55,855 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:37:55,925 INFO L321 Elim1Store]: treesize reduction 224, result has 15.5 percent of original size [2022-12-14 15:37:55,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 64 [2022-12-14 15:37:55,943 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 23 treesize of output 1 [2022-12-14 15:37:56,421 INFO L321 Elim1Store]: treesize reduction 35, result has 32.7 percent of original size [2022-12-14 15:37:56,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 37 [2022-12-14 15:37:56,444 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 9 [2022-12-14 15:37:56,514 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 9 [2022-12-14 15:37:56,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 15:37:56,597 INFO L197 IcfgInterpreter]: Interpreting procedure rand_end_point with input of size 17 for LOIs [2022-12-14 15:37:56,603 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:38:05,588 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '28330#(and (<= |~#list~0.base| 3) (<= 0 |#NULL.base|) (= |ULTIMATE.start_main_~cursor~1#1.base| 0) (not (= |ULTIMATE.start_main_old_#valid#1| |#valid|)) (<= |#NULL.offset| 0) (= |ULTIMATE.start_main_~cursor~1#1.offset| 0) (<= |#NULL.base| 0) (<= 0 |~#list~0.offset|) (<= 3 |~#list~0.base|) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_main_#res#1| 0) (<= |~#list~0.offset| 0))' at error location [2022-12-14 15:38:05,588 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 15:38:05,588 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 15:38:05,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 21 [2022-12-14 15:38:05,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076313375] [2022-12-14 15:38:05,589 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 15:38:05,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-14 15:38:05,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:38:05,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-14 15:38:05,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2563, Unknown=4, NotChecked=420, Total=3192 [2022-12-14 15:38:05,590 INFO L87 Difference]: Start difference. First operand 505 states and 681 transitions. Second operand has 22 states, 21 states have (on average 3.619047619047619) internal successors, (76), 22 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 15:38:15,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:38:15,867 INFO L93 Difference]: Finished difference Result 552 states and 727 transitions. [2022-12-14 15:38:15,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-14 15:38:15,868 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.619047619047619) internal successors, (76), 22 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2022-12-14 15:38:15,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:38:15,870 INFO L225 Difference]: With dead ends: 552 [2022-12-14 15:38:15,870 INFO L226 Difference]: Without dead ends: 542 [2022-12-14 15:38:15,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1570 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=544, Invalid=5168, Unknown=4, NotChecked=604, Total=6320 [2022-12-14 15:38:15,871 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 541 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 1558 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 1626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:38:15,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 1086 Invalid, 1626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1558 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-12-14 15:38:15,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2022-12-14 15:38:15,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 504. [2022-12-14 15:38:15,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 431 states have (on average 1.4640371229698377) internal successors, (631), 475 states have internal predecessors, (631), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (24), 16 states have call predecessors, (24), 24 states have call successors, (24) [2022-12-14 15:38:15,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 679 transitions. [2022-12-14 15:38:15,880 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 679 transitions. Word has length 40 [2022-12-14 15:38:15,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:38:15,880 INFO L495 AbstractCegarLoop]: Abstraction has 504 states and 679 transitions. [2022-12-14 15:38:15,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.619047619047619) internal successors, (76), 22 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 15:38:15,881 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 679 transitions. [2022-12-14 15:38:15,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-14 15:38:15,881 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:38:15,881 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:38:15,887 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 15:38:16,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-14 15:38:16,082 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:38:16,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:38:16,082 INFO L85 PathProgramCache]: Analyzing trace with hash -2005166425, now seen corresponding path program 1 times [2022-12-14 15:38:16,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:38:16,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149538608] [2022-12-14 15:38:16,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:38:16,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:38:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:38:16,146 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 15:38:16,146 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:38:16,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149538608] [2022-12-14 15:38:16,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149538608] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:38:16,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:38:16,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:38:16,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062758132] [2022-12-14 15:38:16,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:38:16,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 15:38:16,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:38:16,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 15:38:16,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:38:16,148 INFO L87 Difference]: Start difference. First operand 504 states and 679 transitions. Second operand has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:38:16,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:38:16,612 INFO L93 Difference]: Finished difference Result 728 states and 977 transitions. [2022-12-14 15:38:16,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 15:38:16,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-12-14 15:38:16,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:38:16,614 INFO L225 Difference]: With dead ends: 728 [2022-12-14 15:38:16,614 INFO L226 Difference]: Without dead ends: 728 [2022-12-14 15:38:16,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 15:38:16,615 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 95 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:38:16,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 407 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 15:38:16,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2022-12-14 15:38:16,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 502. [2022-12-14 15:38:16,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 431 states have (on average 1.4547563805104409) internal successors, (627), 473 states have internal predecessors, (627), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (24), 16 states have call predecessors, (24), 24 states have call successors, (24) [2022-12-14 15:38:16,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 675 transitions. [2022-12-14 15:38:16,622 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 675 transitions. Word has length 41 [2022-12-14 15:38:16,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:38:16,622 INFO L495 AbstractCegarLoop]: Abstraction has 502 states and 675 transitions. [2022-12-14 15:38:16,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:38:16,622 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 675 transitions. [2022-12-14 15:38:16,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-14 15:38:16,622 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:38:16,622 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:38:16,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-14 15:38:16,622 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:38:16,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:38:16,623 INFO L85 PathProgramCache]: Analyzing trace with hash -2005166424, now seen corresponding path program 1 times [2022-12-14 15:38:16,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:38:16,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705471619] [2022-12-14 15:38:16,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:38:16,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:38:16,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:38:19,241 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 15:38:19,242 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:38:19,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705471619] [2022-12-14 15:38:19,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705471619] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:38:19,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092060107] [2022-12-14 15:38:19,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:38:19,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:38:19,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:38:19,243 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:38:19,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 15:38:19,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:38:19,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 113 conjunts are in the unsatisfiable core [2022-12-14 15:38:19,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:38:19,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 15:38:19,610 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 15:38:19,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2022-12-14 15:38:20,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 15:38:20,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 15:38:20,211 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-12-14 15:38:20,240 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-14 15:38:20,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 26 [2022-12-14 15:38:20,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:38:20,749 INFO L321 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2022-12-14 15:38:20,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 86 [2022-12-14 15:38:20,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:38:20,790 INFO L321 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2022-12-14 15:38:20,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 100 [2022-12-14 15:38:22,221 INFO L321 Elim1Store]: treesize reduction 152, result has 27.6 percent of original size [2022-12-14 15:38:22,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 114 treesize of output 154 [2022-12-14 15:38:22,265 INFO L321 Elim1Store]: treesize reduction 30, result has 23.1 percent of original size [2022-12-14 15:38:22,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 97 treesize of output 106 [2022-12-14 15:38:23,481 INFO L321 Elim1Store]: treesize reduction 58, result has 56.4 percent of original size [2022-12-14 15:38:23,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 112 treesize of output 161 [2022-12-14 15:38:24,365 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:38:24,365 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 133 treesize of output 101 [2022-12-14 15:38:24,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:38:24,408 INFO L321 Elim1Store]: treesize reduction 26, result has 10.3 percent of original size [2022-12-14 15:38:24,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 75 [2022-12-14 15:38:24,794 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:38:24,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:38:26,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092060107] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:38:26,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1814736970] [2022-12-14 15:38:26,533 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-12-14 15:38:26,533 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:38:26,533 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:38:26,533 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:38:26,533 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:38:26,653 INFO L321 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2022-12-14 15:38:26,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 214 treesize of output 216 [2022-12-14 15:38:26,899 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-14 15:38:26,900 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 22 [2022-12-14 15:38:26,934 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-14 15:38:26,935 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 22 [2022-12-14 15:38:26,946 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 23 treesize of output 1 [2022-12-14 15:38:27,025 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-12-14 15:38:27,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-12-14 15:38:27,040 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 23 treesize of output 1 [2022-12-14 15:38:27,102 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-12-14 15:38:27,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-12-14 15:38:27,186 INFO L321 Elim1Store]: treesize reduction 116, result has 16.5 percent of original size [2022-12-14 15:38:27,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 39 [2022-12-14 15:38:27,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 15:38:27,319 INFO L321 Elim1Store]: treesize reduction 92, result has 33.8 percent of original size [2022-12-14 15:38:27,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 63 [2022-12-14 15:38:27,392 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:38:27,396 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:38:27,525 INFO L321 Elim1Store]: treesize reduction 183, result has 30.9 percent of original size [2022-12-14 15:38:27,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 129 [2022-12-14 15:38:27,568 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:38:27,575 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:38:27,667 INFO L321 Elim1Store]: treesize reduction 224, result has 15.5 percent of original size [2022-12-14 15:38:27,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 64 [2022-12-14 15:38:27,691 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 23 treesize of output 1 [2022-12-14 15:38:28,104 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 9 [2022-12-14 15:38:28,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 15:38:28,242 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 23 treesize of output 1 [2022-12-14 15:38:28,275 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-14 15:38:28,276 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 22 [2022-12-14 15:38:28,306 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-14 15:38:28,306 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 22 [2022-12-14 15:38:28,391 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-12-14 15:38:28,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-12-14 15:38:28,402 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 23 treesize of output 1 [2022-12-14 15:38:28,458 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-12-14 15:38:28,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-12-14 15:38:28,547 INFO L321 Elim1Store]: treesize reduction 116, result has 16.5 percent of original size [2022-12-14 15:38:28,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 39 [2022-12-14 15:38:28,654 INFO L321 Elim1Store]: treesize reduction 92, result has 33.8 percent of original size [2022-12-14 15:38:28,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 63 [2022-12-14 15:38:28,675 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-12-14 15:38:28,755 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:38:28,760 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:38:28,833 INFO L321 Elim1Store]: treesize reduction 224, result has 15.5 percent of original size [2022-12-14 15:38:28,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 64 [2022-12-14 15:38:28,866 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:38:28,870 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:38:28,983 INFO L321 Elim1Store]: treesize reduction 183, result has 30.9 percent of original size [2022-12-14 15:38:28,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 129 [2022-12-14 15:38:29,015 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 23 treesize of output 1 [2022-12-14 15:38:29,219 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 9 [2022-12-14 15:38:29,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 15:38:29,372 INFO L197 IcfgInterpreter]: Interpreting procedure rand_end_point with input of size 17 for LOIs [2022-12-14 15:38:29,380 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:38:39,719 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '30893#(and (<= |ULTIMATE.start_create_item_#in~cursor#1.offset| 8589934588) (<= 0 (+ |ULTIMATE.start_create_item_~item~0#1.offset| (* 4 |ULTIMATE.start_create_item_~link_field~0#1|))) (<= 3 |ULTIMATE.start_create_item_#in~cursor#1.base|) (<= 3 |ULTIMATE.start_create_item_~cursor#1.base|) (<= (+ |ULTIMATE.start_create_item_~cursor#1.offset| 4) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)) (<= |ULTIMATE.start_main_#t~ret30#1| 2147483647) (= |ULTIMATE.start_create_item_~link~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~item~0#1.base|) (+ |ULTIMATE.start_create_item_~item~0#1.offset| (* 4 |ULTIMATE.start_create_item_~link_field~0#1|)))) (<= |ULTIMATE.start_append_one_#in~to#1| 2147483647) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~item~0#1.base|) (+ |ULTIMATE.start_create_item_~item~0#1.offset| (* 4 |ULTIMATE.start_create_item_~link_field~0#1|))) |ULTIMATE.start_create_item_~link~0#1.offset|) (<= |ULTIMATE.start_create_item_#in~at#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_#t~ret30#1| 2147483648)) (<= |ULTIMATE.start_append_one_~to#1| 2147483647) (<= |ULTIMATE.start_append_one_~list#1.base| 3) (<= (+ |ULTIMATE.start_create_item_~item~0#1.offset| (* 4 |ULTIMATE.start_create_item_~link_field~0#1|) 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (<= 0 |ULTIMATE.start_append_one_~cursor~0#1.offset|) (<= |ULTIMATE.start_append_one_#in~list#1.offset| 0) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (= (select |#valid| |ULTIMATE.start_create_item_~cursor#1.base|) 1) (<= 3 |ULTIMATE.start_append_one_~cursor~0#1.base|) (<= |ULTIMATE.start_create_item_~cursor#1.base| 3) (= 3 |~#list~0.base|) (<= 0 (+ 2147483648 |ULTIMATE.start_append_one_~to#1|)) (<= 0 |ULTIMATE.start_create_item_~cursor#1.offset|) (= |ULTIMATE.start_create_item_~link~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|)) (<= |ULTIMATE.start_append_one_~cursor~0#1.base| 3) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (or (not (= |ULTIMATE.start_create_item_~link~0#1.offset| 0)) (not (= |ULTIMATE.start_create_item_~link~0#1.base| 0))) (<= |ULTIMATE.start_create_item_~at#1| 2147483647) (<= 0 (+ |ULTIMATE.start_append_one_#in~to#1| 2147483648)) (<= 0 |ULTIMATE.start_append_one_#in~list#1.offset|) (<= 3 |ULTIMATE.start_append_one_~list#1.base|) (or (not (<= (+ |ULTIMATE.start_create_item_~link~0#1.offset| (* |ULTIMATE.start_create_item_~term_field~0#1| 4) 4) (select |#length| |ULTIMATE.start_create_item_~link~0#1.base|))) (not (<= 0 (+ |ULTIMATE.start_create_item_~link~0#1.offset| (* |ULTIMATE.start_create_item_~term_field~0#1| 4))))) (<= 0 (+ |ULTIMATE.start_create_item_~at#1| 2147483648)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) |ULTIMATE.start_create_item_~link~0#1.offset|) (<= |ULTIMATE.start_append_one_~cursor~0#1.offset| 8589934588) (<= |ULTIMATE.start_create_item_#in~cursor#1.base| 3) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_create_item_#in~cursor#1.offset|) (<= 0 (+ |ULTIMATE.start_create_item_#in~at#1| 2147483648)) (= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|)) (<= |ULTIMATE.start_create_item_~cursor#1.offset| 8589934588) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_append_one_#in~list#1.base| 3) (= |#NULL.base| 0) (<= 3 |ULTIMATE.start_append_one_#in~list#1.base|))' at error location [2022-12-14 15:38:39,719 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 15:38:39,719 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 15:38:39,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 28 [2022-12-14 15:38:39,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286330532] [2022-12-14 15:38:39,719 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 15:38:39,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-14 15:38:39,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:38:39,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-14 15:38:39,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=3383, Unknown=0, NotChecked=0, Total=3660 [2022-12-14 15:38:39,720 INFO L87 Difference]: Start difference. First operand 502 states and 675 transitions. Second operand has 29 states, 26 states have (on average 2.8461538461538463) internal successors, (74), 27 states have internal predecessors, (74), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-14 15:38:58,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:38:58,983 INFO L93 Difference]: Finished difference Result 837 states and 1068 transitions. [2022-12-14 15:38:58,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-14 15:38:58,984 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 2.8461538461538463) internal successors, (74), 27 states have internal predecessors, (74), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 41 [2022-12-14 15:38:58,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:38:58,985 INFO L225 Difference]: With dead ends: 837 [2022-12-14 15:38:58,985 INFO L226 Difference]: Without dead ends: 837 [2022-12-14 15:38:58,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1948 ImplicationChecksByTransitivity, 26.3s TimeCoverageRelationStatistics Valid=769, Invalid=6884, Unknown=3, NotChecked=0, Total=7656 [2022-12-14 15:38:58,986 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 1406 mSDsluCounter, 2373 mSDsCounter, 0 mSdLazyCounter, 3129 mSolverCounterSat, 135 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1406 SdHoareTripleChecker+Valid, 2537 SdHoareTripleChecker+Invalid, 3265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 3129 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:38:58,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1406 Valid, 2537 Invalid, 3265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 3129 Invalid, 1 Unknown, 0 Unchecked, 7.2s Time] [2022-12-14 15:38:58,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2022-12-14 15:38:58,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 516. [2022-12-14 15:38:58,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 445 states have (on average 1.4449438202247191) internal successors, (643), 486 states have internal predecessors, (643), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (24), 17 states have call predecessors, (24), 24 states have call successors, (24) [2022-12-14 15:38:58,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 691 transitions. [2022-12-14 15:38:58,992 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 691 transitions. Word has length 41 [2022-12-14 15:38:58,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:38:58,993 INFO L495 AbstractCegarLoop]: Abstraction has 516 states and 691 transitions. [2022-12-14 15:38:58,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 2.8461538461538463) internal successors, (74), 27 states have internal predecessors, (74), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-14 15:38:58,993 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 691 transitions. [2022-12-14 15:38:58,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 15:38:58,993 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:38:58,993 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:38:58,998 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 15:38:59,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-14 15:38:59,195 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:38:59,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:38:59,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1968809569, now seen corresponding path program 1 times [2022-12-14 15:38:59,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:38:59,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266179147] [2022-12-14 15:38:59,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:38:59,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:38:59,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:39:03,428 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 15:39:03,428 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:39:03,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266179147] [2022-12-14 15:39:03,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266179147] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:39:03,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462407106] [2022-12-14 15:39:03,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:39:03,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:39:03,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:39:03,430 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:39:03,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 15:39:03,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:39:03,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 152 conjunts are in the unsatisfiable core [2022-12-14 15:39:03,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:39:03,859 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 15:39:03,860 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 11 treesize of output 11 [2022-12-14 15:39:04,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 15:39:04,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 15:39:04,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-12-14 15:39:04,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-12-14 15:39:05,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:39:05,185 INFO L321 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2022-12-14 15:39:05,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 124 [2022-12-14 15:39:05,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:39:05,227 INFO L321 Elim1Store]: treesize reduction 46, result has 30.3 percent of original size [2022-12-14 15:39:05,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 135 [2022-12-14 15:39:06,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:39:06,467 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:39:06,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:39:06,492 INFO L321 Elim1Store]: treesize reduction 47, result has 34.7 percent of original size [2022-12-14 15:39:06,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 121 [2022-12-14 15:39:06,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:39:06,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:39:06,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:39:06,532 INFO L321 Elim1Store]: treesize reduction 42, result has 37.3 percent of original size [2022-12-14 15:39:06,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 157 treesize of output 177 [2022-12-14 15:39:09,008 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:39:09,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:39:14,095 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:39:14,095 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 1079 treesize of output 893 [2022-12-14 15:39:14,109 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:39:14,110 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 897 treesize of output 711 [2022-12-14 15:39:53,114 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2022-12-14 15:39:53,114 WARN L230 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-12-14 15:39:53,114 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2022-12-14 15:39:53,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1384775410] [2022-12-14 15:39:53,115 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-12-14 15:39:53,116 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:39:53,116 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:39:53,116 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:39:53,116 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:39:53,121 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:314) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:158) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:132) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.checkSatTerm(SmtUtils.java:273) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.isFalse(SymbolicTools.java:221) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.RelationCheckUtil.isEqBottom_SolverAlphaSolver(RelationCheckUtil.java:56) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.ExplicitValueDomain.isEqBottom(ExplicitValueDomain.java:73) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.CompoundDomain.isEqBottom(CompoundDomain.java:84) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.StatsWrapperDomain.isEqBottom(StatsWrapperDomain.java:69) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.earlyExitAfterStep(DagInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:125) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:442) at java.base/java.io.OutputStream.write(OutputStream.java:157) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:156) ... 44 more [2022-12-14 15:39:53,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-12-14 15:39:53,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2022-12-14 15:39:53,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601945482] [2022-12-14 15:39:53,123 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-12-14 15:39:53,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 15:39:53,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:39:53,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 15:39:53,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=2825, Unknown=0, NotChecked=0, Total=3080 [2022-12-14 15:39:53,124 INFO L87 Difference]: Start difference. First operand 516 states and 691 transitions. Second operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 15:39:53,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=255, Invalid=2825, Unknown=0, NotChecked=0, Total=3080 [2022-12-14 15:39:53,125 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:39:53,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:39:53,130 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-14 15:39:53,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:39:53,326 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:314) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:158) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertCodeBlock(IncrementalHoareTripleChecker.java:436) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:278) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:284) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.releaseLock(ChainingHoareTripleChecker.java:449) at java.base/java.util.ArrayList$ArrayListSpliterator.forEachRemaining(ArrayList.java:1655) at java.base/java.util.stream.ReferencePipeline$Head.forEach(ReferencePipeline.java:658) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.releaseLock(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:365) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:442) at java.base/java.io.OutputStream.write(OutputStream.java:157) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:156) ... 36 more [2022-12-14 15:39:53,335 INFO L158 Benchmark]: Toolchain (without parser) took 316267.18ms. Allocated memory was 134.2MB in the beginning and 293.6MB in the end (delta: 159.4MB). Free memory was 94.9MB in the beginning and 93.2MB in the end (delta: 1.6MB). Peak memory consumption was 163.4MB. Max. memory is 16.1GB. [2022-12-14 15:39:53,335 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 134.2MB. Free memory was 100.7MB in the beginning and 100.5MB in the end (delta: 140.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 15:39:53,335 INFO L158 Benchmark]: CACSL2BoogieTranslator took 345.28ms. Allocated memory is still 134.2MB. Free memory was 94.9MB in the beginning and 73.5MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-12-14 15:39:53,336 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.31ms. Allocated memory is still 134.2MB. Free memory was 73.5MB in the beginning and 70.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 15:39:53,336 INFO L158 Benchmark]: Boogie Preprocessor took 32.29ms. Allocated memory is still 134.2MB. Free memory was 70.6MB in the beginning and 68.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 15:39:53,337 INFO L158 Benchmark]: RCFGBuilder took 628.11ms. Allocated memory was 134.2MB in the beginning and 167.8MB in the end (delta: 33.6MB). Free memory was 68.4MB in the beginning and 123.0MB in the end (delta: -54.5MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-12-14 15:39:53,337 INFO L158 Benchmark]: TraceAbstraction took 315221.46ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 122.0MB in the beginning and 93.2MB in the end (delta: 28.8MB). Peak memory consumption was 155.0MB. Max. memory is 16.1GB. [2022-12-14 15:39:53,340 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.18ms. Allocated memory is still 134.2MB. Free memory was 100.7MB in the beginning and 100.5MB in the end (delta: 140.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 345.28ms. Allocated memory is still 134.2MB. Free memory was 94.9MB in the beginning and 73.5MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.31ms. Allocated memory is still 134.2MB. Free memory was 73.5MB in the beginning and 70.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.29ms. Allocated memory is still 134.2MB. Free memory was 70.6MB in the beginning and 68.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 628.11ms. Allocated memory was 134.2MB in the beginning and 167.8MB in the end (delta: 33.6MB). Free memory was 68.4MB in the beginning and 123.0MB in the end (delta: -54.5MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 315221.46ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 122.0MB in the beginning and 93.2MB in the end (delta: 28.8MB). Peak memory consumption was 155.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:314) RESULT: Ultimate could not prove your program: Toolchain returned no result. 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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0218.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh --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 d0144744ce48339ff9171f70682ff014d707c8affcdd45929fe7382e980b7693 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 15:39:54,650 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 15:39:54,651 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 15:39:54,664 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 15:39:54,664 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 15:39:54,665 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 15:39:54,666 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 15:39:54,667 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 15:39:54,668 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 15:39:54,669 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 15:39:54,669 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 15:39:54,670 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 15:39:54,670 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 15:39:54,671 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 15:39:54,672 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 15:39:54,672 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 15:39:54,673 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 15:39:54,674 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 15:39:54,675 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 15:39:54,676 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 15:39:54,677 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 15:39:54,678 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 15:39:54,679 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 15:39:54,680 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 15:39:54,684 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 15:39:54,684 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 15:39:54,684 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 15:39:54,685 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 15:39:54,685 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 15:39:54,686 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 15:39:54,687 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 15:39:54,687 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 15:39:54,688 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 15:39:54,689 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 15:39:54,694 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 15:39:54,695 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 15:39:54,695 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 15:39:54,696 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 15:39:54,696 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 15:39:54,697 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 15:39:54,698 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 15:39:54,699 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-12-14 15:39:54,716 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 15:39:54,716 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 15:39:54,716 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 15:39:54,717 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 15:39:54,717 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 15:39:54,717 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 15:39:54,717 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 15:39:54,717 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 15:39:54,718 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 15:39:54,718 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 15:39:54,718 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 15:39:54,718 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 15:39:54,718 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 15:39:54,719 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 15:39:54,719 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 15:39:54,719 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 15:39:54,719 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 15:39:54,719 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 15:39:54,719 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 15:39:54,719 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 15:39:54,719 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 15:39:54,720 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 15:39:54,720 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 15:39:54,720 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 15:39:54,720 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 15:39:54,720 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-14 15:39:54,720 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-14 15:39:54,720 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 15:39:54,720 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 15:39:54,721 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 15:39:54,721 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-14 15:39:54,721 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 15:39:54,721 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 15:39:54,721 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 15:39:54,721 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 15:39:54,721 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-12-14 15:39:54,721 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-14 15:39:54,722 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 15:39:54,722 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-14 15:39:54,722 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_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh 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 -> d0144744ce48339ff9171f70682ff014d707c8affcdd45929fe7382e980b7693 [2022-12-14 15:39:54,949 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 15:39:54,965 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 15:39:54,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 15:39:54,968 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 15:39:54,968 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 15:39:54,969 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/memsafety/test-0218.i [2022-12-14 15:39:57,564 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 15:39:57,720 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 15:39:57,721 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/sv-benchmarks/c/memsafety/test-0218.i [2022-12-14 15:39:57,730 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/data/73bc5ddcd/c88e0da215474bbba286e489d13f734c/FLAG9d24ceb1f [2022-12-14 15:39:57,742 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/data/73bc5ddcd/c88e0da215474bbba286e489d13f734c [2022-12-14 15:39:57,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 15:39:57,745 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 15:39:57,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 15:39:57,746 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 15:39:57,749 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 15:39:57,750 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:39:57" (1/1) ... [2022-12-14 15:39:57,751 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73205c53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:39:57, skipping insertion in model container [2022-12-14 15:39:57,751 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:39:57" (1/1) ... [2022-12-14 15:39:57,756 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 15:39:57,791 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 15:39:58,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 15:39:58,062 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 15:39:58,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 15:39:58,118 INFO L208 MainTranslator]: Completed translation [2022-12-14 15:39:58,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:39:58 WrapperNode [2022-12-14 15:39:58,119 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 15:39:58,120 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 15:39:58,120 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 15:39:58,120 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 15:39:58,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:39:58" (1/1) ... [2022-12-14 15:39:58,138 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:39:58" (1/1) ... [2022-12-14 15:39:58,157 INFO L138 Inliner]: procedures = 182, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 196 [2022-12-14 15:39:58,157 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 15:39:58,158 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 15:39:58,158 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 15:39:58,158 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 15:39:58,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:39:58" (1/1) ... [2022-12-14 15:39:58,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:39:58" (1/1) ... [2022-12-14 15:39:58,168 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:39:58" (1/1) ... [2022-12-14 15:39:58,169 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:39:58" (1/1) ... [2022-12-14 15:39:58,176 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:39:58" (1/1) ... [2022-12-14 15:39:58,179 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:39:58" (1/1) ... [2022-12-14 15:39:58,180 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:39:58" (1/1) ... [2022-12-14 15:39:58,181 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:39:58" (1/1) ... [2022-12-14 15:39:58,184 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 15:39:58,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 15:39:58,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 15:39:58,184 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 15:39:58,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:39:58" (1/1) ... [2022-12-14 15:39:58,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 15:39:58,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:39:58,206 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 15:39:58,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 15:39:58,237 INFO L130 BoogieDeclarations]: Found specification of procedure rand_end_point [2022-12-14 15:39:58,237 INFO L138 BoogieDeclarations]: Found implementation of procedure rand_end_point [2022-12-14 15:39:58,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 15:39:58,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 15:39:58,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 15:39:58,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 15:39:58,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 15:39:58,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-14 15:39:58,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-14 15:39:58,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 15:39:58,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 15:39:58,339 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 15:39:58,341 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 15:39:58,885 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 15:39:58,890 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 15:39:58,891 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-12-14 15:39:58,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:39:58 BoogieIcfgContainer [2022-12-14 15:39:58,892 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 15:39:58,894 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 15:39:58,894 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 15:39:58,896 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 15:39:58,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 03:39:57" (1/3) ... [2022-12-14 15:39:58,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41454612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:39:58, skipping insertion in model container [2022-12-14 15:39:58,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:39:58" (2/3) ... [2022-12-14 15:39:58,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41454612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:39:58, skipping insertion in model container [2022-12-14 15:39:58,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:39:58" (3/3) ... [2022-12-14 15:39:58,898 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0218.i [2022-12-14 15:39:58,911 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 15:39:58,911 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2022-12-14 15:39:58,942 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 15:39:58,947 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;@19549a30, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 15:39:58,947 INFO L358 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2022-12-14 15:39:58,950 INFO L276 IsEmpty]: Start isEmpty. Operand has 157 states, 88 states have (on average 2.0113636363636362) internal successors, (177), 153 states have internal predecessors, (177), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 15:39:58,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 15:39:58,955 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:39:58,956 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 15:39:58,956 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:39:58,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:39:58,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1044504330, now seen corresponding path program 1 times [2022-12-14 15:39:58,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:39:58,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [960410336] [2022-12-14 15:39:58,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:39:58,969 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-12-14 15:39:58,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:39:58,970 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:39:58,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:39:59,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:39:59,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-14 15:39:59,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:39:59,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:39:59,041 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:39:59,042 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:39:59,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [960410336] [2022-12-14 15:39:59,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [960410336] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:39:59,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:39:59,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:39:59,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961527429] [2022-12-14 15:39:59,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:39:59,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 15:39:59,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:39:59,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 15:39:59,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 15:39:59,071 INFO L87 Difference]: Start difference. First operand has 157 states, 88 states have (on average 2.0113636363636362) internal successors, (177), 153 states have internal predecessors, (177), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:39:59,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:39:59,089 INFO L93 Difference]: Finished difference Result 157 states and 175 transitions. [2022-12-14 15:39:59,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 15:39:59,091 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 15:39:59,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:39:59,097 INFO L225 Difference]: With dead ends: 157 [2022-12-14 15:39:59,097 INFO L226 Difference]: Without dead ends: 155 [2022-12-14 15:39:59,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 15:39:59,101 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:39:59,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:39:59,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-12-14 15:39:59,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2022-12-14 15:39:59,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 87 states have (on average 1.9425287356321839) internal successors, (169), 151 states have internal predecessors, (169), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 15:39:59,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 173 transitions. [2022-12-14 15:39:59,138 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 173 transitions. Word has length 6 [2022-12-14 15:39:59,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:39:59,139 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 173 transitions. [2022-12-14 15:39:59,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:39:59,139 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 173 transitions. [2022-12-14 15:39:59,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 15:39:59,140 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:39:59,140 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 15:39:59,148 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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)] Forceful destruction successful, exit code 0 [2022-12-14 15:39:59,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:39:59,343 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:39:59,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:39:59,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1037771564, now seen corresponding path program 1 times [2022-12-14 15:39:59,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:39:59,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [175597966] [2022-12-14 15:39:59,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:39:59,347 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-12-14 15:39:59,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:39:59,351 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:39:59,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:39:59,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:39:59,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 15:39:59,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:39:59,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:39:59,629 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:39:59,629 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:39:59,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [175597966] [2022-12-14 15:39:59,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [175597966] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:39:59,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:39:59,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 15:39:59,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138725024] [2022-12-14 15:39:59,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:39:59,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:39:59,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:39:59,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:39:59,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:39:59,632 INFO L87 Difference]: Start difference. First operand 155 states and 173 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:39:59,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:39:59,992 INFO L93 Difference]: Finished difference Result 301 states and 336 transitions. [2022-12-14 15:39:59,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:39:59,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 15:39:59,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:39:59,995 INFO L225 Difference]: With dead ends: 301 [2022-12-14 15:39:59,995 INFO L226 Difference]: Without dead ends: 301 [2022-12-14 15:39:59,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-12-14 15:39:59,996 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 155 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:39:59,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 219 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:39:59,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-12-14 15:40:00,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 211. [2022-12-14 15:40:00,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 140 states have (on average 1.9285714285714286) internal successors, (270), 204 states have internal predecessors, (270), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-14 15:40:00,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 278 transitions. [2022-12-14 15:40:00,009 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 278 transitions. Word has length 6 [2022-12-14 15:40:00,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:00,009 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 278 transitions. [2022-12-14 15:40:00,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:40:00,009 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 278 transitions. [2022-12-14 15:40:00,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 15:40:00,009 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:00,010 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 15:40:00,018 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:00,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:00,212 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:00,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:00,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1037771565, now seen corresponding path program 1 times [2022-12-14 15:40:00,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:00,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [150299498] [2022-12-14 15:40:00,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:00,216 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-12-14 15:40:00,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:00,219 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:00,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:00,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 15:40:00,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:00,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:00,417 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:00,417 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:00,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [150299498] [2022-12-14 15:40:00,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [150299498] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:00,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:00,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:40:00,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800584166] [2022-12-14 15:40:00,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:00,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:40:00,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:00,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:40:00,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:40:00,419 INFO L87 Difference]: Start difference. First operand 211 states and 278 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:40:00,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:00,721 INFO L93 Difference]: Finished difference Result 229 states and 296 transitions. [2022-12-14 15:40:00,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:40:00,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 15:40:00,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:00,723 INFO L225 Difference]: With dead ends: 229 [2022-12-14 15:40:00,723 INFO L226 Difference]: Without dead ends: 229 [2022-12-14 15:40:00,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-12-14 15:40:00,725 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 201 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:00,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 224 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:40:00,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-12-14 15:40:00,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 213. [2022-12-14 15:40:00,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 142 states have (on average 1.9225352112676057) internal successors, (273), 206 states have internal predecessors, (273), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-14 15:40:00,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 281 transitions. [2022-12-14 15:40:00,739 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 281 transitions. Word has length 6 [2022-12-14 15:40:00,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:00,739 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 281 transitions. [2022-12-14 15:40:00,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:40:00,739 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 281 transitions. [2022-12-14 15:40:00,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 15:40:00,740 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:00,740 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 15:40:00,747 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:00,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:00,942 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:00,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:00,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1037771627, now seen corresponding path program 1 times [2022-12-14 15:40:00,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:00,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1262924698] [2022-12-14 15:40:00,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:00,947 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-12-14 15:40:00,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:00,951 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:00,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:00,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:00,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 15:40:00,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:01,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:01,048 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:01,048 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:01,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1262924698] [2022-12-14 15:40:01,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1262924698] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:01,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:01,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:40:01,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455466541] [2022-12-14 15:40:01,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:01,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:40:01,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:01,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:40:01,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:40:01,051 INFO L87 Difference]: Start difference. First operand 213 states and 281 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:40:01,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:01,359 INFO L93 Difference]: Finished difference Result 228 states and 294 transitions. [2022-12-14 15:40:01,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:40:01,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 15:40:01,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:01,361 INFO L225 Difference]: With dead ends: 228 [2022-12-14 15:40:01,361 INFO L226 Difference]: Without dead ends: 228 [2022-12-14 15:40:01,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-12-14 15:40:01,363 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 183 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:01,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 237 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:40:01,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-12-14 15:40:01,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 210. [2022-12-14 15:40:01,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 140 states have (on average 1.9142857142857144) internal successors, (268), 203 states have internal predecessors, (268), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-14 15:40:01,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 276 transitions. [2022-12-14 15:40:01,371 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 276 transitions. Word has length 6 [2022-12-14 15:40:01,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:01,371 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 276 transitions. [2022-12-14 15:40:01,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:40:01,371 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 276 transitions. [2022-12-14 15:40:01,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 15:40:01,372 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:01,372 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:40:01,379 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:01,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:01,575 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:01,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:01,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1078287251, now seen corresponding path program 1 times [2022-12-14 15:40:01,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:01,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1843797607] [2022-12-14 15:40:01,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:01,579 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-12-14 15:40:01,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:01,583 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:01,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:01,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:01,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-14 15:40:01,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:01,706 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:40:01,710 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-12-14 15:40:01,713 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:40:01,715 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:40:01,715 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 17 treesize of output 10 [2022-12-14 15:40:01,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:01,743 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:01,743 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:01,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1843797607] [2022-12-14 15:40:01,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1843797607] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:01,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:01,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 15:40:01,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706385116] [2022-12-14 15:40:01,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:01,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 15:40:01,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:01,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 15:40:01,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:40:01,745 INFO L87 Difference]: Start difference. First operand 210 states and 276 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:40:02,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:02,130 INFO L93 Difference]: Finished difference Result 370 states and 477 transitions. [2022-12-14 15:40:02,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 15:40:02,132 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-12-14 15:40:02,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:02,133 INFO L225 Difference]: With dead ends: 370 [2022-12-14 15:40:02,133 INFO L226 Difference]: Without dead ends: 370 [2022-12-14 15:40:02,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-12-14 15:40:02,134 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 139 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:02,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 674 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:40:02,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-12-14 15:40:02,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 268. [2022-12-14 15:40:02,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 192 states have (on average 1.8697916666666667) internal successors, (359), 257 states have internal predecessors, (359), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-14 15:40:02,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 375 transitions. [2022-12-14 15:40:02,141 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 375 transitions. Word has length 9 [2022-12-14 15:40:02,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:02,142 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 375 transitions. [2022-12-14 15:40:02,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:40:02,142 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 375 transitions. [2022-12-14 15:40:02,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 15:40:02,142 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:02,142 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:40:02,149 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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)] Ended with exit code 0 [2022-12-14 15:40:02,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:02,343 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:02,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:02,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1080134293, now seen corresponding path program 1 times [2022-12-14 15:40:02,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:02,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1032631673] [2022-12-14 15:40:02,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:02,346 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-12-14 15:40:02,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:02,347 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:02,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:02,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-14 15:40:02,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:02,546 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:40:02,547 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-12-14 15:40:02,550 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:40:02,552 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:40:02,552 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 17 treesize of output 10 [2022-12-14 15:40:02,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:02,580 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:02,580 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:02,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1032631673] [2022-12-14 15:40:02,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1032631673] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:02,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:02,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 15:40:02,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796847145] [2022-12-14 15:40:02,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:02,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 15:40:02,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:02,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 15:40:02,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:40:02,582 INFO L87 Difference]: Start difference. First operand 268 states and 375 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:40:02,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:02,933 INFO L93 Difference]: Finished difference Result 360 states and 466 transitions. [2022-12-14 15:40:02,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 15:40:02,934 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-12-14 15:40:02,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:02,935 INFO L225 Difference]: With dead ends: 360 [2022-12-14 15:40:02,936 INFO L226 Difference]: Without dead ends: 360 [2022-12-14 15:40:02,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-12-14 15:40:02,936 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 119 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:02,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 674 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:40:02,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-12-14 15:40:02,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 268. [2022-12-14 15:40:02,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 192 states have (on average 1.8697916666666667) internal successors, (359), 257 states have internal predecessors, (359), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-14 15:40:02,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 375 transitions. [2022-12-14 15:40:02,943 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 375 transitions. Word has length 9 [2022-12-14 15:40:02,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:02,943 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 375 transitions. [2022-12-14 15:40:02,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:40:02,943 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 375 transitions. [2022-12-14 15:40:02,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 15:40:02,944 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:02,944 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:40:02,951 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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)] Ended with exit code 0 [2022-12-14 15:40:03,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:03,146 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:03,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:03,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1288896398, now seen corresponding path program 1 times [2022-12-14 15:40:03,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:03,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1050462726] [2022-12-14 15:40:03,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:03,147 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-12-14 15:40:03,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:03,149 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:03,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:03,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:03,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 15:40:03,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:03,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:03,271 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:03,271 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:03,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1050462726] [2022-12-14 15:40:03,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1050462726] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:03,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:03,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:40:03,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45424674] [2022-12-14 15:40:03,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:03,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:40:03,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:03,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:40:03,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:40:03,274 INFO L87 Difference]: Start difference. First operand 268 states and 375 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:03,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:03,749 INFO L93 Difference]: Finished difference Result 464 states and 570 transitions. [2022-12-14 15:40:03,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:40:03,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-12-14 15:40:03,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:03,753 INFO L225 Difference]: With dead ends: 464 [2022-12-14 15:40:03,753 INFO L226 Difference]: Without dead ends: 464 [2022-12-14 15:40:03,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:40:03,754 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 294 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:03,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 399 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 15:40:03,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2022-12-14 15:40:03,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 274. [2022-12-14 15:40:03,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 198 states have (on average 1.8434343434343434) internal successors, (365), 263 states have internal predecessors, (365), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-14 15:40:03,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 381 transitions. [2022-12-14 15:40:03,765 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 381 transitions. Word has length 11 [2022-12-14 15:40:03,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:03,765 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 381 transitions. [2022-12-14 15:40:03,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:03,765 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 381 transitions. [2022-12-14 15:40:03,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 15:40:03,766 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:03,766 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:40:03,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:03,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:03,967 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:03,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:03,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1288896399, now seen corresponding path program 1 times [2022-12-14 15:40:03,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:03,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1208754140] [2022-12-14 15:40:03,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:03,968 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-12-14 15:40:03,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:03,969 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:03,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:04,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:04,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 15:40:04,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:04,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:04,079 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:04,079 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:04,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1208754140] [2022-12-14 15:40:04,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1208754140] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:04,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:04,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:40:04,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786541852] [2022-12-14 15:40:04,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:04,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:40:04,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:04,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:40:04,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:40:04,081 INFO L87 Difference]: Start difference. First operand 274 states and 381 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:04,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:04,435 INFO L93 Difference]: Finished difference Result 369 states and 487 transitions. [2022-12-14 15:40:04,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:40:04,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-12-14 15:40:04,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:04,438 INFO L225 Difference]: With dead ends: 369 [2022-12-14 15:40:04,438 INFO L226 Difference]: Without dead ends: 369 [2022-12-14 15:40:04,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:40:04,439 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 329 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:04,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 235 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:40:04,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-12-14 15:40:04,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 271. [2022-12-14 15:40:04,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 198 states have (on average 1.7828282828282829) internal successors, (353), 260 states have internal predecessors, (353), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-14 15:40:04,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 369 transitions. [2022-12-14 15:40:04,445 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 369 transitions. Word has length 11 [2022-12-14 15:40:04,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:04,445 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 369 transitions. [2022-12-14 15:40:04,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:04,445 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 369 transitions. [2022-12-14 15:40:04,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 15:40:04,446 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:04,446 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:40:04,454 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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)] Ended with exit code 0 [2022-12-14 15:40:04,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:04,648 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:04,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:04,649 INFO L85 PathProgramCache]: Analyzing trace with hash -932834860, now seen corresponding path program 1 times [2022-12-14 15:40:04,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:04,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [833700440] [2022-12-14 15:40:04,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:04,650 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-12-14 15:40:04,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:04,653 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:04,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:04,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 15:40:04,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:04,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:04,787 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:04,787 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:04,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [833700440] [2022-12-14 15:40:04,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [833700440] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:04,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:04,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:40:04,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601118721] [2022-12-14 15:40:04,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:04,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:40:04,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:04,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:40:04,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:40:04,788 INFO L87 Difference]: Start difference. First operand 271 states and 369 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-12-14 15:40:04,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:04,951 INFO L93 Difference]: Finished difference Result 313 states and 410 transitions. [2022-12-14 15:40:04,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:40:04,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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-12-14 15:40:04,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:04,953 INFO L225 Difference]: With dead ends: 313 [2022-12-14 15:40:04,953 INFO L226 Difference]: Without dead ends: 306 [2022-12-14 15:40:04,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-12-14 15:40:04,953 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 56 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:04,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 250 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:40:04,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-12-14 15:40:04,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 268. [2022-12-14 15:40:04,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 195 states have (on average 1.7846153846153847) internal successors, (348), 257 states have internal predecessors, (348), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-14 15:40:04,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 364 transitions. [2022-12-14 15:40:04,958 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 364 transitions. Word has length 10 [2022-12-14 15:40:04,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:04,958 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 364 transitions. [2022-12-14 15:40:04,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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-12-14 15:40:04,958 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 364 transitions. [2022-12-14 15:40:04,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 15:40:04,958 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:04,959 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:40:04,969 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:05,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:05,161 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:05,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:05,162 INFO L85 PathProgramCache]: Analyzing trace with hash -2026670439, now seen corresponding path program 1 times [2022-12-14 15:40:05,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:05,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1550716232] [2022-12-14 15:40:05,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:05,163 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-12-14 15:40:05,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:05,166 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:05,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:05,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:05,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 15:40:05,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:05,269 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 15:40:05,269 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-12-14 15:40:05,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:05,306 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:05,306 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:05,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1550716232] [2022-12-14 15:40:05,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1550716232] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:05,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:05,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:40:05,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040000586] [2022-12-14 15:40:05,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:05,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:40:05,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:05,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:40:05,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:40:05,308 INFO L87 Difference]: Start difference. First operand 268 states and 364 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:05,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:05,852 INFO L93 Difference]: Finished difference Result 481 states and 574 transitions. [2022-12-14 15:40:05,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:40:05,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-12-14 15:40:05,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:05,854 INFO L225 Difference]: With dead ends: 481 [2022-12-14 15:40:05,854 INFO L226 Difference]: Without dead ends: 481 [2022-12-14 15:40:05,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:40:05,854 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 357 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:05,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 378 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 15:40:05,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2022-12-14 15:40:05,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 287. [2022-12-14 15:40:05,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 214 states have (on average 1.8037383177570094) internal successors, (386), 276 states have internal predecessors, (386), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-14 15:40:05,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 402 transitions. [2022-12-14 15:40:05,862 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 402 transitions. Word has length 14 [2022-12-14 15:40:05,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:05,862 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 402 transitions. [2022-12-14 15:40:05,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:05,863 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 402 transitions. [2022-12-14 15:40:05,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 15:40:05,863 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:05,863 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:40:05,875 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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)] Ended with exit code 0 [2022-12-14 15:40:06,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:06,066 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:06,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:06,068 INFO L85 PathProgramCache]: Analyzing trace with hash -2026670438, now seen corresponding path program 1 times [2022-12-14 15:40:06,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:06,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [975064321] [2022-12-14 15:40:06,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:06,070 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-12-14 15:40:06,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:06,073 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:06,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:06,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-14 15:40:06,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:06,287 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 15:40:06,287 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 12 treesize of output 14 [2022-12-14 15:40:06,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:06,334 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:06,335 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:06,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [975064321] [2022-12-14 15:40:06,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [975064321] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:06,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:06,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:40:06,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441559547] [2022-12-14 15:40:06,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:06,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 15:40:06,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:06,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 15:40:06,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:40:06,336 INFO L87 Difference]: Start difference. First operand 287 states and 402 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:07,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:07,153 INFO L93 Difference]: Finished difference Result 582 states and 798 transitions. [2022-12-14 15:40:07,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 15:40:07,153 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-12-14 15:40:07,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:07,156 INFO L225 Difference]: With dead ends: 582 [2022-12-14 15:40:07,156 INFO L226 Difference]: Without dead ends: 582 [2022-12-14 15:40:07,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-14 15:40:07,157 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 435 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:07,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 654 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 15:40:07,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2022-12-14 15:40:07,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 345. [2022-12-14 15:40:07,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 268 states have (on average 1.7798507462686568) internal successors, (477), 332 states have internal predecessors, (477), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-12-14 15:40:07,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 501 transitions. [2022-12-14 15:40:07,164 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 501 transitions. Word has length 14 [2022-12-14 15:40:07,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:07,164 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 501 transitions. [2022-12-14 15:40:07,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:07,164 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 501 transitions. [2022-12-14 15:40:07,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 15:40:07,164 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:07,164 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:40:07,175 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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)] Ended with exit code 0 [2022-12-14 15:40:07,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:07,366 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:07,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:07,367 INFO L85 PathProgramCache]: Analyzing trace with hash 460842395, now seen corresponding path program 1 times [2022-12-14 15:40:07,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:07,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [704274375] [2022-12-14 15:40:07,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:07,368 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-12-14 15:40:07,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:07,371 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:07,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:07,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:07,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 15:40:07,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:07,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:07,442 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:07,442 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:07,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [704274375] [2022-12-14 15:40:07,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [704274375] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:07,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:07,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 15:40:07,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563441491] [2022-12-14 15:40:07,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:07,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 15:40:07,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:07,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 15:40:07,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:40:07,444 INFO L87 Difference]: Start difference. First operand 345 states and 501 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:07,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:07,592 INFO L93 Difference]: Finished difference Result 543 states and 760 transitions. [2022-12-14 15:40:07,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 15:40:07,593 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-12-14 15:40:07,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:07,594 INFO L225 Difference]: With dead ends: 543 [2022-12-14 15:40:07,594 INFO L226 Difference]: Without dead ends: 543 [2022-12-14 15:40:07,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-14 15:40:07,595 INFO L413 NwaCegarLoop]: 325 mSDtfsCounter, 226 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:07,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1354 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:40:07,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2022-12-14 15:40:07,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 345. [2022-12-14 15:40:07,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 268 states have (on average 1.7723880597014925) internal successors, (475), 332 states have internal predecessors, (475), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-12-14 15:40:07,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 499 transitions. [2022-12-14 15:40:07,602 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 499 transitions. Word has length 14 [2022-12-14 15:40:07,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:07,602 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 499 transitions. [2022-12-14 15:40:07,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:07,602 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 499 transitions. [2022-12-14 15:40:07,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 15:40:07,603 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:07,603 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:40:07,613 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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)] Ended with exit code 0 [2022-12-14 15:40:07,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:07,803 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:07,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:07,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1401267931, now seen corresponding path program 1 times [2022-12-14 15:40:07,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:07,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1739297163] [2022-12-14 15:40:07,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:07,804 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-12-14 15:40:07,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:07,805 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:07,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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)] Waiting until timeout for monitored process [2022-12-14 15:40:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:07,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-14 15:40:07,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:07,941 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 15:40:07,941 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 12 treesize of output 14 [2022-12-14 15:40:08,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:08,000 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:08,000 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:08,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1739297163] [2022-12-14 15:40:08,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1739297163] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:08,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:08,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:40:08,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549317508] [2022-12-14 15:40:08,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:08,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 15:40:08,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:08,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 15:40:08,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:40:08,002 INFO L87 Difference]: Start difference. First operand 345 states and 499 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:08,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:08,982 INFO L93 Difference]: Finished difference Result 601 states and 829 transitions. [2022-12-14 15:40:08,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 15:40:08,982 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-12-14 15:40:08,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:08,985 INFO L225 Difference]: With dead ends: 601 [2022-12-14 15:40:08,985 INFO L226 Difference]: Without dead ends: 601 [2022-12-14 15:40:08,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-14 15:40:08,986 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 431 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:08,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 740 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 15:40:08,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2022-12-14 15:40:08,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 322. [2022-12-14 15:40:08,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 245 states have (on average 1.7591836734693878) internal successors, (431), 309 states have internal predecessors, (431), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-12-14 15:40:08,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 455 transitions. [2022-12-14 15:40:08,998 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 455 transitions. Word has length 15 [2022-12-14 15:40:08,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:08,998 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 455 transitions. [2022-12-14 15:40:08,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:08,999 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 455 transitions. [2022-12-14 15:40:08,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 15:40:08,999 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:08,999 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:40:09,006 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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)] Ended with exit code 0 [2022-12-14 15:40:09,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:09,200 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:09,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:09,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1947035922, now seen corresponding path program 1 times [2022-12-14 15:40:09,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:09,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2045333287] [2022-12-14 15:40:09,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:09,203 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-12-14 15:40:09,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:09,206 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:09,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (15)] Waiting until timeout for monitored process [2022-12-14 15:40:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:09,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-14 15:40:09,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:09,550 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:40:09,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2022-12-14 15:40:09,556 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:40:09,559 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:40:09,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 13 [2022-12-14 15:40:09,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:09,590 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:09,590 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:09,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2045333287] [2022-12-14 15:40:09,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2045333287] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:09,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:09,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 15:40:09,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676117223] [2022-12-14 15:40:09,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:09,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 15:40:09,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:09,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 15:40:09,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-14 15:40:09,591 INFO L87 Difference]: Start difference. First operand 322 states and 455 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:10,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:10,599 INFO L93 Difference]: Finished difference Result 663 states and 922 transitions. [2022-12-14 15:40:10,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 15:40:10,600 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-12-14 15:40:10,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:10,601 INFO L225 Difference]: With dead ends: 663 [2022-12-14 15:40:10,601 INFO L226 Difference]: Without dead ends: 663 [2022-12-14 15:40:10,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:40:10,602 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 390 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:10,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 1352 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 15:40:10,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2022-12-14 15:40:10,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 316. [2022-12-14 15:40:10,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 239 states have (on average 1.7573221757322175) internal successors, (420), 303 states have internal predecessors, (420), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-12-14 15:40:10,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 444 transitions. [2022-12-14 15:40:10,612 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 444 transitions. Word has length 17 [2022-12-14 15:40:10,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:10,612 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 444 transitions. [2022-12-14 15:40:10,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:10,613 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 444 transitions. [2022-12-14 15:40:10,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 15:40:10,613 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:10,613 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:40:10,635 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (15)] Forceful destruction successful, exit code 0 [2022-12-14 15:40:10,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:10,814 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:10,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:10,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1023398879, now seen corresponding path program 1 times [2022-12-14 15:40:10,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:10,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [906598321] [2022-12-14 15:40:10,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:10,817 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-12-14 15:40:10,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:10,820 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:10,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:10,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:10,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-14 15:40:10,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:11,068 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:40:11,069 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-12-14 15:40:11,071 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:40:11,073 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:40:11,073 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 17 treesize of output 10 [2022-12-14 15:40:11,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:11,096 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:11,096 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:11,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [906598321] [2022-12-14 15:40:11,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [906598321] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:11,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:11,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 15:40:11,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385376319] [2022-12-14 15:40:11,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:11,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 15:40:11,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:11,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 15:40:11,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-14 15:40:11,098 INFO L87 Difference]: Start difference. First operand 316 states and 444 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:11,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:11,624 INFO L93 Difference]: Finished difference Result 455 states and 608 transitions. [2022-12-14 15:40:11,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 15:40:11,624 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-12-14 15:40:11,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:11,625 INFO L225 Difference]: With dead ends: 455 [2022-12-14 15:40:11,625 INFO L226 Difference]: Without dead ends: 455 [2022-12-14 15:40:11,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-12-14 15:40:11,626 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 133 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:11,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 894 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 15:40:11,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2022-12-14 15:40:11,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 338. [2022-12-14 15:40:11,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 261 states have (on average 1.7126436781609196) internal successors, (447), 323 states have internal predecessors, (447), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2022-12-14 15:40:11,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 471 transitions. [2022-12-14 15:40:11,633 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 471 transitions. Word has length 18 [2022-12-14 15:40:11,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:11,633 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 471 transitions. [2022-12-14 15:40:11,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:11,633 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 471 transitions. [2022-12-14 15:40:11,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 15:40:11,634 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:11,634 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:40:11,645 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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)] Ended with exit code 0 [2022-12-14 15:40:11,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:11,835 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:11,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:11,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1496579075, now seen corresponding path program 1 times [2022-12-14 15:40:11,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:11,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [627430103] [2022-12-14 15:40:11,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:11,838 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-12-14 15:40:11,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:11,841 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:11,844 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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)] Waiting until timeout for monitored process [2022-12-14 15:40:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:11,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 15:40:11,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:12,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:12,057 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:12,057 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:12,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [627430103] [2022-12-14 15:40:12,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [627430103] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:12,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:12,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:40:12,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103555735] [2022-12-14 15:40:12,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:12,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:40:12,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:12,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:40:12,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:40:12,058 INFO L87 Difference]: Start difference. First operand 338 states and 471 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:12,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:12,476 INFO L93 Difference]: Finished difference Result 547 states and 697 transitions. [2022-12-14 15:40:12,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:40:12,476 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-12-14 15:40:12,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:12,478 INFO L225 Difference]: With dead ends: 547 [2022-12-14 15:40:12,478 INFO L226 Difference]: Without dead ends: 547 [2022-12-14 15:40:12,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:40:12,478 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 270 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:12,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 414 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 15:40:12,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2022-12-14 15:40:12,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 352. [2022-12-14 15:40:12,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 275 states have (on average 1.7272727272727273) internal successors, (475), 337 states have internal predecessors, (475), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2022-12-14 15:40:12,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 499 transitions. [2022-12-14 15:40:12,484 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 499 transitions. Word has length 19 [2022-12-14 15:40:12,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:12,485 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 499 transitions. [2022-12-14 15:40:12,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:12,485 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 499 transitions. [2022-12-14 15:40:12,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 15:40:12,485 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:12,485 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:40:12,492 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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)] Forceful destruction successful, exit code 0 [2022-12-14 15:40:12,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:12,686 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:12,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:12,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1496579074, now seen corresponding path program 1 times [2022-12-14 15:40:12,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:12,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2067755999] [2022-12-14 15:40:12,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:12,689 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-12-14 15:40:12,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:12,692 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:12,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (18)] Waiting until timeout for monitored process [2022-12-14 15:40:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:12,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 15:40:12,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:12,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:12,899 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:12,899 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:12,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2067755999] [2022-12-14 15:40:12,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2067755999] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:12,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:12,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:40:12,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612902928] [2022-12-14 15:40:12,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:12,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:40:12,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:12,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:40:12,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:40:12,901 INFO L87 Difference]: Start difference. First operand 352 states and 499 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:13,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:13,294 INFO L93 Difference]: Finished difference Result 476 states and 652 transitions. [2022-12-14 15:40:13,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:40:13,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-12-14 15:40:13,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:13,296 INFO L225 Difference]: With dead ends: 476 [2022-12-14 15:40:13,296 INFO L226 Difference]: Without dead ends: 476 [2022-12-14 15:40:13,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:40:13,296 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 324 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:13,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 228 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 15:40:13,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-12-14 15:40:13,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 349. [2022-12-14 15:40:13,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 275 states have (on average 1.6836363636363636) internal successors, (463), 334 states have internal predecessors, (463), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2022-12-14 15:40:13,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 487 transitions. [2022-12-14 15:40:13,305 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 487 transitions. Word has length 19 [2022-12-14 15:40:13,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:13,305 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 487 transitions. [2022-12-14 15:40:13,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:13,305 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 487 transitions. [2022-12-14 15:40:13,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 15:40:13,306 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:13,306 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:40:13,314 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (18)] Ended with exit code 0 [2022-12-14 15:40:13,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:13,507 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:13,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:13,507 INFO L85 PathProgramCache]: Analyzing trace with hash 944634784, now seen corresponding path program 1 times [2022-12-14 15:40:13,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:13,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [784086588] [2022-12-14 15:40:13,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:13,508 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-12-14 15:40:13,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:13,509 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:13,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:13,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-14 15:40:13,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:13,682 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:40:13,682 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-12-14 15:40:13,686 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:40:13,688 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:40:13,688 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 17 treesize of output 10 [2022-12-14 15:40:13,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:13,706 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:13,706 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:13,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [784086588] [2022-12-14 15:40:13,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [784086588] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:13,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:13,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 15:40:13,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046145635] [2022-12-14 15:40:13,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:13,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 15:40:13,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:13,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 15:40:13,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-14 15:40:13,708 INFO L87 Difference]: Start difference. First operand 349 states and 487 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:14,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:14,410 INFO L93 Difference]: Finished difference Result 425 states and 562 transitions. [2022-12-14 15:40:14,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 15:40:14,411 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-12-14 15:40:14,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:14,412 INFO L225 Difference]: With dead ends: 425 [2022-12-14 15:40:14,412 INFO L226 Difference]: Without dead ends: 425 [2022-12-14 15:40:14,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-12-14 15:40:14,412 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 111 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:14,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1000 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 15:40:14,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-12-14 15:40:14,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 357. [2022-12-14 15:40:14,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 283 states have (on average 1.6643109540636043) internal successors, (471), 340 states have internal predecessors, (471), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-12-14 15:40:14,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 495 transitions. [2022-12-14 15:40:14,417 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 495 transitions. Word has length 19 [2022-12-14 15:40:14,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:14,417 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 495 transitions. [2022-12-14 15:40:14,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:14,417 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 495 transitions. [2022-12-14 15:40:14,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 15:40:14,417 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:14,417 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-12-14 15:40:14,429 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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)] Ended with exit code 0 [2022-12-14 15:40:14,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:14,619 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:14,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:14,620 INFO L85 PathProgramCache]: Analyzing trace with hash -52498928, now seen corresponding path program 1 times [2022-12-14 15:40:14,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:14,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422890460] [2022-12-14 15:40:14,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:14,623 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-12-14 15:40:14,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:14,626 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:14,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:14,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:14,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 15:40:14,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:14,775 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-12-14 15:40:14,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:14,791 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:14,791 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:14,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [422890460] [2022-12-14 15:40:14,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [422890460] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:14,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:14,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:40:14,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428216196] [2022-12-14 15:40:14,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:14,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:40:14,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:14,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:40:14,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:40:14,792 INFO L87 Difference]: Start difference. First operand 357 states and 495 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:15,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:15,002 INFO L93 Difference]: Finished difference Result 437 states and 586 transitions. [2022-12-14 15:40:15,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:40:15,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-12-14 15:40:15,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:15,005 INFO L225 Difference]: With dead ends: 437 [2022-12-14 15:40:15,005 INFO L226 Difference]: Without dead ends: 437 [2022-12-14 15:40:15,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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-12-14 15:40:15,006 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 133 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:15,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 245 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:40:15,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2022-12-14 15:40:15,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 355. [2022-12-14 15:40:15,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 283 states have (on average 1.6360424028268552) internal successors, (463), 338 states have internal predecessors, (463), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-12-14 15:40:15,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 487 transitions. [2022-12-14 15:40:15,013 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 487 transitions. Word has length 20 [2022-12-14 15:40:15,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:15,013 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 487 transitions. [2022-12-14 15:40:15,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:15,013 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 487 transitions. [2022-12-14 15:40:15,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 15:40:15,014 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:15,014 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-12-14 15:40:15,021 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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)] Ended with exit code 0 [2022-12-14 15:40:15,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:15,215 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:15,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:15,216 INFO L85 PathProgramCache]: Analyzing trace with hash -52498927, now seen corresponding path program 1 times [2022-12-14 15:40:15,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:15,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [37248370] [2022-12-14 15:40:15,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:15,218 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-12-14 15:40:15,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:15,221 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:15,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:15,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 15:40:15,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:15,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 15:40:15,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:15,368 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:15,368 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:15,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [37248370] [2022-12-14 15:40:15,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [37248370] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:15,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:15,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:40:15,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069649363] [2022-12-14 15:40:15,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:15,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:40:15,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:15,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:40:15,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:40:15,370 INFO L87 Difference]: Start difference. First operand 355 states and 487 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:15,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:15,834 INFO L93 Difference]: Finished difference Result 693 states and 938 transitions. [2022-12-14 15:40:15,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:40:15,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-12-14 15:40:15,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:15,836 INFO L225 Difference]: With dead ends: 693 [2022-12-14 15:40:15,837 INFO L226 Difference]: Without dead ends: 693 [2022-12-14 15:40:15,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 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-12-14 15:40:15,837 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 431 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:15,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 381 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 15:40:15,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2022-12-14 15:40:15,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 415. [2022-12-14 15:40:15,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 343 states have (on average 1.6326530612244898) internal successors, (560), 398 states have internal predecessors, (560), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-12-14 15:40:15,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 584 transitions. [2022-12-14 15:40:15,843 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 584 transitions. Word has length 20 [2022-12-14 15:40:15,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:15,843 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 584 transitions. [2022-12-14 15:40:15,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:15,843 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 584 transitions. [2022-12-14 15:40:15,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 15:40:15,843 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:15,843 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-12-14 15:40:15,854 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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)] Ended with exit code 0 [2022-12-14 15:40:16,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:16,045 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:16,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:16,046 INFO L85 PathProgramCache]: Analyzing trace with hash 2075151283, now seen corresponding path program 1 times [2022-12-14 15:40:16,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:16,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1485028051] [2022-12-14 15:40:16,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:16,047 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-12-14 15:40:16,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:16,050 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:16,053 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:16,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:16,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 15:40:16,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:16,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:16,150 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:16,150 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:16,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1485028051] [2022-12-14 15:40:16,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1485028051] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:16,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:16,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 15:40:16,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930344894] [2022-12-14 15:40:16,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:16,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 15:40:16,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:16,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 15:40:16,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:40:16,152 INFO L87 Difference]: Start difference. First operand 415 states and 584 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:16,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:16,274 INFO L93 Difference]: Finished difference Result 609 states and 832 transitions. [2022-12-14 15:40:16,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 15:40:16,275 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-12-14 15:40:16,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:16,276 INFO L225 Difference]: With dead ends: 609 [2022-12-14 15:40:16,276 INFO L226 Difference]: Without dead ends: 609 [2022-12-14 15:40:16,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-14 15:40:16,277 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 214 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:16,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 1101 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:40:16,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2022-12-14 15:40:16,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 415. [2022-12-14 15:40:16,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 343 states have (on average 1.620991253644315) internal successors, (556), 398 states have internal predecessors, (556), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-12-14 15:40:16,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 580 transitions. [2022-12-14 15:40:16,284 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 580 transitions. Word has length 21 [2022-12-14 15:40:16,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:16,284 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 580 transitions. [2022-12-14 15:40:16,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:16,284 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 580 transitions. [2022-12-14 15:40:16,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 15:40:16,285 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:16,285 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-12-14 15:40:16,294 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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)] Ended with exit code 0 [2022-12-14 15:40:16,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:16,486 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:16,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:16,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1564617106, now seen corresponding path program 1 times [2022-12-14 15:40:16,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:16,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1273973625] [2022-12-14 15:40:16,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:16,488 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-12-14 15:40:16,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:16,491 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:16,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (23)] Waiting until timeout for monitored process [2022-12-14 15:40:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:16,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 15:40:16,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:16,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 15:40:16,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:16,732 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:16,732 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:16,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1273973625] [2022-12-14 15:40:16,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1273973625] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:16,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:16,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:40:16,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217647948] [2022-12-14 15:40:16,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:16,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:40:16,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:16,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:40:16,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:40:16,734 INFO L87 Difference]: Start difference. First operand 415 states and 580 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:17,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:17,226 INFO L93 Difference]: Finished difference Result 753 states and 1031 transitions. [2022-12-14 15:40:17,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:40:17,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-12-14 15:40:17,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:17,228 INFO L225 Difference]: With dead ends: 753 [2022-12-14 15:40:17,228 INFO L226 Difference]: Without dead ends: 753 [2022-12-14 15:40:17,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 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-12-14 15:40:17,229 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 290 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:17,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 484 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 15:40:17,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2022-12-14 15:40:17,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 415. [2022-12-14 15:40:17,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 343 states have (on average 1.620991253644315) internal successors, (556), 398 states have internal predecessors, (556), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-12-14 15:40:17,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 580 transitions. [2022-12-14 15:40:17,235 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 580 transitions. Word has length 21 [2022-12-14 15:40:17,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:17,235 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 580 transitions. [2022-12-14 15:40:17,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:17,235 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 580 transitions. [2022-12-14 15:40:17,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 15:40:17,235 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:17,235 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-12-14 15:40:17,245 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (23)] Ended with exit code 0 [2022-12-14 15:40:17,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:17,436 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:17,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:17,437 INFO L85 PathProgramCache]: Analyzing trace with hash -2050291820, now seen corresponding path program 1 times [2022-12-14 15:40:17,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:17,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [820364696] [2022-12-14 15:40:17,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:17,439 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-12-14 15:40:17,439 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:17,442 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:17,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (24)] Waiting until timeout for monitored process [2022-12-14 15:40:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:17,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 15:40:17,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:17,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:17,564 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:17,564 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:17,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [820364696] [2022-12-14 15:40:17,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [820364696] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:17,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:17,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 15:40:17,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765709663] [2022-12-14 15:40:17,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:17,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 15:40:17,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:17,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 15:40:17,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:40:17,566 INFO L87 Difference]: Start difference. First operand 415 states and 580 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:17,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:17,710 INFO L93 Difference]: Finished difference Result 604 states and 820 transitions. [2022-12-14 15:40:17,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 15:40:17,711 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-12-14 15:40:17,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:17,714 INFO L225 Difference]: With dead ends: 604 [2022-12-14 15:40:17,714 INFO L226 Difference]: Without dead ends: 604 [2022-12-14 15:40:17,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-14 15:40:17,715 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 215 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:17,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 1306 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:40:17,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2022-12-14 15:40:17,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 354. [2022-12-14 15:40:17,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 283 states have (on average 1.5936395759717314) internal successors, (451), 337 states have internal predecessors, (451), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-12-14 15:40:17,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 475 transitions. [2022-12-14 15:40:17,720 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 475 transitions. Word has length 21 [2022-12-14 15:40:17,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:17,720 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 475 transitions. [2022-12-14 15:40:17,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:17,720 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 475 transitions. [2022-12-14 15:40:17,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 15:40:17,720 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:17,720 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-12-14 15:40:17,731 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (24)] Forceful destruction successful, exit code 0 [2022-12-14 15:40:17,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:17,921 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:17,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:17,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1468431264, now seen corresponding path program 1 times [2022-12-14 15:40:17,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:17,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [867936126] [2022-12-14 15:40:17,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:17,925 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-12-14 15:40:17,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:17,928 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:17,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (25)] Waiting until timeout for monitored process [2022-12-14 15:40:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:18,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 15:40:18,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:18,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:18,190 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:18,190 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:18,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [867936126] [2022-12-14 15:40:18,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [867936126] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:18,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:18,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:40:18,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247155539] [2022-12-14 15:40:18,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:18,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 15:40:18,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:18,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 15:40:18,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:40:18,192 INFO L87 Difference]: Start difference. First operand 354 states and 475 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:19,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:19,040 INFO L93 Difference]: Finished difference Result 692 states and 936 transitions. [2022-12-14 15:40:19,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 15:40:19,040 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-12-14 15:40:19,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:19,041 INFO L225 Difference]: With dead ends: 692 [2022-12-14 15:40:19,041 INFO L226 Difference]: Without dead ends: 692 [2022-12-14 15:40:19,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-14 15:40:19,042 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 430 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:19,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 537 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 15:40:19,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2022-12-14 15:40:19,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 420. [2022-12-14 15:40:19,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 349 states have (on average 1.5702005730659025) internal successors, (548), 399 states have internal predecessors, (548), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 16 states have call predecessors, (16), 8 states have call successors, (16) [2022-12-14 15:40:19,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 572 transitions. [2022-12-14 15:40:19,050 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 572 transitions. Word has length 22 [2022-12-14 15:40:19,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:19,050 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 572 transitions. [2022-12-14 15:40:19,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:19,050 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 572 transitions. [2022-12-14 15:40:19,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 15:40:19,050 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:19,051 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-12-14 15:40:19,057 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (25)] Ended with exit code 0 [2022-12-14 15:40:19,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:19,252 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:19,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:19,253 INFO L85 PathProgramCache]: Analyzing trace with hash 957897087, now seen corresponding path program 1 times [2022-12-14 15:40:19,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:19,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1741943941] [2022-12-14 15:40:19,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:19,255 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-12-14 15:40:19,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:19,258 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:19,261 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (26)] Waiting until timeout for monitored process [2022-12-14 15:40:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:19,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 15:40:19,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:19,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:19,571 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:19,571 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:19,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1741943941] [2022-12-14 15:40:19,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1741943941] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:19,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:19,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:40:19,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591538864] [2022-12-14 15:40:19,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:19,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 15:40:19,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:19,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 15:40:19,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:40:19,573 INFO L87 Difference]: Start difference. First operand 420 states and 572 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:20,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:20,279 INFO L93 Difference]: Finished difference Result 690 states and 932 transitions. [2022-12-14 15:40:20,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 15:40:20,280 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-12-14 15:40:20,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:20,283 INFO L225 Difference]: With dead ends: 690 [2022-12-14 15:40:20,284 INFO L226 Difference]: Without dead ends: 690 [2022-12-14 15:40:20,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-14 15:40:20,284 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 349 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:20,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 678 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 15:40:20,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2022-12-14 15:40:20,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 352. [2022-12-14 15:40:20,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 283 states have (on average 1.5795053003533568) internal successors, (447), 335 states have internal predecessors, (447), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-12-14 15:40:20,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 471 transitions. [2022-12-14 15:40:20,290 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 471 transitions. Word has length 22 [2022-12-14 15:40:20,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:20,291 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 471 transitions. [2022-12-14 15:40:20,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:20,291 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 471 transitions. [2022-12-14 15:40:20,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 15:40:20,291 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:20,291 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-12-14 15:40:20,301 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (26)] Forceful destruction successful, exit code 0 [2022-12-14 15:40:20,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:20,492 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:20,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:20,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1088139633, now seen corresponding path program 1 times [2022-12-14 15:40:20,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:20,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2025372974] [2022-12-14 15:40:20,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:20,493 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-12-14 15:40:20,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:20,493 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:20,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (27)] Waiting until timeout for monitored process [2022-12-14 15:40:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:20,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-14 15:40:20,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:20,620 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-12-14 15:40:20,623 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-12-14 15:40:20,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:20,651 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:20,651 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:20,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2025372974] [2022-12-14 15:40:20,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2025372974] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:20,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:20,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 15:40:20,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676224147] [2022-12-14 15:40:20,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:20,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 15:40:20,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:20,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 15:40:20,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-14 15:40:20,654 INFO L87 Difference]: Start difference. First operand 352 states and 471 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:21,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:21,216 INFO L93 Difference]: Finished difference Result 533 states and 704 transitions. [2022-12-14 15:40:21,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 15:40:21,217 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-12-14 15:40:21,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:21,218 INFO L225 Difference]: With dead ends: 533 [2022-12-14 15:40:21,218 INFO L226 Difference]: Without dead ends: 533 [2022-12-14 15:40:21,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-12-14 15:40:21,218 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 137 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:21,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1167 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 15:40:21,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2022-12-14 15:40:21,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 380. [2022-12-14 15:40:21,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 311 states have (on average 1.5562700964630225) internal successors, (484), 363 states have internal predecessors, (484), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-12-14 15:40:21,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 508 transitions. [2022-12-14 15:40:21,225 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 508 transitions. Word has length 22 [2022-12-14 15:40:21,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:21,225 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 508 transitions. [2022-12-14 15:40:21,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:21,225 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 508 transitions. [2022-12-14 15:40:21,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 15:40:21,226 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:21,226 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-12-14 15:40:21,237 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (27)] Ended with exit code 0 [2022-12-14 15:40:21,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:21,427 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:21,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:21,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1088139827, now seen corresponding path program 1 times [2022-12-14 15:40:21,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:21,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1715724031] [2022-12-14 15:40:21,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:21,430 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-12-14 15:40:21,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:21,433 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:21,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (28)] Waiting until timeout for monitored process [2022-12-14 15:40:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:21,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 15:40:21,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:21,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 15:40:21,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:21,666 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:21,666 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:21,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1715724031] [2022-12-14 15:40:21,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1715724031] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:21,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:21,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:40:21,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822174423] [2022-12-14 15:40:21,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:21,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:40:21,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:21,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:40:21,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:40:21,668 INFO L87 Difference]: Start difference. First operand 380 states and 508 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:22,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:22,053 INFO L93 Difference]: Finished difference Result 741 states and 980 transitions. [2022-12-14 15:40:22,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:40:22,054 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-12-14 15:40:22,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:22,055 INFO L225 Difference]: With dead ends: 741 [2022-12-14 15:40:22,055 INFO L226 Difference]: Without dead ends: 741 [2022-12-14 15:40:22,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 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-12-14 15:40:22,056 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 417 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:22,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 379 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 15:40:22,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2022-12-14 15:40:22,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 476. [2022-12-14 15:40:22,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 407 states have (on average 1.5577395577395576) internal successors, (634), 459 states have internal predecessors, (634), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-12-14 15:40:22,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 658 transitions. [2022-12-14 15:40:22,063 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 658 transitions. Word has length 22 [2022-12-14 15:40:22,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:22,063 INFO L495 AbstractCegarLoop]: Abstraction has 476 states and 658 transitions. [2022-12-14 15:40:22,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:22,063 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 658 transitions. [2022-12-14 15:40:22,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 15:40:22,063 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:22,063 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-12-14 15:40:22,070 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (28)] Ended with exit code 0 [2022-12-14 15:40:22,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:22,264 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:22,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:22,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1723293756, now seen corresponding path program 1 times [2022-12-14 15:40:22,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:22,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [565419293] [2022-12-14 15:40:22,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:22,265 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-12-14 15:40:22,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:22,266 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:22,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (29)] Waiting until timeout for monitored process [2022-12-14 15:40:22,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:22,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-14 15:40:22,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:22,404 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:40:22,405 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-12-14 15:40:22,407 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:40:22,409 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:40:22,409 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 17 treesize of output 10 [2022-12-14 15:40:22,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:22,449 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:22,449 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:22,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [565419293] [2022-12-14 15:40:22,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [565419293] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:22,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:22,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 15:40:22,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019085594] [2022-12-14 15:40:22,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:22,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 15:40:22,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:22,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 15:40:22,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-14 15:40:22,450 INFO L87 Difference]: Start difference. First operand 476 states and 658 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:23,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:23,009 INFO L93 Difference]: Finished difference Result 625 states and 841 transitions. [2022-12-14 15:40:23,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 15:40:23,010 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-12-14 15:40:23,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:23,012 INFO L225 Difference]: With dead ends: 625 [2022-12-14 15:40:23,012 INFO L226 Difference]: Without dead ends: 625 [2022-12-14 15:40:23,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-12-14 15:40:23,015 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 285 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:23,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 1440 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 15:40:23,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2022-12-14 15:40:23,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 419. [2022-12-14 15:40:23,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 354 states have (on average 1.576271186440678) internal successors, (558), 406 states have internal predecessors, (558), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2022-12-14 15:40:23,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 576 transitions. [2022-12-14 15:40:23,019 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 576 transitions. Word has length 23 [2022-12-14 15:40:23,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:23,019 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 576 transitions. [2022-12-14 15:40:23,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:23,020 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 576 transitions. [2022-12-14 15:40:23,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 15:40:23,020 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:23,020 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-12-14 15:40:23,028 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (29)] Ended with exit code 0 [2022-12-14 15:40:23,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:23,221 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:23,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:23,222 INFO L85 PathProgramCache]: Analyzing trace with hash 358486388, now seen corresponding path program 1 times [2022-12-14 15:40:23,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:23,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [144559465] [2022-12-14 15:40:23,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:23,224 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-12-14 15:40:23,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:23,227 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:23,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (30)] Waiting until timeout for monitored process [2022-12-14 15:40:23,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:23,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 15:40:23,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:23,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 15:40:23,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:23,430 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:23,430 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:23,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [144559465] [2022-12-14 15:40:23,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [144559465] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:23,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:23,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:40:23,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684964683] [2022-12-14 15:40:23,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:23,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:40:23,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:23,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:40:23,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:40:23,432 INFO L87 Difference]: Start difference. First operand 419 states and 576 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:23,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:23,801 INFO L93 Difference]: Finished difference Result 597 states and 788 transitions. [2022-12-14 15:40:23,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:40:23,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-12-14 15:40:23,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:23,805 INFO L225 Difference]: With dead ends: 597 [2022-12-14 15:40:23,806 INFO L226 Difference]: Without dead ends: 597 [2022-12-14 15:40:23,806 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-12-14 15:40:23,806 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 280 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:23,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 379 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 15:40:23,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2022-12-14 15:40:23,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 326. [2022-12-14 15:40:23,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 262 states have (on average 1.5458015267175573) internal successors, (405), 313 states have internal predecessors, (405), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2022-12-14 15:40:23,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 423 transitions. [2022-12-14 15:40:23,814 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 423 transitions. Word has length 23 [2022-12-14 15:40:23,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:23,815 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 423 transitions. [2022-12-14 15:40:23,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:23,815 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 423 transitions. [2022-12-14 15:40:23,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 15:40:23,815 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:23,815 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:40:23,825 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (30)] Forceful destruction successful, exit code 0 [2022-12-14 15:40:24,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:24,017 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:24,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:24,018 INFO L85 PathProgramCache]: Analyzing trace with hash -693515938, now seen corresponding path program 1 times [2022-12-14 15:40:24,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:24,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [397751634] [2022-12-14 15:40:24,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:24,020 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-12-14 15:40:24,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:24,023 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:24,026 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (31)] Waiting until timeout for monitored process [2022-12-14 15:40:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:24,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 15:40:24,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:24,095 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-12-14 15:40:24,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:24,124 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:24,124 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:24,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [397751634] [2022-12-14 15:40:24,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [397751634] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:24,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:24,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:40:24,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332753448] [2022-12-14 15:40:24,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:24,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 15:40:24,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:24,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 15:40:24,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:40:24,125 INFO L87 Difference]: Start difference. First operand 326 states and 423 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:24,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:24,453 INFO L93 Difference]: Finished difference Result 399 states and 506 transitions. [2022-12-14 15:40:24,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 15:40:24,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-12-14 15:40:24,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:24,454 INFO L225 Difference]: With dead ends: 399 [2022-12-14 15:40:24,454 INFO L226 Difference]: Without dead ends: 399 [2022-12-14 15:40:24,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 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-12-14 15:40:24,455 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 300 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:24,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 351 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:40:24,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2022-12-14 15:40:24,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 325. [2022-12-14 15:40:24,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 262 states have (on average 1.5381679389312977) internal successors, (403), 312 states have internal predecessors, (403), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2022-12-14 15:40:24,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 421 transitions. [2022-12-14 15:40:24,458 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 421 transitions. Word has length 28 [2022-12-14 15:40:24,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:24,458 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 421 transitions. [2022-12-14 15:40:24,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:24,458 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 421 transitions. [2022-12-14 15:40:24,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 15:40:24,459 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:24,459 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:40:24,469 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (31)] Ended with exit code 0 [2022-12-14 15:40:24,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:24,659 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:24,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:24,660 INFO L85 PathProgramCache]: Analyzing trace with hash -693515937, now seen corresponding path program 1 times [2022-12-14 15:40:24,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:24,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1258394707] [2022-12-14 15:40:24,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:24,660 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-12-14 15:40:24,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:24,661 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:24,661 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (32)] Waiting until timeout for monitored process [2022-12-14 15:40:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:24,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 15:40:24,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:24,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 15:40:24,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:24,797 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:24,797 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:24,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1258394707] [2022-12-14 15:40:24,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1258394707] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:24,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:24,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:40:24,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932569150] [2022-12-14 15:40:24,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:24,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 15:40:24,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:24,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 15:40:24,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:40:24,798 INFO L87 Difference]: Start difference. First operand 325 states and 421 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:25,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:25,132 INFO L93 Difference]: Finished difference Result 324 states and 419 transitions. [2022-12-14 15:40:25,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 15:40:25,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-12-14 15:40:25,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:25,133 INFO L225 Difference]: With dead ends: 324 [2022-12-14 15:40:25,133 INFO L226 Difference]: Without dead ends: 324 [2022-12-14 15:40:25,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 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-12-14 15:40:25,134 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 330 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:25,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 249 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:40:25,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-12-14 15:40:25,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2022-12-14 15:40:25,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 262 states have (on average 1.5305343511450382) internal successors, (401), 311 states have internal predecessors, (401), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2022-12-14 15:40:25,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 419 transitions. [2022-12-14 15:40:25,137 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 419 transitions. Word has length 28 [2022-12-14 15:40:25,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:25,137 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 419 transitions. [2022-12-14 15:40:25,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:25,137 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 419 transitions. [2022-12-14 15:40:25,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 15:40:25,137 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:25,137 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:40:25,144 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (32)] Ended with exit code 0 [2022-12-14 15:40:25,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:25,338 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:25,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:25,340 INFO L85 PathProgramCache]: Analyzing trace with hash -748882625, now seen corresponding path program 1 times [2022-12-14 15:40:25,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:25,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [611232805] [2022-12-14 15:40:25,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:25,341 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-12-14 15:40:25,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:25,344 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:25,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (33)] Waiting until timeout for monitored process [2022-12-14 15:40:25,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:25,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 15:40:25,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:25,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:25,514 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:25,515 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:25,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [611232805] [2022-12-14 15:40:25,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [611232805] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:25,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:25,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:40:25,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051171390] [2022-12-14 15:40:25,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:25,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:40:25,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:25,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:40:25,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:40:25,516 INFO L87 Difference]: Start difference. First operand 324 states and 419 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:25,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:25,840 INFO L93 Difference]: Finished difference Result 612 states and 749 transitions. [2022-12-14 15:40:25,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 15:40:25,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-12-14 15:40:25,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:25,841 INFO L225 Difference]: With dead ends: 612 [2022-12-14 15:40:25,842 INFO L226 Difference]: Without dead ends: 612 [2022-12-14 15:40:25,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:40:25,842 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 411 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:25,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 314 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:40:25,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2022-12-14 15:40:25,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 321. [2022-12-14 15:40:25,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 262 states have (on average 1.4885496183206106) internal successors, (390), 308 states have internal predecessors, (390), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2022-12-14 15:40:25,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 408 transitions. [2022-12-14 15:40:25,846 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 408 transitions. Word has length 30 [2022-12-14 15:40:25,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:25,846 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 408 transitions. [2022-12-14 15:40:25,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:25,846 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 408 transitions. [2022-12-14 15:40:25,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 15:40:25,847 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:25,847 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:40:25,855 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (33)] Ended with exit code 0 [2022-12-14 15:40:26,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:26,048 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:26,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:26,049 INFO L85 PathProgramCache]: Analyzing trace with hash -748882624, now seen corresponding path program 1 times [2022-12-14 15:40:26,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:26,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [692133737] [2022-12-14 15:40:26,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:26,051 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-12-14 15:40:26,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:26,055 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:26,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (34)] Waiting until timeout for monitored process [2022-12-14 15:40:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:26,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-14 15:40:26,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:26,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:26,395 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:26,396 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:26,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [692133737] [2022-12-14 15:40:26,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [692133737] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:26,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:26,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 15:40:26,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671401623] [2022-12-14 15:40:26,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:26,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 15:40:26,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:26,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 15:40:26,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-14 15:40:26,397 INFO L87 Difference]: Start difference. First operand 321 states and 408 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:27,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:27,220 INFO L93 Difference]: Finished difference Result 728 states and 925 transitions. [2022-12-14 15:40:27,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 15:40:27,220 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-12-14 15:40:27,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:27,222 INFO L225 Difference]: With dead ends: 728 [2022-12-14 15:40:27,222 INFO L226 Difference]: Without dead ends: 728 [2022-12-14 15:40:27,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-12-14 15:40:27,222 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 738 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:27,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 689 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 15:40:27,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2022-12-14 15:40:27,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 447. [2022-12-14 15:40:27,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 388 states have (on average 1.5025773195876289) internal successors, (583), 434 states have internal predecessors, (583), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2022-12-14 15:40:27,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 601 transitions. [2022-12-14 15:40:27,228 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 601 transitions. Word has length 30 [2022-12-14 15:40:27,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:27,228 INFO L495 AbstractCegarLoop]: Abstraction has 447 states and 601 transitions. [2022-12-14 15:40:27,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:27,228 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 601 transitions. [2022-12-14 15:40:27,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 15:40:27,228 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:27,228 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:40:27,235 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (34)] Ended with exit code 0 [2022-12-14 15:40:27,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:27,429 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:27,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:27,430 INFO L85 PathProgramCache]: Analyzing trace with hash -748882463, now seen corresponding path program 1 times [2022-12-14 15:40:27,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:27,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1699117880] [2022-12-14 15:40:27,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:27,432 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-12-14 15:40:27,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:27,434 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:27,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (35)] Waiting until timeout for monitored process [2022-12-14 15:40:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:27,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 15:40:27,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:27,577 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 15:40:27,577 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 12 treesize of output 14 [2022-12-14 15:40:27,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:27,680 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:27,680 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:27,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1699117880] [2022-12-14 15:40:27,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1699117880] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:27,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:27,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:40:27,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509313236] [2022-12-14 15:40:27,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:27,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:40:27,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:27,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:40:27,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:40:27,682 INFO L87 Difference]: Start difference. First operand 447 states and 601 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:27,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:27,944 INFO L93 Difference]: Finished difference Result 444 states and 595 transitions. [2022-12-14 15:40:27,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:40:27,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-12-14 15:40:27,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:27,945 INFO L225 Difference]: With dead ends: 444 [2022-12-14 15:40:27,945 INFO L226 Difference]: Without dead ends: 444 [2022-12-14 15:40:27,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:40:27,946 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 264 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:27,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 140 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:40:27,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2022-12-14 15:40:27,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 318. [2022-12-14 15:40:27,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 262 states have (on average 1.465648854961832) internal successors, (384), 305 states have internal predecessors, (384), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2022-12-14 15:40:27,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 402 transitions. [2022-12-14 15:40:27,951 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 402 transitions. Word has length 30 [2022-12-14 15:40:27,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:27,951 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 402 transitions. [2022-12-14 15:40:27,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:27,951 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 402 transitions. [2022-12-14 15:40:27,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-14 15:40:27,951 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:27,951 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:40:27,959 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (35)] Ended with exit code 0 [2022-12-14 15:40:28,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:28,152 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:28,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:28,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1521758729, now seen corresponding path program 1 times [2022-12-14 15:40:28,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:28,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [141525987] [2022-12-14 15:40:28,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:28,156 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-12-14 15:40:28,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:28,160 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:28,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (36)] Waiting until timeout for monitored process [2022-12-14 15:40:28,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:28,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-14 15:40:28,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:28,266 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-12-14 15:40:28,362 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 11 [2022-12-14 15:40:28,419 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 27 treesize of output 11 [2022-12-14 15:40:28,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:28,437 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:28,437 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:28,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [141525987] [2022-12-14 15:40:28,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [141525987] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:28,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:28,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 15:40:28,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899980348] [2022-12-14 15:40:28,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:28,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 15:40:28,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:28,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 15:40:28,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-14 15:40:28,439 INFO L87 Difference]: Start difference. First operand 318 states and 402 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:30,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:30,057 INFO L93 Difference]: Finished difference Result 898 states and 1137 transitions. [2022-12-14 15:40:30,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 15:40:30,057 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-12-14 15:40:30,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:30,059 INFO L225 Difference]: With dead ends: 898 [2022-12-14 15:40:30,059 INFO L226 Difference]: Without dead ends: 898 [2022-12-14 15:40:30,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2022-12-14 15:40:30,059 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 487 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:30,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 880 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-14 15:40:30,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2022-12-14 15:40:30,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 438. [2022-12-14 15:40:30,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 375 states have (on average 1.44) internal successors, (540), 421 states have internal predecessors, (540), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2022-12-14 15:40:30,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 570 transitions. [2022-12-14 15:40:30,065 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 570 transitions. Word has length 41 [2022-12-14 15:40:30,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:30,065 INFO L495 AbstractCegarLoop]: Abstraction has 438 states and 570 transitions. [2022-12-14 15:40:30,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:30,066 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 570 transitions. [2022-12-14 15:40:30,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-14 15:40:30,066 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:30,066 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:40:30,074 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (36)] Forceful destruction successful, exit code 0 [2022-12-14 15:40:30,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:30,267 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:30,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:30,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1521758728, now seen corresponding path program 1 times [2022-12-14 15:40:30,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:30,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1349621234] [2022-12-14 15:40:30,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:30,270 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-12-14 15:40:30,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:30,273 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:30,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (37)] Waiting until timeout for monitored process [2022-12-14 15:40:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:30,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-14 15:40:30,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:30,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 15:40:30,719 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 11 [2022-12-14 15:40:30,724 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 11 [2022-12-14 15:40:30,828 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 9 [2022-12-14 15:40:30,831 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 7 [2022-12-14 15:40:30,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:30,868 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:30,868 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:30,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1349621234] [2022-12-14 15:40:30,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1349621234] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:30,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:30,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 15:40:30,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041099462] [2022-12-14 15:40:30,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:30,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 15:40:30,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:30,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 15:40:30,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-14 15:40:30,870 INFO L87 Difference]: Start difference. First operand 438 states and 570 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:32,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:32,591 INFO L93 Difference]: Finished difference Result 948 states and 1202 transitions. [2022-12-14 15:40:32,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 15:40:32,591 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-12-14 15:40:32,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:32,593 INFO L225 Difference]: With dead ends: 948 [2022-12-14 15:40:32,593 INFO L226 Difference]: Without dead ends: 948 [2022-12-14 15:40:32,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-12-14 15:40:32,593 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 526 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:32,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 926 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-12-14 15:40:32,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2022-12-14 15:40:32,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 487. [2022-12-14 15:40:32,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 420 states have (on average 1.4523809523809523) internal successors, (610), 468 states have internal predecessors, (610), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2022-12-14 15:40:32,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 646 transitions. [2022-12-14 15:40:32,599 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 646 transitions. Word has length 41 [2022-12-14 15:40:32,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:32,600 INFO L495 AbstractCegarLoop]: Abstraction has 487 states and 646 transitions. [2022-12-14 15:40:32,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:32,600 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 646 transitions. [2022-12-14 15:40:32,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-14 15:40:32,600 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:32,600 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:40:32,607 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (37)] Ended with exit code 0 [2022-12-14 15:40:32,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:32,801 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:32,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:32,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1519911687, now seen corresponding path program 1 times [2022-12-14 15:40:32,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:32,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1961497264] [2022-12-14 15:40:32,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:32,803 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-12-14 15:40:32,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:32,804 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:32,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (38)] Waiting until timeout for monitored process [2022-12-14 15:40:32,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:32,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-14 15:40:32,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:32,994 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 15:40:32,995 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-12-14 15:40:33,093 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 15 treesize of output 11 [2022-12-14 15:40:33,097 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 15 treesize of output 11 [2022-12-14 15:40:33,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 15:40:33,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 15:40:33,209 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 19 treesize of output 7 [2022-12-14 15:40:33,212 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 19 treesize of output 7 [2022-12-14 15:40:33,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:33,226 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:33,226 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:33,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1961497264] [2022-12-14 15:40:33,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1961497264] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:33,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:33,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 15:40:33,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231063300] [2022-12-14 15:40:33,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:33,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 15:40:33,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:33,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 15:40:33,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:40:33,227 INFO L87 Difference]: Start difference. First operand 487 states and 646 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:34,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:34,712 INFO L93 Difference]: Finished difference Result 953 states and 1167 transitions. [2022-12-14 15:40:34,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 15:40:34,713 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-12-14 15:40:34,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:34,714 INFO L225 Difference]: With dead ends: 953 [2022-12-14 15:40:34,714 INFO L226 Difference]: Without dead ends: 953 [2022-12-14 15:40:34,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2022-12-14 15:40:34,715 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 766 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:34,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 1151 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-12-14 15:40:34,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2022-12-14 15:40:34,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 492. [2022-12-14 15:40:34,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 425 states have (on average 1.4470588235294117) internal successors, (615), 473 states have internal predecessors, (615), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2022-12-14 15:40:34,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 651 transitions. [2022-12-14 15:40:34,722 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 651 transitions. Word has length 41 [2022-12-14 15:40:34,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:34,722 INFO L495 AbstractCegarLoop]: Abstraction has 492 states and 651 transitions. [2022-12-14 15:40:34,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:34,722 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 651 transitions. [2022-12-14 15:40:34,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 15:40:34,723 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:34,723 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:40:34,733 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (38)] Forceful destruction successful, exit code 0 [2022-12-14 15:40:34,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:34,923 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:34,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:34,924 INFO L85 PathProgramCache]: Analyzing trace with hash -565670668, now seen corresponding path program 1 times [2022-12-14 15:40:34,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:34,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1739025757] [2022-12-14 15:40:34,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:34,925 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-12-14 15:40:34,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:34,926 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:34,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (39)] Waiting until timeout for monitored process [2022-12-14 15:40:35,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:35,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-14 15:40:35,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:35,058 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-12-14 15:40:35,200 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 11 [2022-12-14 15:40:35,242 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 27 treesize of output 11 [2022-12-14 15:40:35,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:35,265 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:35,265 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:35,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1739025757] [2022-12-14 15:40:35,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1739025757] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:35,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:35,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-14 15:40:35,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108079410] [2022-12-14 15:40:35,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:35,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 15:40:35,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:35,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 15:40:35,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-14 15:40:35,266 INFO L87 Difference]: Start difference. First operand 492 states and 651 transitions. Second operand has 11 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:36,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:36,807 INFO L93 Difference]: Finished difference Result 970 states and 1264 transitions. [2022-12-14 15:40:36,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 15:40:36,807 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-12-14 15:40:36,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:36,809 INFO L225 Difference]: With dead ends: 970 [2022-12-14 15:40:36,809 INFO L226 Difference]: Without dead ends: 970 [2022-12-14 15:40:36,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2022-12-14 15:40:36,809 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 822 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:36,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 945 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-12-14 15:40:36,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2022-12-14 15:40:36,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 549. [2022-12-14 15:40:36,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 474 states have (on average 1.4451476793248945) internal successors, (685), 526 states have internal predecessors, (685), 16 states have call successors, (16), 8 states have call predecessors, (16), 16 states have return successors, (32), 14 states have call predecessors, (32), 16 states have call successors, (32) [2022-12-14 15:40:36,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 733 transitions. [2022-12-14 15:40:36,815 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 733 transitions. Word has length 42 [2022-12-14 15:40:36,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:36,816 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 733 transitions. [2022-12-14 15:40:36,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:36,816 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 733 transitions. [2022-12-14 15:40:36,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 15:40:36,816 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:36,816 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:40:36,824 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (39)] Ended with exit code 0 [2022-12-14 15:40:37,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:37,017 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:37,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:37,019 INFO L85 PathProgramCache]: Analyzing trace with hash -565670667, now seen corresponding path program 1 times [2022-12-14 15:40:37,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:37,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [104222419] [2022-12-14 15:40:37,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:37,020 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-12-14 15:40:37,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:37,023 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:37,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (40)] Waiting until timeout for monitored process [2022-12-14 15:40:37,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:37,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-14 15:40:37,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:37,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 15:40:37,497 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 11 [2022-12-14 15:40:37,503 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 11 [2022-12-14 15:40:37,601 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 9 [2022-12-14 15:40:37,606 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 7 [2022-12-14 15:40:37,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:37,664 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:37,664 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:37,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [104222419] [2022-12-14 15:40:37,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [104222419] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:37,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:37,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-14 15:40:37,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798930808] [2022-12-14 15:40:37,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:37,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 15:40:37,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:37,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 15:40:37,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-14 15:40:37,665 INFO L87 Difference]: Start difference. First operand 549 states and 733 transitions. Second operand has 11 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:39,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:39,247 INFO L93 Difference]: Finished difference Result 929 states and 1217 transitions. [2022-12-14 15:40:39,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 15:40:39,248 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-12-14 15:40:39,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:39,249 INFO L225 Difference]: With dead ends: 929 [2022-12-14 15:40:39,249 INFO L226 Difference]: Without dead ends: 929 [2022-12-14 15:40:39,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2022-12-14 15:40:39,250 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 913 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:39,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 912 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-14 15:40:39,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2022-12-14 15:40:39,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 498. [2022-12-14 15:40:39,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 431 states have (on average 1.445475638051044) internal successors, (623), 479 states have internal predecessors, (623), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2022-12-14 15:40:39,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 659 transitions. [2022-12-14 15:40:39,259 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 659 transitions. Word has length 42 [2022-12-14 15:40:39,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:39,259 INFO L495 AbstractCegarLoop]: Abstraction has 498 states and 659 transitions. [2022-12-14 15:40:39,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:39,259 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 659 transitions. [2022-12-14 15:40:39,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 15:40:39,260 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:39,260 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:40:39,270 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (40)] Ended with exit code 0 [2022-12-14 15:40:39,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:39,461 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:39,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:39,463 INFO L85 PathProgramCache]: Analyzing trace with hash -563823626, now seen corresponding path program 1 times [2022-12-14 15:40:39,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:39,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1688587821] [2022-12-14 15:40:39,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:39,465 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-12-14 15:40:39,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:39,469 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:39,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (41)] Waiting until timeout for monitored process [2022-12-14 15:40:39,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:39,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-14 15:40:39,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:39,764 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 15:40:39,764 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-12-14 15:40:39,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 15:40:39,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 15:40:40,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 15:40:40,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 15:40:40,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:40:40,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-14 15:40:40,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:40:40,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-14 15:40:40,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:40:40,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-14 15:40:40,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:40:40,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-14 15:40:40,142 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:40:40,142 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-12-14 15:40:40,145 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:40:40,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-12-14 15:40:40,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:40,158 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:40,158 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:40,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1688587821] [2022-12-14 15:40:40,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1688587821] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:40,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:40,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 15:40:40,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099217379] [2022-12-14 15:40:40,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:40,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 15:40:40,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:40,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 15:40:40,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-14 15:40:40,160 INFO L87 Difference]: Start difference. First operand 498 states and 659 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:40,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:40,707 INFO L93 Difference]: Finished difference Result 519 states and 680 transitions. [2022-12-14 15:40:40,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 15:40:40,707 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-12-14 15:40:40,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:40,708 INFO L225 Difference]: With dead ends: 519 [2022-12-14 15:40:40,708 INFO L226 Difference]: Without dead ends: 519 [2022-12-14 15:40:40,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-12-14 15:40:40,709 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 94 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:40,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 585 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 15:40:40,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-12-14 15:40:40,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 514. [2022-12-14 15:40:40,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 447 states have (on average 1.429530201342282) internal successors, (639), 495 states have internal predecessors, (639), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2022-12-14 15:40:40,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 675 transitions. [2022-12-14 15:40:40,713 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 675 transitions. Word has length 42 [2022-12-14 15:40:40,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:40,713 INFO L495 AbstractCegarLoop]: Abstraction has 514 states and 675 transitions. [2022-12-14 15:40:40,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:40,713 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 675 transitions. [2022-12-14 15:40:40,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 15:40:40,714 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:40,714 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:40:40,722 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (41)] Ended with exit code 0 [2022-12-14 15:40:40,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:40,915 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:40,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:40,916 INFO L85 PathProgramCache]: Analyzing trace with hash 204373270, now seen corresponding path program 1 times [2022-12-14 15:40:40,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:40,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [657556806] [2022-12-14 15:40:40,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:40,917 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-12-14 15:40:40,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:40,920 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:40,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (42)] Waiting until timeout for monitored process [2022-12-14 15:40:41,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:41,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-14 15:40:41,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:41,241 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 15:40:41,241 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-12-14 15:40:41,544 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:40:41,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-12-14 15:40:41,554 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:40:41,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-12-14 15:40:41,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:40:41,632 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 36 treesize of output 38 [2022-12-14 15:40:41,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:40:41,642 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 42 treesize of output 38 [2022-12-14 15:40:41,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-12-14 15:40:41,732 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 7 treesize of output 3 [2022-12-14 15:40:41,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2022-12-14 15:40:41,741 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 23 treesize of output 15 [2022-12-14 15:40:41,845 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 19 treesize of output 7 [2022-12-14 15:40:41,848 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 19 treesize of output 7 [2022-12-14 15:40:41,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:41,877 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:41,878 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:41,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [657556806] [2022-12-14 15:40:41,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [657556806] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:41,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:41,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-14 15:40:41,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380490837] [2022-12-14 15:40:41,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:41,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 15:40:41,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:41,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 15:40:41,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-12-14 15:40:41,879 INFO L87 Difference]: Start difference. First operand 514 states and 675 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:43,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:43,754 INFO L93 Difference]: Finished difference Result 528 states and 689 transitions. [2022-12-14 15:40:43,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 15:40:43,754 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-12-14 15:40:43,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:43,756 INFO L225 Difference]: With dead ends: 528 [2022-12-14 15:40:43,756 INFO L226 Difference]: Without dead ends: 528 [2022-12-14 15:40:43,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2022-12-14 15:40:43,757 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 61 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1350 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:43,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1350 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-14 15:40:43,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2022-12-14 15:40:43,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 514. [2022-12-14 15:40:43,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 447 states have (on average 1.429530201342282) internal successors, (639), 495 states have internal predecessors, (639), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2022-12-14 15:40:43,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 675 transitions. [2022-12-14 15:40:43,766 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 675 transitions. Word has length 42 [2022-12-14 15:40:43,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:43,766 INFO L495 AbstractCegarLoop]: Abstraction has 514 states and 675 transitions. [2022-12-14 15:40:43,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:43,766 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 675 transitions. [2022-12-14 15:40:43,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-14 15:40:43,767 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:43,767 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:40:43,775 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (42)] Ended with exit code 0 [2022-12-14 15:40:43,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:43,968 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:43,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:43,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1739824239, now seen corresponding path program 1 times [2022-12-14 15:40:43,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:43,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1300403541] [2022-12-14 15:40:43,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:43,971 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-12-14 15:40:43,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:43,974 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:43,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (43)] Waiting until timeout for monitored process [2022-12-14 15:40:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:44,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-14 15:40:44,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:44,091 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-12-14 15:40:44,291 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 11 [2022-12-14 15:40:44,351 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 27 treesize of output 11 [2022-12-14 15:40:44,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:44,381 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:44,381 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:44,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1300403541] [2022-12-14 15:40:44,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1300403541] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:44,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:44,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 15:40:44,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298068108] [2022-12-14 15:40:44,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:44,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 15:40:44,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:44,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 15:40:44,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-14 15:40:44,383 INFO L87 Difference]: Start difference. First operand 514 states and 675 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:45,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:45,724 INFO L93 Difference]: Finished difference Result 912 states and 1187 transitions. [2022-12-14 15:40:45,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 15:40:45,724 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-12-14 15:40:45,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:45,726 INFO L225 Difference]: With dead ends: 912 [2022-12-14 15:40:45,726 INFO L226 Difference]: Without dead ends: 912 [2022-12-14 15:40:45,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2022-12-14 15:40:45,726 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 587 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:45,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 724 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-14 15:40:45,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2022-12-14 15:40:45,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 611. [2022-12-14 15:40:45,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 528 states have (on average 1.4299242424242424) internal successors, (755), 584 states have internal predecessors, (755), 20 states have call successors, (20), 10 states have call predecessors, (20), 20 states have return successors, (40), 16 states have call predecessors, (40), 20 states have call successors, (40) [2022-12-14 15:40:45,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 815 transitions. [2022-12-14 15:40:45,733 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 815 transitions. Word has length 43 [2022-12-14 15:40:45,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:45,733 INFO L495 AbstractCegarLoop]: Abstraction has 611 states and 815 transitions. [2022-12-14 15:40:45,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:45,733 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 815 transitions. [2022-12-14 15:40:45,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-14 15:40:45,733 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:45,733 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:40:45,745 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (43)] Ended with exit code 0 [2022-12-14 15:40:45,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:45,934 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:45,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:45,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1739824238, now seen corresponding path program 1 times [2022-12-14 15:40:45,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:45,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [438936123] [2022-12-14 15:40:45,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:45,937 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-12-14 15:40:45,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:45,940 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:45,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (44)] Waiting until timeout for monitored process [2022-12-14 15:40:46,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:46,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-14 15:40:46,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:46,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 15:40:46,282 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 11 [2022-12-14 15:40:46,287 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 11 [2022-12-14 15:40:46,369 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 7 [2022-12-14 15:40:46,372 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 9 [2022-12-14 15:40:46,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:46,416 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:46,416 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:46,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [438936123] [2022-12-14 15:40:46,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [438936123] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:46,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:46,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 15:40:46,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495846074] [2022-12-14 15:40:46,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:46,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 15:40:46,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:46,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 15:40:46,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-14 15:40:46,418 INFO L87 Difference]: Start difference. First operand 611 states and 815 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:47,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:47,621 INFO L93 Difference]: Finished difference Result 901 states and 1187 transitions. [2022-12-14 15:40:47,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 15:40:47,622 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-12-14 15:40:47,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:47,624 INFO L225 Difference]: With dead ends: 901 [2022-12-14 15:40:47,624 INFO L226 Difference]: Without dead ends: 901 [2022-12-14 15:40:47,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2022-12-14 15:40:47,624 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 677 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:47,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [677 Valid, 695 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-14 15:40:47,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2022-12-14 15:40:47,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 692. [2022-12-14 15:40:47,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 601 states have (on average 1.4492512479201332) internal successors, (871), 661 states have internal predecessors, (871), 24 states have call successors, (24), 12 states have call predecessors, (24), 24 states have return successors, (48), 18 states have call predecessors, (48), 24 states have call successors, (48) [2022-12-14 15:40:47,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 943 transitions. [2022-12-14 15:40:47,636 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 943 transitions. Word has length 43 [2022-12-14 15:40:47,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:47,636 INFO L495 AbstractCegarLoop]: Abstraction has 692 states and 943 transitions. [2022-12-14 15:40:47,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:47,636 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 943 transitions. [2022-12-14 15:40:47,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-14 15:40:47,637 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:47,637 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:40:47,645 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (44)] Ended with exit code 0 [2022-12-14 15:40:47,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:47,838 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:47,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:47,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1406660791, now seen corresponding path program 1 times [2022-12-14 15:40:47,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:47,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690940982] [2022-12-14 15:40:47,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:47,841 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-12-14 15:40:47,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:47,844 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:47,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (45)] Waiting until timeout for monitored process [2022-12-14 15:40:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:47,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-14 15:40:47,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:48,009 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-12-14 15:40:48,256 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 11 [2022-12-14 15:40:48,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:40:48,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2022-12-14 15:40:48,375 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-12-14 15:40:48,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:48,391 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:48,391 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:48,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690940982] [2022-12-14 15:40:48,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1690940982] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:48,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:48,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-14 15:40:48,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246768430] [2022-12-14 15:40:48,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:48,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 15:40:48,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:48,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 15:40:48,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-12-14 15:40:48,393 INFO L87 Difference]: Start difference. First operand 692 states and 943 transitions. Second operand has 11 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:50,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:50,187 INFO L93 Difference]: Finished difference Result 1370 states and 1825 transitions. [2022-12-14 15:40:50,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 15:40:50,188 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-12-14 15:40:50,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:50,190 INFO L225 Difference]: With dead ends: 1370 [2022-12-14 15:40:50,190 INFO L226 Difference]: Without dead ends: 1370 [2022-12-14 15:40:50,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2022-12-14 15:40:50,191 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 629 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:50,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 1414 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1022 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-12-14 15:40:50,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2022-12-14 15:40:50,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 820. [2022-12-14 15:40:50,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 713 states have (on average 1.4361851332398317) internal successors, (1024), 781 states have internal predecessors, (1024), 32 states have call successors, (32), 16 states have call predecessors, (32), 32 states have return successors, (64), 22 states have call predecessors, (64), 32 states have call successors, (64) [2022-12-14 15:40:50,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1120 transitions. [2022-12-14 15:40:50,206 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1120 transitions. Word has length 43 [2022-12-14 15:40:50,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:50,206 INFO L495 AbstractCegarLoop]: Abstraction has 820 states and 1120 transitions. [2022-12-14 15:40:50,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:50,206 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1120 transitions. [2022-12-14 15:40:50,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-14 15:40:50,207 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:50,207 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:40:50,215 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (45)] Ended with exit code 0 [2022-12-14 15:40:50,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:50,408 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:50,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:50,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1406660792, now seen corresponding path program 1 times [2022-12-14 15:40:50,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:50,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [872613648] [2022-12-14 15:40:50,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:50,411 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-12-14 15:40:50,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:50,414 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:50,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (46)] Waiting until timeout for monitored process [2022-12-14 15:40:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:50,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-14 15:40:50,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:50,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 15:40:51,003 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 11 [2022-12-14 15:40:51,009 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 11 [2022-12-14 15:40:51,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:40:51,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-12-14 15:40:51,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:40:51,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-12-14 15:40:51,202 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 21 treesize of output 9 [2022-12-14 15:40:51,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-14 15:40:51,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:51,245 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:51,245 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:51,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [872613648] [2022-12-14 15:40:51,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [872613648] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:51,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:51,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-14 15:40:51,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335446839] [2022-12-14 15:40:51,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:51,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 15:40:51,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:51,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 15:40:51,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-12-14 15:40:51,247 INFO L87 Difference]: Start difference. First operand 820 states and 1120 transitions. Second operand has 11 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:53,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:53,364 INFO L93 Difference]: Finished difference Result 1523 states and 2064 transitions. [2022-12-14 15:40:53,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 15:40:53,365 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-12-14 15:40:53,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:53,373 INFO L225 Difference]: With dead ends: 1523 [2022-12-14 15:40:53,373 INFO L226 Difference]: Without dead ends: 1523 [2022-12-14 15:40:53,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2022-12-14 15:40:53,374 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 673 mSDsluCounter, 1353 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 1640 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:53,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 1640 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-12-14 15:40:53,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2022-12-14 15:40:53,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 723. [2022-12-14 15:40:53,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 632 states have (on average 1.4367088607594938) internal successors, (908), 692 states have internal predecessors, (908), 24 states have call successors, (24), 12 states have call predecessors, (24), 24 states have return successors, (48), 18 states have call predecessors, (48), 24 states have call successors, (48) [2022-12-14 15:40:53,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 980 transitions. [2022-12-14 15:40:53,390 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 980 transitions. Word has length 43 [2022-12-14 15:40:53,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:53,391 INFO L495 AbstractCegarLoop]: Abstraction has 723 states and 980 transitions. [2022-12-14 15:40:53,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:53,391 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 980 transitions. [2022-12-14 15:40:53,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-14 15:40:53,391 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:53,392 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:40:53,399 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (46)] Ended with exit code 0 [2022-12-14 15:40:53,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:53,593 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:53,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:53,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1842763864, now seen corresponding path program 1 times [2022-12-14 15:40:53,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:53,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1187835700] [2022-12-14 15:40:53,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:53,595 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-12-14 15:40:53,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:53,598 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:53,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (47)] Waiting until timeout for monitored process [2022-12-14 15:40:53,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:53,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-14 15:40:53,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:53,890 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 15 treesize of output 11 [2022-12-14 15:40:53,934 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-12-14 15:40:53,934 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 28 treesize of output 27 [2022-12-14 15:40:53,978 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 24 treesize of output 8 [2022-12-14 15:40:54,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:54,005 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:54,005 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:54,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1187835700] [2022-12-14 15:40:54,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1187835700] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:54,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:54,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 15:40:54,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238485030] [2022-12-14 15:40:54,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:54,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 15:40:54,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:54,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 15:40:54,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-12-14 15:40:54,006 INFO L87 Difference]: Start difference. First operand 723 states and 980 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:55,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:55,060 INFO L93 Difference]: Finished difference Result 1166 states and 1554 transitions. [2022-12-14 15:40:55,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 15:40:55,061 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-12-14 15:40:55,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:55,063 INFO L225 Difference]: With dead ends: 1166 [2022-12-14 15:40:55,064 INFO L226 Difference]: Without dead ends: 1166 [2022-12-14 15:40:55,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=463, Unknown=0, NotChecked=0, Total=600 [2022-12-14 15:40:55,064 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 924 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:55,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 1224 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 15:40:55,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2022-12-14 15:40:55,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 819. [2022-12-14 15:40:55,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 716 states have (on average 1.4427374301675977) internal successors, (1033), 782 states have internal predecessors, (1033), 30 states have call successors, (30), 15 states have call predecessors, (30), 30 states have return successors, (60), 21 states have call predecessors, (60), 30 states have call successors, (60) [2022-12-14 15:40:55,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1123 transitions. [2022-12-14 15:40:55,077 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1123 transitions. Word has length 44 [2022-12-14 15:40:55,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:55,077 INFO L495 AbstractCegarLoop]: Abstraction has 819 states and 1123 transitions. [2022-12-14 15:40:55,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:55,077 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1123 transitions. [2022-12-14 15:40:55,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-14 15:40:55,077 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:55,077 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:40:55,085 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (47)] Ended with exit code 0 [2022-12-14 15:40:55,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:55,278 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:55,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:55,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1900022166, now seen corresponding path program 1 times [2022-12-14 15:40:55,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:55,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2050922248] [2022-12-14 15:40:55,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:55,281 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-12-14 15:40:55,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:55,284 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:55,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (48)] Waiting until timeout for monitored process [2022-12-14 15:40:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:55,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-14 15:40:55,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:55,617 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 15 treesize of output 11 [2022-12-14 15:40:55,666 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 24 treesize of output 8 [2022-12-14 15:40:55,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:55,688 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:55,688 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:55,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2050922248] [2022-12-14 15:40:55,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2050922248] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:55,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:55,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-14 15:40:55,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049183942] [2022-12-14 15:40:55,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:55,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 15:40:55,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:55,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 15:40:55,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-14 15:40:55,689 INFO L87 Difference]: Start difference. First operand 819 states and 1123 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:56,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:56,339 INFO L93 Difference]: Finished difference Result 1203 states and 1629 transitions. [2022-12-14 15:40:56,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 15:40:56,340 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-12-14 15:40:56,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:56,342 INFO L225 Difference]: With dead ends: 1203 [2022-12-14 15:40:56,342 INFO L226 Difference]: Without dead ends: 1203 [2022-12-14 15:40:56,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2022-12-14 15:40:56,342 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 673 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:56,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 840 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 15:40:56,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2022-12-14 15:40:56,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 997. [2022-12-14 15:40:56,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 997 states, 870 states have (on average 1.4540229885057472) internal successors, (1265), 948 states have internal predecessors, (1265), 42 states have call successors, (42), 21 states have call predecessors, (42), 42 states have return successors, (84), 27 states have call predecessors, (84), 42 states have call successors, (84) [2022-12-14 15:40:56,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1391 transitions. [2022-12-14 15:40:56,353 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1391 transitions. Word has length 44 [2022-12-14 15:40:56,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:56,353 INFO L495 AbstractCegarLoop]: Abstraction has 997 states and 1391 transitions. [2022-12-14 15:40:56,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:56,353 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1391 transitions. [2022-12-14 15:40:56,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-14 15:40:56,353 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:56,353 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:40:56,361 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (48)] Ended with exit code 0 [2022-12-14 15:40:56,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:56,555 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:56,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:56,556 INFO L85 PathProgramCache]: Analyzing trace with hash 656810288, now seen corresponding path program 1 times [2022-12-14 15:40:56,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:56,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1877244292] [2022-12-14 15:40:56,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:56,557 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-12-14 15:40:56,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:56,559 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:56,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (49)] Waiting until timeout for monitored process [2022-12-14 15:40:56,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:56,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-14 15:40:56,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:56,885 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:40:56,889 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2022-12-14 15:40:56,896 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-14 15:40:56,896 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 29 treesize of output 16 [2022-12-14 15:40:56,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:56,931 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:40:56,931 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:56,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1877244292] [2022-12-14 15:40:56,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1877244292] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:40:56,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:40:56,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-14 15:40:56,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797610639] [2022-12-14 15:40:56,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:56,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 15:40:56,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:56,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 15:40:56,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-14 15:40:56,932 INFO L87 Difference]: Start difference. First operand 997 states and 1391 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:58,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:40:58,393 INFO L93 Difference]: Finished difference Result 1387 states and 1890 transitions. [2022-12-14 15:40:58,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 15:40:58,394 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-12-14 15:40:58,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:40:58,395 INFO L225 Difference]: With dead ends: 1387 [2022-12-14 15:40:58,396 INFO L226 Difference]: Without dead ends: 1387 [2022-12-14 15:40:58,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2022-12-14 15:40:58,396 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 304 mSDsluCounter, 1825 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 2135 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:40:58,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 2135 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-12-14 15:40:58,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2022-12-14 15:40:58,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 859. [2022-12-14 15:40:58,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 752 states have (on average 1.4507978723404256) internal successors, (1091), 820 states have internal predecessors, (1091), 32 states have call successors, (32), 16 states have call predecessors, (32), 32 states have return successors, (64), 22 states have call predecessors, (64), 32 states have call successors, (64) [2022-12-14 15:40:58,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1187 transitions. [2022-12-14 15:40:58,405 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1187 transitions. Word has length 44 [2022-12-14 15:40:58,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:40:58,406 INFO L495 AbstractCegarLoop]: Abstraction has 859 states and 1187 transitions. [2022-12-14 15:40:58,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:40:58,406 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1187 transitions. [2022-12-14 15:40:58,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-14 15:40:58,406 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:40:58,406 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:40:58,414 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (49)] Ended with exit code 0 [2022-12-14 15:40:58,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:58,608 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:40:58,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:40:58,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1371004124, now seen corresponding path program 1 times [2022-12-14 15:40:58,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:40:58,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1666286428] [2022-12-14 15:40:58,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:40:58,611 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-12-14 15:40:58,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:40:58,614 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:40:58,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (50)] Waiting until timeout for monitored process [2022-12-14 15:40:58,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:40:58,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-14 15:40:58,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:40:58,850 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 15:40:58,850 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-12-14 15:40:59,095 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 15 treesize of output 11 [2022-12-14 15:40:59,151 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-12-14 15:40:59,151 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 39 treesize of output 30 [2022-12-14 15:40:59,243 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 35 treesize of output 11 [2022-12-14 15:40:59,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:59,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:40:59,607 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 214 treesize of output 198 [2022-12-14 15:40:59,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:40:59,923 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:40:59,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1666286428] [2022-12-14 15:40:59,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1666286428] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 15:40:59,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 15:40:59,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 20 [2022-12-14 15:40:59,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914896355] [2022-12-14 15:40:59,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:40:59,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 15:40:59,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:40:59,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 15:40:59,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2022-12-14 15:40:59,924 INFO L87 Difference]: Start difference. First operand 859 states and 1187 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:41:01,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:41:01,728 INFO L93 Difference]: Finished difference Result 1113 states and 1500 transitions. [2022-12-14 15:41:01,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 15:41:01,730 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-12-14 15:41:01,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:41:01,731 INFO L225 Difference]: With dead ends: 1113 [2022-12-14 15:41:01,731 INFO L226 Difference]: Without dead ends: 1113 [2022-12-14 15:41:01,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2022-12-14 15:41:01,732 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 894 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:41:01,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 667 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-12-14 15:41:01,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2022-12-14 15:41:01,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 913. [2022-12-14 15:41:01,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 802 states have (on average 1.458852867830424) internal successors, (1170), 872 states have internal predecessors, (1170), 34 states have call successors, (34), 17 states have call predecessors, (34), 34 states have return successors, (68), 23 states have call predecessors, (68), 34 states have call successors, (68) [2022-12-14 15:41:01,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1272 transitions. [2022-12-14 15:41:01,742 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1272 transitions. Word has length 46 [2022-12-14 15:41:01,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:41:01,742 INFO L495 AbstractCegarLoop]: Abstraction has 913 states and 1272 transitions. [2022-12-14 15:41:01,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:41:01,742 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1272 transitions. [2022-12-14 15:41:01,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-14 15:41:01,742 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:41:01,742 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:41:01,750 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (50)] Forceful destruction successful, exit code 0 [2022-12-14 15:41:01,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:41:01,944 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:41:01,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:41:01,945 INFO L85 PathProgramCache]: Analyzing trace with hash 561657498, now seen corresponding path program 1 times [2022-12-14 15:41:01,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:41:01,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [665326120] [2022-12-14 15:41:01,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:41:01,947 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-12-14 15:41:01,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:41:01,950 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:41:01,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (51)] Waiting until timeout for monitored process [2022-12-14 15:41:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:41:02,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-14 15:41:02,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:41:02,416 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 15 treesize of output 11 [2022-12-14 15:41:02,509 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 35 treesize of output 11 [2022-12-14 15:41:02,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:41:02,574 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:41:02,574 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:41:02,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [665326120] [2022-12-14 15:41:02,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [665326120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:41:02,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:41:02,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 15:41:02,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877240523] [2022-12-14 15:41:02,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:41:02,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 15:41:02,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:41:02,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 15:41:02,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-14 15:41:02,576 INFO L87 Difference]: Start difference. First operand 913 states and 1272 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:41:03,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:41:03,826 INFO L93 Difference]: Finished difference Result 1297 states and 1778 transitions. [2022-12-14 15:41:03,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 15:41:03,827 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-12-14 15:41:03,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:41:03,828 INFO L225 Difference]: With dead ends: 1297 [2022-12-14 15:41:03,829 INFO L226 Difference]: Without dead ends: 1297 [2022-12-14 15:41:03,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2022-12-14 15:41:03,829 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 689 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 15:41:03,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 757 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 15:41:03,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2022-12-14 15:41:03,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 1091. [2022-12-14 15:41:03,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1091 states, 956 states have (on average 1.4665271966527196) internal successors, (1402), 1038 states have internal predecessors, (1402), 46 states have call successors, (46), 23 states have call predecessors, (46), 46 states have return successors, (92), 29 states have call predecessors, (92), 46 states have call successors, (92) [2022-12-14 15:41:03,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1540 transitions. [2022-12-14 15:41:03,839 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1540 transitions. Word has length 46 [2022-12-14 15:41:03,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:41:03,840 INFO L495 AbstractCegarLoop]: Abstraction has 1091 states and 1540 transitions. [2022-12-14 15:41:03,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:41:03,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1540 transitions. [2022-12-14 15:41:03,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-14 15:41:03,840 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:41:03,840 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:41:03,848 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (51)] Ended with exit code 0 [2022-12-14 15:41:04,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:41:04,041 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:41:04,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:41:04,041 INFO L85 PathProgramCache]: Analyzing trace with hash -164048972, now seen corresponding path program 1 times [2022-12-14 15:41:04,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:41:04,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1851515143] [2022-12-14 15:41:04,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:41:04,042 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-12-14 15:41:04,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:41:04,043 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:41:04,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (52)] Waiting until timeout for monitored process [2022-12-14 15:41:04,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:41:04,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-14 15:41:04,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:41:04,280 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 15:41:04,281 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-12-14 15:41:04,678 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 15 treesize of output 11 [2022-12-14 15:41:04,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:41:04,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-12-14 15:41:04,893 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 29 treesize of output 11 [2022-12-14 15:41:04,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:41:04,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:41:07,194 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 114 treesize of output 106 [2022-12-14 15:41:08,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:41:08,030 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:41:08,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1851515143] [2022-12-14 15:41:08,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1851515143] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 15:41:08,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 15:41:08,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 18 [2022-12-14 15:41:08,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821430267] [2022-12-14 15:41:08,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:41:08,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 15:41:08,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:41:08,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 15:41:08,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=292, Unknown=1, NotChecked=0, Total=342 [2022-12-14 15:41:08,031 INFO L87 Difference]: Start difference. First operand 1091 states and 1540 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:41:11,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:41:18,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:41:20,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:41:21,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:41:23,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:41:30,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:41:31,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:41:31,397 INFO L93 Difference]: Finished difference Result 1829 states and 2548 transitions. [2022-12-14 15:41:31,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 15:41:31,398 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-12-14 15:41:31,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:41:31,400 INFO L225 Difference]: With dead ends: 1829 [2022-12-14 15:41:31,400 INFO L226 Difference]: Without dead ends: 1829 [2022-12-14 15:41:31,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=121, Invalid=748, Unknown=1, NotChecked=0, Total=870 [2022-12-14 15:41:31,401 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 524 mSDsluCounter, 1484 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 43 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1750 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:41:31,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1750 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1153 Invalid, 2 Unknown, 0 Unchecked, 18.4s Time] [2022-12-14 15:41:31,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2022-12-14 15:41:31,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1144. [2022-12-14 15:41:31,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 1001 states have (on average 1.4795204795204795) internal successors, (1481), 1087 states have internal predecessors, (1481), 50 states have call successors, (50), 25 states have call predecessors, (50), 50 states have return successors, (100), 31 states have call predecessors, (100), 50 states have call successors, (100) [2022-12-14 15:41:31,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1631 transitions. [2022-12-14 15:41:31,414 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1631 transitions. Word has length 46 [2022-12-14 15:41:31,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:41:31,415 INFO L495 AbstractCegarLoop]: Abstraction has 1144 states and 1631 transitions. [2022-12-14 15:41:31,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 15:41:31,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1631 transitions. [2022-12-14 15:41:31,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-14 15:41:31,415 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:41:31,415 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:41:31,423 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (52)] Ended with exit code 0 [2022-12-14 15:41:31,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:41:31,617 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:41:31,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:41:31,618 INFO L85 PathProgramCache]: Analyzing trace with hash -835878450, now seen corresponding path program 1 times [2022-12-14 15:41:31,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:41:31,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1495447234] [2022-12-14 15:41:31,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:41:31,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-12-14 15:41:31,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:41:31,622 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:41:31,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (53)] Waiting until timeout for monitored process [2022-12-14 15:41:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:41:31,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 15:41:31,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:41:31,911 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-12-14 15:41:31,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-12-14 15:41:32,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:41:32,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:41:32,805 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:41:32,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1495447234] [2022-12-14 15:41:32,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1495447234] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:41:32,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1715143313] [2022-12-14 15:41:32,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:41:32,806 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 15:41:32,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 15:41:32,807 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 15:41:32,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (54)] Waiting until timeout for monitored process [2022-12-14 15:41:33,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:41:33,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-14 15:41:33,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:41:33,199 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-12-14 15:41:33,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-12-14 15:41:34,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 15:41:34,382 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 16 [2022-12-14 15:41:34,469 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:41:34,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:41:34,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1715143313] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:41:34,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530990314] [2022-12-14 15:41:34,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:41:34,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:41:34,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:41:34,651 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:41:34,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-12-14 15:41:34,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:41:34,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-14 15:41:34,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:41:35,166 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 15 treesize of output 11 [2022-12-14 15:41:35,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:41:35,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2022-12-14 15:41:35,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:41:35,583 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:41:35,584 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 35 treesize of output 11 [2022-12-14 15:41:35,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:41:35,676 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:41:35,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530990314] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:41:35,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 15:41:35,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [4, 7] total 22 [2022-12-14 15:41:35,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187578133] [2022-12-14 15:41:35,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:41:35,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 15:41:35,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:41:35,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 15:41:35,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2022-12-14 15:41:35,677 INFO L87 Difference]: Start difference. First operand 1144 states and 1631 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 15:41:38,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:41:38,819 INFO L93 Difference]: Finished difference Result 2162 states and 2984 transitions. [2022-12-14 15:41:38,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 15:41:38,820 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2022-12-14 15:41:38,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:41:38,822 INFO L225 Difference]: With dead ends: 2162 [2022-12-14 15:41:38,822 INFO L226 Difference]: Without dead ends: 2162 [2022-12-14 15:41:38,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=297, Invalid=1595, Unknown=0, NotChecked=0, Total=1892 [2022-12-14 15:41:38,823 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 1386 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1386 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-12-14 15:41:38,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1386 Valid, 1440 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-12-14 15:41:38,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2162 states. [2022-12-14 15:41:38,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2162 to 1138. [2022-12-14 15:41:38,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 995 states have (on average 1.4763819095477386) internal successors, (1469), 1081 states have internal predecessors, (1469), 50 states have call successors, (50), 25 states have call predecessors, (50), 50 states have return successors, (100), 31 states have call predecessors, (100), 50 states have call successors, (100) [2022-12-14 15:41:38,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1619 transitions. [2022-12-14 15:41:38,836 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1619 transitions. Word has length 48 [2022-12-14 15:41:38,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:41:38,836 INFO L495 AbstractCegarLoop]: Abstraction has 1138 states and 1619 transitions. [2022-12-14 15:41:38,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 15:41:38,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1619 transitions. [2022-12-14 15:41:38,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-14 15:41:38,837 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:41:38,837 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:41:38,840 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (54)] Ended with exit code 0 [2022-12-14 15:41:39,052 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2022-12-14 15:41:39,249 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (53)] Ended with exit code 0 [2022-12-14 15:41:39,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,55 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,53 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:41:39,439 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:41:39,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:41:39,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1839873128, now seen corresponding path program 1 times [2022-12-14 15:41:39,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:41:39,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [837705417] [2022-12-14 15:41:39,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:41:39,440 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-12-14 15:41:39,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:41:39,441 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:41:39,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (56)] Waiting until timeout for monitored process [2022-12-14 15:41:39,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:41:39,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-14 15:41:39,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:41:39,945 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 15 treesize of output 11 [2022-12-14 15:41:40,373 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:41:40,374 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-12-14 15:41:40,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:41:40,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:41:40,380 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:41:40,383 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:41:40,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 20 [2022-12-14 15:41:40,464 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:41:40,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:41:41,097 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:41:41,097 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 62 treesize of output 65 [2022-12-14 15:41:41,278 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 50 treesize of output 42 [2022-12-14 15:41:41,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:41:41,315 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 26 treesize of output 18 [2022-12-14 15:41:41,734 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 15:41:41,734 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:41:41,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [837705417] [2022-12-14 15:41:41,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [837705417] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 15:41:41,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 15:41:41,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [15] total 27 [2022-12-14 15:41:41,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836823870] [2022-12-14 15:41:41,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:41:41,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 15:41:41,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:41:41,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 15:41:41,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=626, Unknown=0, NotChecked=0, Total=702 [2022-12-14 15:41:41,736 INFO L87 Difference]: Start difference. First operand 1138 states and 1619 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 15:41:47,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:41:47,113 INFO L93 Difference]: Finished difference Result 2320 states and 3291 transitions. [2022-12-14 15:41:47,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-14 15:41:47,113 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2022-12-14 15:41:47,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:41:47,117 INFO L225 Difference]: With dead ends: 2320 [2022-12-14 15:41:47,117 INFO L226 Difference]: Without dead ends: 2320 [2022-12-14 15:41:47,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=313, Invalid=1757, Unknown=0, NotChecked=0, Total=2070 [2022-12-14 15:41:47,117 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 1350 mSDsluCounter, 1770 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1352 SdHoareTripleChecker+Valid, 1990 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:41:47,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1352 Valid, 1990 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-12-14 15:41:47,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2320 states. [2022-12-14 15:41:47,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2320 to 1126. [2022-12-14 15:41:47,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 983 states have (on average 1.4699898270600202) internal successors, (1445), 1069 states have internal predecessors, (1445), 50 states have call successors, (50), 25 states have call predecessors, (50), 50 states have return successors, (100), 31 states have call predecessors, (100), 50 states have call successors, (100) [2022-12-14 15:41:47,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1595 transitions. [2022-12-14 15:41:47,134 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1595 transitions. Word has length 48 [2022-12-14 15:41:47,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:41:47,134 INFO L495 AbstractCegarLoop]: Abstraction has 1126 states and 1595 transitions. [2022-12-14 15:41:47,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 15:41:47,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1595 transitions. [2022-12-14 15:41:47,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-14 15:41:47,135 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:41:47,135 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:41:47,143 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (56)] Ended with exit code 0 [2022-12-14 15:41:47,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:41:47,336 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:41:47,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:41:47,337 INFO L85 PathProgramCache]: Analyzing trace with hash 652399267, now seen corresponding path program 1 times [2022-12-14 15:41:47,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:41:47,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1550785807] [2022-12-14 15:41:47,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:41:47,339 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-12-14 15:41:47,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:41:47,342 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:41:47,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (57)] Waiting until timeout for monitored process [2022-12-14 15:41:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:41:47,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-14 15:41:47,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:41:47,606 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-12-14 15:41:47,870 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 11 [2022-12-14 15:41:47,937 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-12-14 15:41:47,938 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 31 treesize of output 30 [2022-12-14 15:41:48,047 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-12-14 15:41:48,048 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-12-14 15:41:48,108 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-12-14 15:41:48,133 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:41:48,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:41:50,507 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 122 treesize of output 114 [2022-12-14 15:41:51,288 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 15:41:51,288 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:41:51,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1550785807] [2022-12-14 15:41:51,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1550785807] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:41:51,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1785327529] [2022-12-14 15:41:51,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:41:51,288 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 15:41:51,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 15:41:51,289 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 15:41:51,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (58)] Waiting until timeout for monitored process [2022-12-14 15:41:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:41:51,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-14 15:41:51,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:41:51,688 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 15:41:51,688 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-12-14 15:41:52,198 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 11 [2022-12-14 15:41:52,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:41:52,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2022-12-14 15:41:52,612 INFO L321 Elim1Store]: treesize reduction 78, result has 31.0 percent of original size [2022-12-14 15:41:52,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 55 [2022-12-14 15:41:52,755 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-12-14 15:41:52,808 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:41:52,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:41:57,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 114 [2022-12-14 15:41:57,692 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 15:41:57,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1785327529] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:41:57,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418876324] [2022-12-14 15:41:57,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:41:57,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:41:57,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:41:57,693 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:41:57,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-12-14 15:41:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:41:57,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-14 15:41:57,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:41:58,354 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 11 [2022-12-14 15:41:58,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:41:58,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2022-12-14 15:41:58,739 INFO L321 Elim1Store]: treesize reduction 40, result has 37.5 percent of original size [2022-12-14 15:41:58,740 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 25 treesize of output 39 [2022-12-14 15:41:58,870 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-12-14 15:41:58,874 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:41:58,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:42:03,603 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 122 treesize of output 114 [2022-12-14 15:42:04,090 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 15:42:04,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418876324] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:42:04,090 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 15:42:04,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10, 10, 11, 11] total 41 [2022-12-14 15:42:04,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849331297] [2022-12-14 15:42:04,090 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 15:42:04,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-12-14 15:42:04,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:42:04,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-12-14 15:42:04,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1517, Unknown=3, NotChecked=0, Total=1722 [2022-12-14 15:42:04,092 INFO L87 Difference]: Start difference. First operand 1126 states and 1595 transitions. Second operand has 42 states, 41 states have (on average 4.365853658536586) internal successors, (179), 36 states have internal predecessors, (179), 6 states have call successors, (7), 6 states have call predecessors, (7), 9 states have return successors, (10), 9 states have call predecessors, (10), 6 states have call successors, (10) [2022-12-14 15:42:12,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:42:12,055 INFO L93 Difference]: Finished difference Result 1721 states and 2291 transitions. [2022-12-14 15:42:12,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-12-14 15:42:12,055 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 4.365853658536586) internal successors, (179), 36 states have internal predecessors, (179), 6 states have call successors, (7), 6 states have call predecessors, (7), 9 states have return successors, (10), 9 states have call predecessors, (10), 6 states have call successors, (10) Word has length 49 [2022-12-14 15:42:12,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:42:12,057 INFO L225 Difference]: With dead ends: 1721 [2022-12-14 15:42:12,057 INFO L226 Difference]: Without dead ends: 1721 [2022-12-14 15:42:12,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 248 SyntacticMatches, 9 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2129 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=1077, Invalid=5726, Unknown=3, NotChecked=0, Total=6806 [2022-12-14 15:42:12,058 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 3297 mSDsluCounter, 2688 mSDsCounter, 0 mSdLazyCounter, 2465 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3302 SdHoareTripleChecker+Valid, 2825 SdHoareTripleChecker+Invalid, 2658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 2465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:42:12,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3302 Valid, 2825 Invalid, 2658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 2465 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-12-14 15:42:12,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2022-12-14 15:42:12,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1146. [2022-12-14 15:42:12,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 1003 states have (on average 1.465603190428714) internal successors, (1470), 1087 states have internal predecessors, (1470), 50 states have call successors, (50), 25 states have call predecessors, (50), 50 states have return successors, (100), 33 states have call predecessors, (100), 50 states have call successors, (100) [2022-12-14 15:42:12,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1620 transitions. [2022-12-14 15:42:12,077 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1620 transitions. Word has length 49 [2022-12-14 15:42:12,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:42:12,077 INFO L495 AbstractCegarLoop]: Abstraction has 1146 states and 1620 transitions. [2022-12-14 15:42:12,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 4.365853658536586) internal successors, (179), 36 states have internal predecessors, (179), 6 states have call successors, (7), 6 states have call predecessors, (7), 9 states have return successors, (10), 9 states have call predecessors, (10), 6 states have call successors, (10) [2022-12-14 15:42:12,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1620 transitions. [2022-12-14 15:42:12,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-14 15:42:12,078 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:42:12,078 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:42:12,087 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (57)] Ended with exit code 0 [2022-12-14 15:42:12,281 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (58)] Ended with exit code 0 [2022-12-14 15:42:12,483 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Ended with exit code 0 [2022-12-14 15:42:12,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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,58 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,59 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:42:12,680 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:42:12,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:42:12,681 INFO L85 PathProgramCache]: Analyzing trace with hash 652399268, now seen corresponding path program 1 times [2022-12-14 15:42:12,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:42:12,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [271057866] [2022-12-14 15:42:12,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:42:12,683 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-12-14 15:42:12,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:42:12,684 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:42:12,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (60)] Waiting until timeout for monitored process [2022-12-14 15:42:12,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:42:12,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-14 15:42:12,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:42:12,933 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-12-14 15:42:12,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 15:42:13,381 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 11 [2022-12-14 15:42:13,391 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 11 [2022-12-14 15:42:13,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:42:13,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2022-12-14 15:42:13,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:42:13,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-12-14 15:42:13,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:42:13,717 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 18 treesize of output 20 [2022-12-14 15:42:13,732 INFO L321 Elim1Store]: treesize reduction 6, result has 62.5 percent of original size [2022-12-14 15:42:13,732 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 19 treesize of output 19 [2022-12-14 15:42:13,897 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 21 treesize of output 9 [2022-12-14 15:42:13,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-14 15:42:13,934 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:42:13,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:42:14,774 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:42:14,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [271057866] [2022-12-14 15:42:14,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [271057866] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:42:14,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1754197803] [2022-12-14 15:42:14,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:42:14,775 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 15:42:14,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 15:42:14,776 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 15:42:14,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (61)] Waiting until timeout for monitored process [2022-12-14 15:42:15,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:42:15,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-14 15:42:15,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:42:15,233 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-12-14 15:42:15,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 15:42:15,936 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 11 [2022-12-14 15:42:15,944 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 11 [2022-12-14 15:42:16,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:42:16,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-12-14 15:42:16,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:42:16,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2022-12-14 15:42:16,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:42:16,527 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 18 treesize of output 20 [2022-12-14 15:42:16,539 INFO L321 Elim1Store]: treesize reduction 6, result has 62.5 percent of original size [2022-12-14 15:42:16,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 19 treesize of output 19 [2022-12-14 15:42:16,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-14 15:42:16,798 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 21 treesize of output 9 [2022-12-14 15:42:16,805 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:42:16,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:42:17,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1754197803] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:42:17,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629723885] [2022-12-14 15:42:17,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:42:17,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:42:17,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:42:17,146 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:42:17,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-12-14 15:42:17,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:42:17,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-14 15:42:17,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:42:17,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 15:42:17,766 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 11 [2022-12-14 15:42:17,780 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 11 [2022-12-14 15:42:17,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:42:17,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2022-12-14 15:42:17,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:42:17,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-12-14 15:42:17,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:42:17,976 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 18 treesize of output 20 [2022-12-14 15:42:17,993 INFO L321 Elim1Store]: treesize reduction 6, result has 62.5 percent of original size [2022-12-14 15:42:17,993 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 19 treesize of output 19 [2022-12-14 15:42:18,087 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 21 treesize of output 9 [2022-12-14 15:42:18,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-14 15:42:18,096 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:42:18,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:42:18,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629723885] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:42:18,405 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:42:18,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 24 [2022-12-14 15:42:18,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623070008] [2022-12-14 15:42:18,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:42:18,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 15:42:18,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:42:18,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 15:42:18,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=802, Unknown=0, NotChecked=0, Total=930 [2022-12-14 15:42:18,406 INFO L87 Difference]: Start difference. First operand 1146 states and 1620 transitions. Second operand has 26 states, 25 states have (on average 4.12) internal successors, (103), 22 states have internal predecessors, (103), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-12-14 15:42:23,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:42:23,268 INFO L93 Difference]: Finished difference Result 1590 states and 2203 transitions. [2022-12-14 15:42:23,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 15:42:23,268 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 4.12) internal successors, (103), 22 states have internal predecessors, (103), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 49 [2022-12-14 15:42:23,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:42:23,270 INFO L225 Difference]: With dead ends: 1590 [2022-12-14 15:42:23,270 INFO L226 Difference]: Without dead ends: 1590 [2022-12-14 15:42:23,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 146 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=393, Invalid=1769, Unknown=0, NotChecked=0, Total=2162 [2022-12-14 15:42:23,270 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 1902 mSDsluCounter, 1452 mSDsCounter, 0 mSdLazyCounter, 1568 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1903 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 1650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:42:23,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1903 Valid, 1577 Invalid, 1650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1568 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-12-14 15:42:23,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2022-12-14 15:42:23,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1146. [2022-12-14 15:42:23,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 1003 states have (on average 1.4636091724825524) internal successors, (1468), 1087 states have internal predecessors, (1468), 50 states have call successors, (50), 25 states have call predecessors, (50), 50 states have return successors, (100), 33 states have call predecessors, (100), 50 states have call successors, (100) [2022-12-14 15:42:23,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1618 transitions. [2022-12-14 15:42:23,281 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1618 transitions. Word has length 49 [2022-12-14 15:42:23,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:42:23,281 INFO L495 AbstractCegarLoop]: Abstraction has 1146 states and 1618 transitions. [2022-12-14 15:42:23,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 4.12) internal successors, (103), 22 states have internal predecessors, (103), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-12-14 15:42:23,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1618 transitions. [2022-12-14 15:42:23,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-14 15:42:23,282 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:42:23,282 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:42:23,288 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Ended with exit code 0 [2022-12-14 15:42:23,490 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (60)] Ended with exit code 0 [2022-12-14 15:42:23,686 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (61)] Ended with exit code 0 [2022-12-14 15:42:23,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 62 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,60 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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,61 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt [2022-12-14 15:42:23,883 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 15:42:23,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:42:23,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1554828300, now seen corresponding path program 1 times [2022-12-14 15:42:23,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:42:23,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1673684142] [2022-12-14 15:42:23,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:42:23,884 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-12-14 15:42:23,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:42:23,885 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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-12-14 15:42:23,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/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 (63)] Waiting until timeout for monitored process [2022-12-14 15:42:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:42:24,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 64 conjunts are in the unsatisfiable core [2022-12-14 15:42:24,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:42:24,942 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:42:24,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:42:24,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2022-12-14 15:42:24,963 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:42:24,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:42:24,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2022-12-14 15:42:25,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:42:25,129 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:42:25,149 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-14 15:42:25,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 40 [2022-12-14 15:42:25,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:42:25,171 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:42:25,193 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-14 15:42:25,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 40 [2022-12-14 15:42:25,455 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-12-14 15:42:25,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 45 [2022-12-14 15:42:25,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-12-14 15:42:25,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-12-14 15:42:25,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:42:25,504 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:42:25,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 33 [2022-12-14 15:42:25,984 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:42:25,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:42:26,007 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-12-14 15:42:26,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 48 [2022-12-14 15:42:26,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:42:26,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-12-14 15:42:26,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:42:26,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:42:26,158 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:42:26,158 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:42:26,171 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-12-14 15:42:26,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 67 treesize of output 59 [2022-12-14 15:42:26,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:42:26,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-12-14 15:42:26,624 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:42:26,624 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 33 treesize of output 15 [2022-12-14 15:42:26,633 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:42:26,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:42:26,681 INFO L321 Elim1Store]: treesize reduction 22, result has 55.1 percent of original size [2022-12-14 15:42:26,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 39 [2022-12-14 15:42:26,992 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:42:26,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:42:27,577 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base|)) (.cse3 (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END))) (.cse1 (bvadd |c_~#list~0.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (.cse4 (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT))) (and (forall ((v_ArrVal_1130 (_ BitVec 32))) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base| (store .cse2 .cse3 v_ArrVal_1130)))) (select .cse0 (select (select .cse0 |c_~#list~0.base|) .cse1))) .cse4) (_ bv0 32))) (forall ((v_ArrVal_1130 (_ BitVec 32)) (v_ArrVal_1129 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_one_~list#1.base| v_ArrVal_1129) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base| (store .cse2 .cse3 v_ArrVal_1130)) |c_~#list~0.base|) .cse1)) .cse4) (_ bv0 32))))) is different from false [2022-12-14 15:42:27,628 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (let ((.cse2 (bvadd |c_~#list~0.offset| .cse5)) (.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base|) (bvadd .cse5 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_append_one_~item~1#1.base|)) (.cse1 (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END))) (.cse3 (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT))) (and (forall ((v_ArrVal_1130 (_ BitVec 32)) (v_ArrVal_1129 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_one_~list#1.base| v_ArrVal_1129) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base| (store .cse0 .cse1 v_ArrVal_1130)) |c_~#list~0.base|) .cse2)) .cse3) (_ bv0 32))) (forall ((v_ArrVal_1130 (_ BitVec 32))) (= (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base| (store .cse0 .cse1 v_ArrVal_1130)))) (select .cse4 (select (select .cse4 |c_~#list~0.base|) .cse2))) .cse3) (_ bv0 32)))))) is different from false [2022-12-14 15:43:57,163 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)) (.cse12 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (let ((.cse5 (bvadd |c_~#list~0.offset| .cse12)) (.cse3 (bvadd .cse12 |c_ULTIMATE.start_append_one_~list#1.offset|)) (.cse4 (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END))) (.cse2 (bvadd |c_ULTIMATE.start_create_item_~item~0#1.offset| .cse6)) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~cursor#1.base|) |c_ULTIMATE.start_create_item_~cursor#1.offset|)) (.cse1 (bvadd (bvmul (_ bv4 32) ~unnamed2~0~ITEM_PREV) |c_ULTIMATE.start_create_item_~item~0#1.offset|))) (and (forall ((|ULTIMATE.start_create_item_~item~0#1.base| (_ BitVec 32)) (v_ArrVal_1120 (_ BitVec 32))) (let ((.cse0 (let ((.cse7 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_create_item_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_create_item_~item~0#1.base|) .cse2 .cse8) .cse1 v_ArrVal_1120)))) (store .cse7 |c_ULTIMATE.start_create_item_~cursor#1.base| (store (select .cse7 |c_ULTIMATE.start_create_item_~cursor#1.base|) |c_ULTIMATE.start_create_item_~cursor#1.offset| |ULTIMATE.start_create_item_~item~0#1.base|))))) (or (not (= (select (select .cse0 |ULTIMATE.start_create_item_~item~0#1.base|) .cse1) (_ bv0 32))) (forall ((v_ArrVal_1122 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1119 (_ BitVec 32)) (v_ArrVal_1130 (_ BitVec 32)) (v_ArrVal_1129 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~item~0#1.base|) .cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~cursor#1.base|) |c_ULTIMATE.start_create_item_~cursor#1.offset|)) .cse1 v_ArrVal_1119)) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1122) |c_ULTIMATE.start_append_one_~list#1.base| v_ArrVal_1129) (select (select (store .cse0 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse0 |c_ULTIMATE.start_append_one_~list#1.base|) .cse3 |ULTIMATE.start_create_item_~item~0#1.base|) .cse4 v_ArrVal_1130)) |c_~#list~0.base|) .cse5)) .cse6) (_ bv0 32)))))) (forall ((|ULTIMATE.start_create_item_~item~0#1.base| (_ BitVec 32)) (v_ArrVal_1120 (_ BitVec 32))) (let ((.cse10 (let ((.cse11 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_create_item_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_create_item_~item~0#1.base|) .cse2 .cse8) .cse1 v_ArrVal_1120)))) (store .cse11 |c_ULTIMATE.start_create_item_~cursor#1.base| (store (select .cse11 |c_ULTIMATE.start_create_item_~cursor#1.base|) |c_ULTIMATE.start_create_item_~cursor#1.offset| |ULTIMATE.start_create_item_~item~0#1.base|))))) (or (forall ((v_ArrVal_1130 (_ BitVec 32))) (= (select (let ((.cse9 (store .cse10 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse10 |c_ULTIMATE.start_append_one_~list#1.base|) .cse3 |ULTIMATE.start_create_item_~item~0#1.base|) .cse4 v_ArrVal_1130)))) (select .cse9 (select (select .cse9 |c_~#list~0.base|) .cse5))) .cse6) (_ bv0 32))) (not (= (select (select .cse10 |ULTIMATE.start_create_item_~item~0#1.base|) .cse1) (_ bv0 32))))))))) is different from false [2022-12-14 15:44:25,846 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:44:25,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1673684142] [2022-12-14 15:44:25,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1673684142] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:44:25,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [904489633] [2022-12-14 15:44:25,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:44:25,847 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 15:44:25,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 15:44:25,848 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 15:44:25,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7766383-73c6-4ef3-b781-2c937c158162/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (64)] Waiting until timeout for monitored process [2022-12-14 15:44:26,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:44:26,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-14 15:44:26,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:44:27,222 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 15:44:27,223 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-12-14 15:44:30,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:44:30,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2022-12-14 15:44:30,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:44:30,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2022-12-14 15:44:31,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:44:31,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:44:31,150 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 36 treesize of output 32 [2022-12-14 15:44:31,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:44:31,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:44:31,165 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 36 treesize of output 32 [2022-12-14 15:44:32,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:44:32,123 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 23 treesize of output 23 [2022-12-14 15:44:32,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:44:32,137 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 29 treesize of output 27 [2022-12-14 15:44:32,148 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 11 treesize of output 9 [2022-12-14 15:44:34,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:44:34,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-12-14 15:44:34,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:44:34,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-12-14 15:44:35,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:44:35,502 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:44:35,518 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-14 15:44:35,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 51 [2022-12-14 15:44:35,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-12-14 15:44:39,750 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:44:39,750 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 33 treesize of output 15 [2022-12-14 15:44:39,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:44:39,777 INFO L321 Elim1Store]: treesize reduction 19, result has 29.6 percent of original size [2022-12-14 15:44:39,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 22 [2022-12-14 15:44:39,885 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:44:39,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:44:44,246 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base|) (bvadd .cse5 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_append_one_~item~1#1.base|)) (.cse3 (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END))) (.cse1 (bvadd |c_~#list~0.offset| .cse5)) (.cse4 (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT))) (and (forall ((v_ArrVal_1180 (_ BitVec 32))) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base| (store .cse2 .cse3 v_ArrVal_1180)))) (select .cse0 (select (select .cse0 |c_~#list~0.base|) .cse1))) .cse4) (_ bv0 32))) (forall ((v_ArrVal_1180 (_ BitVec 32)) (v_ArrVal_1179 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_one_~list#1.base| v_ArrVal_1179) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base| (store .cse2 .cse3 v_ArrVal_1180)) |c_~#list~0.base|) .cse1)) .cse4)))))) is different from false [2022-12-14 15:44:44,314 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (let ((.cse2 (bvadd |c_~#list~0.offset| .cse5)) (.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base|) (bvadd .cse5 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_#res#1.base|)) (.cse1 (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END))) (.cse3 (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT))) (and (forall ((v_ArrVal_1180 (_ BitVec 32)) (v_ArrVal_1179 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_one_~list#1.base| v_ArrVal_1179) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base| (store .cse0 .cse1 v_ArrVal_1180)) |c_~#list~0.base|) .cse2)) .cse3) (_ bv0 32))) (forall ((v_ArrVal_1180 (_ BitVec 32))) (= (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base| (store .cse0 .cse1 v_ArrVal_1180)))) (select .cse4 (select (select .cse4 |c_~#list~0.base|) .cse2))) .cse3) (_ bv0 32)))))) is different from false [2022-12-14 15:44:44,346 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base|) (bvadd .cse5 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~item~0#1.base|)) (.cse3 (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END))) (.cse1 (bvadd |c_~#list~0.offset| .cse5)) (.cse4 (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT))) (and (forall ((v_ArrVal_1180 (_ BitVec 32))) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base| (store .cse2 .cse3 v_ArrVal_1180)))) (select .cse0 (select (select .cse0 |c_~#list~0.base|) .cse1))) .cse4) (_ bv0 32))) (forall ((v_ArrVal_1180 (_ BitVec 32)) (v_ArrVal_1179 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_one_~list#1.base| v_ArrVal_1179) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base| (store .cse2 .cse3 v_ArrVal_1180)) |c_~#list~0.base|) .cse1)) .cse4)))))) is different from false [2022-12-14 15:44:44,505 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (let ((.cse3 (bvadd |c_~#list~0.offset| .cse7)) (.cse1 (bvadd .cse7 |c_ULTIMATE.start_append_one_~list#1.offset|)) (.cse2 (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END))) (.cse4 (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT))) (and (forall ((v_ArrVal_1173 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1180 (_ BitVec 32)) (v_ArrVal_1179 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1173) |c_ULTIMATE.start_append_one_~list#1.base| v_ArrVal_1179) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1174))) (store .cse0 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse0 |c_ULTIMATE.start_append_one_~list#1.base|) .cse1 |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse2 v_ArrVal_1180))) |c_~#list~0.base|) .cse3)) .cse4) (_ bv0 32))) (forall ((v_ArrVal_1174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1180 (_ BitVec 32))) (= (select (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1174))) (store .cse6 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse6 |c_ULTIMATE.start_append_one_~list#1.base|) .cse1 |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse2 v_ArrVal_1180))))) (select .cse5 (select (select .cse5 |c_~#list~0.base|) .cse3))) .cse4) (_ bv0 32)))))) is different from false [2022-12-14 15:46:22,069 WARN L233 SmtUtils]: Spent 5.78s on a formula simplification. DAG size of input: 67 DAG size of output: 50 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-12-14 15:46:22,069 INFO L321 Elim1Store]: treesize reduction 168, result has 39.8 percent of original size [2022-12-14 15:46:22,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 286 treesize of output 263 [2022-12-14 15:46:23,171 INFO L321 Elim1Store]: treesize reduction 84, result has 40.0 percent of original size [2022-12-14 15:46:23,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 148 treesize of output 176 [2022-12-14 15:46:25,392 INFO L321 Elim1Store]: treesize reduction 154, result has 62.2 percent of original size [2022-12-14 15:46:25,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 28 case distinctions, treesize of input 4799 treesize of output 4751 [2022-12-14 15:46:25,605 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:46:25,606 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 5757 treesize of output 5497 [2022-12-14 15:46:28,376 INFO L321 Elim1Store]: treesize reduction 392, result has 54.5 percent of original size [2022-12-14 15:46:28,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 20606 treesize of output 19143 [2022-12-14 15:46:28,532 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 18642 treesize of output 17810 [2022-12-14 15:46:28,707 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 17810 treesize of output 17394 [2022-12-14 15:46:28,893 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 47987 treesize of output 44051 [2022-12-14 15:46:29,704 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:46:29,705 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 47183 treesize of output 46243 [2022-12-14 15:46:36,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4