./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26127246-4d3a-4ae5-bbb6-b61fff83a126/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26127246-4d3a-4ae5-bbb6-b61fff83a126/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26127246-4d3a-4ae5-bbb6-b61fff83a126/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26127246-4d3a-4ae5-bbb6-b61fff83a126/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26127246-4d3a-4ae5-bbb6-b61fff83a126/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26127246-4d3a-4ae5-bbb6-b61fff83a126/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c9492eb5ff634b400a7a5ea3f7f2cefeb5465f9e5361bb81d240cec0c0c035af --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 01:04:42,475 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:04:42,588 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26127246-4d3a-4ae5-bbb6-b61fff83a126/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 01:04:42,596 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:04:42,600 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:04:42,640 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:04:42,643 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:04:42,643 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:04:42,644 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:04:42,646 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:04:42,646 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 01:04:42,647 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 01:04:42,647 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 01:04:42,647 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 01:04:42,648 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 01:04:42,649 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 01:04:42,649 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 01:04:42,650 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 01:04:42,650 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 01:04:42,651 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 01:04:42,651 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 01:04:42,651 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 01:04:42,652 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:04:42,653 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:04:42,653 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:04:42,654 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:04:42,654 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:04:42,654 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:04:42,655 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:04:42,655 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:04:42,656 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:04:42,656 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:04:42,657 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:04:42,657 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:04:42,657 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:04:42,658 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:04:42,658 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:04:42,659 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:04:42,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:04:42,659 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:04:42,660 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:04:42,660 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:04:42,661 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 01:04:42,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:04:42,662 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:04:42,662 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 01:04:42,662 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:04:42,662 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_26127246-4d3a-4ae5-bbb6-b61fff83a126/bin/utaipan-verify-YMUCfTKeje/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_26127246-4d3a-4ae5-bbb6-b61fff83a126/bin/utaipan-verify-YMUCfTKeje Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 ! call(reach_error())) ) 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 -> c9492eb5ff634b400a7a5ea3f7f2cefeb5465f9e5361bb81d240cec0c0c035af [2024-11-09 01:04:42,988 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:04:43,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:04:43,020 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:04:43,022 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:04:43,023 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:04:43,024 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26127246-4d3a-4ae5-bbb6-b61fff83a126/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-3.i Unable to find full path for "g++" [2024-11-09 01:04:45,145 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:04:45,563 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:04:45,564 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26127246-4d3a-4ae5-bbb6-b61fff83a126/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-3.i [2024-11-09 01:04:45,593 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26127246-4d3a-4ae5-bbb6-b61fff83a126/bin/utaipan-verify-YMUCfTKeje/data/059d4379c/86c9efee3ef946beb4800f1ac18db87f/FLAG4535b95fa [2024-11-09 01:04:45,741 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26127246-4d3a-4ae5-bbb6-b61fff83a126/bin/utaipan-verify-YMUCfTKeje/data/059d4379c/86c9efee3ef946beb4800f1ac18db87f [2024-11-09 01:04:45,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:04:45,746 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:04:45,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:04:45,747 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:04:45,755 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:04:45,756 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:04:45" (1/1) ... [2024-11-09 01:04:45,760 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e853500 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:04:45, skipping insertion in model container [2024-11-09 01:04:45,760 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:04:45" (1/1) ... [2024-11-09 01:04:45,853 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:04:46,486 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26127246-4d3a-4ae5-bbb6-b61fff83a126/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-3.i[33022,33035] [2024-11-09 01:04:46,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:04:46,882 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:04:46,931 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26127246-4d3a-4ae5-bbb6-b61fff83a126/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-3.i[33022,33035] [2024-11-09 01:04:47,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:04:47,086 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:04:47,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:04:47 WrapperNode [2024-11-09 01:04:47,087 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:04:47,088 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:04:47,089 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:04:47,089 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:04:47,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:04:47" (1/1) ... [2024-11-09 01:04:47,149 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:04:47" (1/1) ... [2024-11-09 01:04:47,287 INFO L138 Inliner]: procedures = 177, calls = 605, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3635 [2024-11-09 01:04:47,287 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:04:47,289 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:04:47,289 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:04:47,289 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:04:47,300 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:04:47" (1/1) ... [2024-11-09 01:04:47,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:04:47" (1/1) ... [2024-11-09 01:04:47,331 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:04:47" (1/1) ... [2024-11-09 01:04:47,332 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:04:47" (1/1) ... [2024-11-09 01:04:47,469 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:04:47" (1/1) ... [2024-11-09 01:04:47,534 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:04:47" (1/1) ... [2024-11-09 01:04:47,549 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:04:47" (1/1) ... [2024-11-09 01:04:47,588 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:04:47" (1/1) ... [2024-11-09 01:04:47,615 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:04:47,617 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:04:47,617 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:04:47,618 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:04:47,619 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:04:47" (1/1) ... [2024-11-09 01:04:47,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:04:47,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26127246-4d3a-4ae5-bbb6-b61fff83a126/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:04:47,661 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26127246-4d3a-4ae5-bbb6-b61fff83a126/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 01:04:47,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26127246-4d3a-4ae5-bbb6-b61fff83a126/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 01:04:47,699 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2024-11-09 01:04:47,700 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2024-11-09 01:04:47,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 01:04:47,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 01:04:47,702 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 01:04:47,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 01:04:47,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2024-11-09 01:04:47,702 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2024-11-09 01:04:47,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 01:04:47,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:04:47,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 01:04:47,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 01:04:47,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 01:04:47,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 01:04:47,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 01:04:47,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:04:47,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:04:48,043 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:04:48,046 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:04:51,962 INFO L? ?]: Removed 822 outVars from TransFormulas that were not future-live. [2024-11-09 01:04:51,962 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:04:56,095 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:04:56,095 INFO L316 CfgBuilder]: Removed 155 assume(true) statements. [2024-11-09 01:04:56,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:04:56 BoogieIcfgContainer [2024-11-09 01:04:56,096 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:04:56,098 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:04:56,098 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:04:56,101 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:04:56,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:04:45" (1/3) ... [2024-11-09 01:04:56,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ff0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:04:56, skipping insertion in model container [2024-11-09 01:04:56,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:04:47" (2/3) ... [2024-11-09 01:04:56,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ff0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:04:56, skipping insertion in model container [2024-11-09 01:04:56,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:04:56" (3/3) ... [2024-11-09 01:04:56,104 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test10-3.i [2024-11-09 01:04:56,124 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:04:56,124 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:04:56,196 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:04:56,202 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@45544d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:04:56,203 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:04:56,208 INFO L276 IsEmpty]: Start isEmpty. Operand has 321 states, 302 states have (on average 1.7483443708609272) internal successors, (528), 307 states have internal predecessors, (528), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 01:04:56,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 01:04:56,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:04:56,217 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:04:56,218 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:04:56,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:04:56,224 INFO L85 PathProgramCache]: Analyzing trace with hash 908893836, now seen corresponding path program 1 times [2024-11-09 01:04:56,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:04:56,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995058862] [2024-11-09 01:04:56,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:04:56,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:04:56,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:04:56,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:04:56,465 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:04:56,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995058862] [2024-11-09 01:04:56,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995058862] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:04:56,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:04:56,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:04:56,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418644874] [2024-11-09 01:04:56,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:04:56,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:04:56,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:04:56,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:04:56,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:04:56,505 INFO L87 Difference]: Start difference. First operand has 321 states, 302 states have (on average 1.7483443708609272) internal successors, (528), 307 states have internal predecessors, (528), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:04:58,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:05:00,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:05:03,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:05:05,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:05:07,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:05:09,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:05:11,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:05:13,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:05:15,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:05:17,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:05:19,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:05:19,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:05:19,257 INFO L93 Difference]: Finished difference Result 641 states and 1119 transitions. [2024-11-09 01:05:19,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:05:19,264 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-09 01:05:19,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:05:19,274 INFO L225 Difference]: With dead ends: 641 [2024-11-09 01:05:19,274 INFO L226 Difference]: Without dead ends: 289 [2024-11-09 01:05:19,279 INFO L431 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 [2024-11-09 01:05:19,282 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:05:19,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 339 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 9 Unknown, 0 Unchecked, 22.7s Time] [2024-11-09 01:05:19,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-11-09 01:05:19,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2024-11-09 01:05:19,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 271 states have (on average 1.2140221402214022) internal successors, (329), 276 states have internal predecessors, (329), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 01:05:19,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 356 transitions. [2024-11-09 01:05:19,342 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 356 transitions. Word has length 12 [2024-11-09 01:05:19,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:05:19,343 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 356 transitions. [2024-11-09 01:05:19,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:05:19,343 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 356 transitions. [2024-11-09 01:05:19,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 01:05:19,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:05:19,346 INFO L215 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] [2024-11-09 01:05:19,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:05:19,346 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:05:19,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:05:19,347 INFO L85 PathProgramCache]: Analyzing trace with hash 2018534525, now seen corresponding path program 1 times [2024-11-09 01:05:19,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:05:19,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904879296] [2024-11-09 01:05:19,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:05:19,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:05:19,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:05:19,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:05:19,922 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:05:19,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904879296] [2024-11-09 01:05:19,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904879296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:05:19,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:05:19,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:05:19,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511946678] [2024-11-09 01:05:19,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:05:19,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:05:19,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:05:19,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:05:19,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:05:19,929 INFO L87 Difference]: Start difference. First operand 289 states and 356 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:05:22,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:05:24,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:05:26,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:05:28,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:05:30,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:05:32,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:05:34,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:05:36,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:05:38,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:05:40,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:05:42,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:05:44,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:05:46,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:05:48,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:05:50,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:05:53,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:05:55,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:05:57,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:05:59,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:06:01,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:06:03,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:06:05,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:06:07,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:06:11,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:06:13,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:06:15,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:06:17,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:06:19,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:06:20,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:06:22,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:06:24,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:06:26,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:06:28,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:06:30,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:06:32,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:06:32,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:06:32,862 INFO L93 Difference]: Finished difference Result 495 states and 613 transitions. [2024-11-09 01:06:32,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:06:32,863 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-09 01:06:32,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:06:32,865 INFO L225 Difference]: With dead ends: 495 [2024-11-09 01:06:32,865 INFO L226 Difference]: Without dead ends: 322 [2024-11-09 01:06:32,866 INFO L431 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 [2024-11-09 01:06:32,867 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 35 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 30 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 72.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 30 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 72.9s IncrementalHoareTripleChecker+Time [2024-11-09 01:06:32,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 884 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 30 Unknown, 0 Unchecked, 72.9s Time] [2024-11-09 01:06:32,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-11-09 01:06:32,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 291. [2024-11-09 01:06:32,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 273 states have (on average 1.2124542124542124) internal successors, (331), 278 states have internal predecessors, (331), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 01:06:32,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 358 transitions. [2024-11-09 01:06:32,908 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 358 transitions. Word has length 27 [2024-11-09 01:06:32,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:06:32,912 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 358 transitions. [2024-11-09 01:06:32,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:06:32,913 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 358 transitions. [2024-11-09 01:06:32,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 01:06:32,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:06:32,915 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:06:32,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:06:32,916 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:06:32,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:06:32,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1454078454, now seen corresponding path program 1 times [2024-11-09 01:06:32,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:06:32,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743581447] [2024-11-09 01:06:32,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:06:32,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:06:33,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:06:33,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:06:33,366 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:06:33,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743581447] [2024-11-09 01:06:33,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743581447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:06:33,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:06:33,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:06:33,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338257725] [2024-11-09 01:06:33,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:06:33,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:06:33,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:06:33,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:06:33,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:06:33,370 INFO L87 Difference]: Start difference. First operand 291 states and 358 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:06:35,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:06:37,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:06:39,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:06:41,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:06:43,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:06:45,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:06:47,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:06:49,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:06:51,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:06:53,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:06:54,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:06:56,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:07:00,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:07:03,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:07:04,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:07:06,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:07:08,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:07:10,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:07:12,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:07:14,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:07:16,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:07:18,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:07:20,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:07:22,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:07:24,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:07:24,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:07:24,831 INFO L93 Difference]: Finished difference Result 716 states and 878 transitions. [2024-11-09 01:07:24,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:07:24,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-09 01:07:24,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:07:24,834 INFO L225 Difference]: With dead ends: 716 [2024-11-09 01:07:24,834 INFO L226 Difference]: Without dead ends: 428 [2024-11-09 01:07:24,835 INFO L431 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 [2024-11-09 01:07:24,836 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 138 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 51.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 51.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:07:24,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 673 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 21 Unknown, 0 Unchecked, 51.4s Time] [2024-11-09 01:07:24,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2024-11-09 01:07:24,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 423. [2024-11-09 01:07:24,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 400 states have (on average 1.1975) internal successors, (479), 405 states have internal predecessors, (479), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:07:24,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 516 transitions. [2024-11-09 01:07:24,862 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 516 transitions. Word has length 57 [2024-11-09 01:07:24,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:07:24,862 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 516 transitions. [2024-11-09 01:07:24,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:07:24,863 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 516 transitions. [2024-11-09 01:07:24,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-09 01:07:24,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:07:24,869 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:07:24,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:07:24,870 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:07:24,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:07:24,870 INFO L85 PathProgramCache]: Analyzing trace with hash -691789278, now seen corresponding path program 1 times [2024-11-09 01:07:24,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:07:24,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113295641] [2024-11-09 01:07:24,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:07:24,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:07:25,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:07:26,143 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 01:07:26,144 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:07:26,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113295641] [2024-11-09 01:07:26,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113295641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:07:26,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:07:26,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:07:26,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494204637] [2024-11-09 01:07:26,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:07:26,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:07:26,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:07:26,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:07:26,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:07:26,150 INFO L87 Difference]: Start difference. First operand 423 states and 516 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 01:07:28,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:07:30,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:07:31,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:07:33,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:07:36,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:07:38,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:07:40,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:07:42,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:07:44,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:07:46,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:07:48,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:07:50,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:07:52,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:07:54,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:07:56,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:07:58,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:08:01,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-11-09 01:08:04,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:08:06,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:08:08,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:08:10,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:08:13,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:08:15,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:08:17,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:08:17,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:08:17,259 INFO L93 Difference]: Finished difference Result 788 states and 963 transitions. [2024-11-09 01:08:17,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:08:17,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 70 [2024-11-09 01:08:17,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:08:17,262 INFO L225 Difference]: With dead ends: 788 [2024-11-09 01:08:17,262 INFO L226 Difference]: Without dead ends: 423 [2024-11-09 01:08:17,263 INFO L431 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 [2024-11-09 01:08:17,264 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 17 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 51.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:08:17,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 886 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 20 Unknown, 0 Unchecked, 51.1s Time] [2024-11-09 01:08:17,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-11-09 01:08:17,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2024-11-09 01:08:17,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 400 states have (on average 1.195) internal successors, (478), 405 states have internal predecessors, (478), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:08:17,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 515 transitions. [2024-11-09 01:08:17,307 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 515 transitions. Word has length 70 [2024-11-09 01:08:17,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:08:17,307 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 515 transitions. [2024-11-09 01:08:17,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 01:08:17,308 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 515 transitions. [2024-11-09 01:08:17,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 01:08:17,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:08:17,315 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:08:17,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 01:08:17,316 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:08:17,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:08:17,316 INFO L85 PathProgramCache]: Analyzing trace with hash 984756827, now seen corresponding path program 1 times [2024-11-09 01:08:17,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:08:17,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442974949] [2024-11-09 01:08:17,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:08:17,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:08:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:08:17,911 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 01:08:17,911 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:08:17,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442974949] [2024-11-09 01:08:17,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442974949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:08:17,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:08:17,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:08:17,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096194524] [2024-11-09 01:08:17,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:08:17,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:08:17,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:08:17,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:08:17,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:08:17,915 INFO L87 Difference]: Start difference. First operand 423 states and 515 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 01:08:19,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:08:21,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:08:23,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:08:25,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:08:26,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:08:28,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:08:30,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:08:32,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:08:34,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:08:36,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:08:38,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:08:40,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:08:42,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:08:44,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:08:46,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:08:48,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:08:50,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:08:53,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:08:55,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:08:56,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:08:58,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:09:00,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:09:03,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:09:05,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:09:05,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:09:05,622 INFO L93 Difference]: Finished difference Result 964 states and 1174 transitions. [2024-11-09 01:09:05,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:09:05,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 96 [2024-11-09 01:09:05,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:09:05,626 INFO L225 Difference]: With dead ends: 964 [2024-11-09 01:09:05,626 INFO L226 Difference]: Without dead ends: 570 [2024-11-09 01:09:05,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:09:05,630 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 127 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:09:05,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 611 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 19 Unknown, 0 Unchecked, 47.7s Time] [2024-11-09 01:09:05,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2024-11-09 01:09:05,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 504. [2024-11-09 01:09:05,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 478 states have (on average 1.1882845188284519) internal successors, (568), 483 states have internal predecessors, (568), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 01:09:05,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 611 transitions. [2024-11-09 01:09:05,659 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 611 transitions. Word has length 96 [2024-11-09 01:09:05,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:09:05,660 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 611 transitions. [2024-11-09 01:09:05,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 01:09:05,660 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 611 transitions. [2024-11-09 01:09:05,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 01:09:05,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:09:05,664 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:09:05,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 01:09:05,664 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:09:05,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:09:05,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1156997000, now seen corresponding path program 1 times [2024-11-09 01:09:05,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:09:05,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932783269] [2024-11-09 01:09:05,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:09:05,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:09:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:06,279 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 01:09:06,282 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:09:06,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932783269] [2024-11-09 01:09:06,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932783269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:09:06,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:09:06,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:09:06,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132487445] [2024-11-09 01:09:06,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:09:06,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:09:06,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:09:06,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:09:06,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:09:06,288 INFO L87 Difference]: Start difference. First operand 504 states and 611 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 01:09:08,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:09:10,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:09:12,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:09:15,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:09:17,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:09:19,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:09:21,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:09:23,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:09:25,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:09:28,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:09:30,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:09:32,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:09:34,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:09:37,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:09:37,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:09:37,836 INFO L93 Difference]: Finished difference Result 844 states and 1029 transitions. [2024-11-09 01:09:37,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:09:37,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 109 [2024-11-09 01:09:37,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:09:37,841 INFO L225 Difference]: With dead ends: 844 [2024-11-09 01:09:37,841 INFO L226 Difference]: Without dead ends: 412 [2024-11-09 01:09:37,842 INFO L431 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 [2024-11-09 01:09:37,843 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 530 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 14 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:09:37,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 376 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 88 Invalid, 14 Unknown, 0 Unchecked, 31.5s Time] [2024-11-09 01:09:37,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-11-09 01:09:37,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2024-11-09 01:09:37,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 391 states have (on average 1.186700767263427) internal successors, (464), 396 states have internal predecessors, (464), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 01:09:37,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 497 transitions. [2024-11-09 01:09:37,869 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 497 transitions. Word has length 109 [2024-11-09 01:09:37,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:09:37,870 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 497 transitions. [2024-11-09 01:09:37,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 01:09:37,870 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 497 transitions. [2024-11-09 01:09:37,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 01:09:37,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:09:37,872 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:09:37,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 01:09:37,873 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:09:37,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:09:37,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1223747786, now seen corresponding path program 1 times [2024-11-09 01:09:37,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:09:37,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806615942] [2024-11-09 01:09:37,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:09:37,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:09:40,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:41,029 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 01:09:41,030 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:09:41,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806615942] [2024-11-09 01:09:41,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806615942] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:09:41,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809488191] [2024-11-09 01:09:41,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:09:41,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:09:41,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26127246-4d3a-4ae5-bbb6-b61fff83a126/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:09:41,034 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26127246-4d3a-4ae5-bbb6-b61fff83a126/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:09:41,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26127246-4d3a-4ae5-bbb6-b61fff83a126/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 01:10:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:28,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 940 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 01:10:28,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:10:28,567 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 01:10:28,567 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:10:28,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809488191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:10:28,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:10:28,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-11-09 01:10:28,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499128494] [2024-11-09 01:10:28,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:10:28,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:10:28,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:10:28,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:10:28,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:10:28,570 INFO L87 Difference]: Start difference. First operand 412 states and 497 transitions. Second operand has 4 states, 3 states have (on average 35.0) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 01:10:30,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:10:32,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:10:34,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:10:36,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:10:38,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:10:40,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:10:42,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:10:45,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-11-09 01:10:47,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:10:49,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:10:51,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:10:53,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:10:55,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:10:57,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:10:59,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:11:01,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:11:03,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:11:05,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:11:07,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:11:09,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:11:12,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:11:14,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:11:16,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:11:18,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:11:20,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:11:22,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:11:22,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:11:22,905 INFO L93 Difference]: Finished difference Result 803 states and 977 transitions. [2024-11-09 01:11:22,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:11:22,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 35.0) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 117 [2024-11-09 01:11:22,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:11:22,909 INFO L225 Difference]: With dead ends: 803 [2024-11-09 01:11:22,911 INFO L226 Difference]: Without dead ends: 414 [2024-11-09 01:11:22,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:11:22,913 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 0 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 3 mSolverCounterUnsat, 25 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 54.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 25 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 54.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:11:22,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 920 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 116 Invalid, 25 Unknown, 0 Unchecked, 54.3s Time] [2024-11-09 01:11:22,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-11-09 01:11:22,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2024-11-09 01:11:22,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 392 states have (on average 1.1887755102040816) internal successors, (466), 398 states have internal predecessors, (466), 17 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (19), 13 states have call predecessors, (19), 16 states have call successors, (19) [2024-11-09 01:11:22,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 502 transitions. [2024-11-09 01:11:22,946 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 502 transitions. Word has length 117 [2024-11-09 01:11:22,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:11:22,946 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 502 transitions. [2024-11-09 01:11:22,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 35.0) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 01:11:22,947 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 502 transitions. [2024-11-09 01:11:22,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 01:11:22,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:11:22,952 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:11:23,036 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26127246-4d3a-4ae5-bbb6-b61fff83a126/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 01:11:23,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26127246-4d3a-4ae5-bbb6-b61fff83a126/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-09 01:11:23,153 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:11:23,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:11:23,153 INFO L85 PathProgramCache]: Analyzing trace with hash 913781814, now seen corresponding path program 1 times [2024-11-09 01:11:23,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:11:23,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728076400] [2024-11-09 01:11:23,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:11:23,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:11:26,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:11:26,898 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 01:11:26,899 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:11:26,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728076400] [2024-11-09 01:11:26,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728076400] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:11:26,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673804998] [2024-11-09 01:11:26,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:11:26,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:11:26,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26127246-4d3a-4ae5-bbb6-b61fff83a126/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:11:26,901 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26127246-4d3a-4ae5-bbb6-b61fff83a126/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:11:26,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26127246-4d3a-4ae5-bbb6-b61fff83a126/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 01:11:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:11:56,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 1000 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 01:11:56,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:11:56,288 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 01:11:56,288 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:11:56,463 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 01:11:56,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673804998] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:11:56,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [892309555] [2024-11-09 01:11:56,514 INFO L159 IcfgInterpreter]: Started Sifa with 107 locations of interest [2024-11-09 01:11:56,516 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:11:56,522 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:11:56,528 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:11:56,528 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:12:39,794 INFO L197 IcfgInterpreter]: Interpreting procedure test_int_int with input of size 21 for LOIs [2024-11-09 01:12:39,808 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 9 for LOIs [2024-11-09 01:12:39,814 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 29 for LOIs [2024-11-09 01:12:39,840 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:13:10,839 WARN L286 SmtUtils]: Spent 6.82s on a formula simplification. DAG size of input: 239 DAG size of output: 227 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:13:23,946 WARN L286 SmtUtils]: Spent 7.06s on a formula simplification. DAG size of input: 243 DAG size of output: 227 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:14:00,604 WARN L286 SmtUtils]: Spent 28.43s on a formula simplification. DAG size of input: 500 DAG size of output: 312 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:14:03,205 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~user~0#1.base|))) (or (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 36)) (.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 28)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 32))) (and (exists ((|v_#memory_int_1070| (Array Int (Array Int Int))) (|v_#memory_int_26| (Array Int (Array Int Int)))) (let ((.cse0 (select |v_#memory_int_26| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= (store |v_#memory_int_26| |c_ULTIMATE.start_main_~user~0#1.base| (store .cse0 .cse1 4)) |c_#memory_int|) (= |v_#memory_int_26| (store |v_#memory_int_1070| |c_ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_1070| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2 |c_ULTIMATE.start_main_~_ha_hashv~0#1|) .cse3 (select .cse0 .cse3))))))) (exists ((|v_#memory_$Pointer$.base_797| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_14| (Array Int (Array Int Int)))) (let ((.cse4 (select |v_#memory_$Pointer$.base_14| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= (store |v_#memory_$Pointer$.base_14| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse4 .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1 (select .cse5 .cse1))) |c_#memory_$Pointer$.base|) (= (store |v_#memory_$Pointer$.base_797| |c_ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_797| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2 (select .cse4 .cse2))) |v_#memory_$Pointer$.base_14|)))) (exists ((|v_#memory_$Pointer$.offset_797| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_14| (Array Int (Array Int Int)))) (let ((.cse6 (select |v_#memory_$Pointer$.offset_14| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= (store |v_#memory_$Pointer$.offset_797| |c_ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_797| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2 (select .cse6 .cse2))) |v_#memory_$Pointer$.offset_14|) (= (store |v_#memory_$Pointer$.offset_14| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse6 .cse3 |c_ULTIMATE.start_main_~user~0#1.offset|) .cse1 (select .cse7 .cse1))) |c_#memory_$Pointer$.offset|)))))) (and (= c_~count_int_int~0 0) (<= 2 |c_ULTIMATE.start_main_~#i~0#1.base|) (exists ((|v_#memory_$Pointer$.base_765| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_14| (Array Int (Array Int Int)))) (let ((.cse8 (select |v_#memory_$Pointer$.base_14| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= (store |v_#memory_$Pointer$.base_14| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse8 28 |c_ULTIMATE.start_main_~user~0#1.base|) 32 (select .cse5 32))) |c_#memory_$Pointer$.base|) (= (store |v_#memory_$Pointer$.base_765| |c_ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_765| |c_ULTIMATE.start_main_~user~0#1.base|) 36 (select .cse8 36))) |v_#memory_$Pointer$.base_14|)))) (= |c_ULTIMATE.start_main_~altusers~0#1.base| 0) (= |c_ULTIMATE.start_main_~user~0#1.offset| 0) (= |c_ULTIMATE.start_main_~users~0#1.offset| 0) (<= 1 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~altusers~0#1.offset| 0) (exists ((|v_#memory_int_1038| (Array Int (Array Int Int))) (|v_#memory_int_26| (Array Int (Array Int Int)))) (let ((.cse9 (select |v_#memory_int_26| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= (store |v_#memory_int_1038| |c_ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_1038| |c_ULTIMATE.start_main_~user~0#1.base|) 36 |c_ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select .cse9 28))) |v_#memory_int_26|) (= (store |v_#memory_int_26| |c_ULTIMATE.start_main_~user~0#1.base| (store .cse9 32 4)) |c_#memory_int|)))) (= |c_ULTIMATE.start_main_~#i~0#1.offset| 0) (exists ((|v_#memory_$Pointer$.offset_765| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_14| (Array Int (Array Int Int)))) (let ((.cse10 (select |v_#memory_$Pointer$.offset_14| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= (store |v_#memory_$Pointer$.offset_765| |c_ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_765| |c_ULTIMATE.start_main_~user~0#1.base|) 36 (select .cse10 36))) |v_#memory_$Pointer$.offset_14|) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_14| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse10 28 0) 32 (select .cse7 32))))))) (= |c_ULTIMATE.start_main_~users~0#1.base| 0)))) is different from true [2024-11-09 01:14:27,569 WARN L286 SmtUtils]: Spent 7.47s on a formula simplification that was a NOOP. DAG size: 182 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:14:48,858 WARN L286 SmtUtils]: Spent 10.69s on a formula simplification that was a NOOP. DAG size: 182 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:15:48,013 WARN L286 SmtUtils]: Spent 15.66s on a formula simplification that was a NOOP. DAG size: 206 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:15:50,044 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse41 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse55 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse41)) (.cse56 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse41))) (and (exists ((|v_#valid_99| (Array Int Int)) (|v_#memory_$Pointer$.offset_800| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc62#1.base_6| Int) (|v_#memory_$Pointer$.base_800| (Array Int (Array Int Int))) (|v_#memory_int_309| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem55#1.base_15| Int) (|v_#length_45| (Array Int Int)) (|v_#memory_int_1073| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_263| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_264| (Array Int (Array Int Int))) (|v_#memory_int_310| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_265| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_265| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_264| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_263| (Array Int (Array Int Int)))) (let ((.cse0 (select (select |v_#memory_$Pointer$.base_800| |c_ULTIMATE.start_main_~user~0#1.base|) .cse41)) (.cse1 (+ 16 (select (select |v_#memory_$Pointer$.offset_800| |c_ULTIMATE.start_main_~user~0#1.base|) .cse41))) (.cse8 (select (select |v_#memory_$Pointer$.base_265| |c_ULTIMATE.start_main_~user~0#1.base|) .cse41)) (.cse9 (select (select |v_#memory_$Pointer$.offset_263| |c_ULTIMATE.start_main_~user~0#1.base|) .cse41))) (let ((.cse14 (store |v_#memory_$Pointer$.offset_263| .cse8 (store (select |v_#memory_$Pointer$.offset_263| .cse8) .cse9 0))) (.cse54 (store |v_#memory_$Pointer$.base_265| .cse8 (store (select |v_#memory_$Pointer$.base_265| .cse8) .cse9 |v_ULTIMATE.start_main_#t~malloc62#1.base_6|))) (.cse2 (store |v_#memory_$Pointer$.offset_800| .cse0 (store (select |v_#memory_$Pointer$.offset_800| .cse0) .cse1 .cse41))) (.cse17 (store |v_#memory_$Pointer$.base_800| .cse0 (store (select |v_#memory_$Pointer$.base_800| .cse0) .cse1 |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse5 (select (select |v_#memory_$Pointer$.base_263| |c_ULTIMATE.start_main_~user~0#1.base|) .cse41)) (.cse6 (+ (select (select |v_#memory_$Pointer$.offset_264| |c_ULTIMATE.start_main_~user~0#1.base|) .cse41) 20)) (.cse12 (select (select |v_#memory_$Pointer$.base_264| |c_ULTIMATE.start_main_~user~0#1.base|) .cse41)) (.cse13 (+ (select (select |v_#memory_$Pointer$.offset_265| |c_ULTIMATE.start_main_~user~0#1.base|) .cse41) 8)) (.cse3 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse41)) (.cse4 (+ (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse41) 4)) (.cse15 (select (select .cse54 |c_ULTIMATE.start_main_~user~0#1.base|) .cse41)) (.cse16 (+ 40 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse41)))) (and (<= (+ |v_ULTIMATE.start_main_#t~malloc62#1.base_6| 1) |c_#StackHeapBarrier|) (= |v_#memory_int_309| (store |v_#memory_int_1073| .cse0 (store (select |v_#memory_int_1073| .cse0) .cse1 (select (select |v_#memory_int_309| .cse0) .cse1)))) (= |c_#valid| (store |v_#valid_99| |v_ULTIMATE.start_main_#t~malloc62#1.base_6| 1)) (not (= |v_ULTIMATE.start_main_#t~malloc62#1.base_6| 0)) (= (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 (select (select |v_#memory_$Pointer$.offset_265| .cse3) .cse4))) |v_#memory_$Pointer$.offset_265|) (= (store |v_#memory_$Pointer$.base_263| .cse5 (store (select |v_#memory_$Pointer$.base_263| .cse5) .cse6 (select (select |v_#memory_$Pointer$.base_265| .cse5) .cse6))) |v_#memory_$Pointer$.base_265|) (= (let ((.cse7 (let ((.cse10 (let ((.cse11 (store |v_#memory_int_309| .cse3 (store (select |v_#memory_int_309| .cse3) .cse4 32)))) (store .cse11 .cse12 (store (select .cse11 .cse12) .cse13 5))))) (store .cse10 .cse5 (store (select .cse10 .cse5) .cse6 8))))) (store .cse7 .cse8 (store (select .cse7 .cse8) .cse9 (select (select |v_#memory_int_310| .cse8) .cse9)))) |v_#memory_int_310|) (= |v_#memory_$Pointer$.offset_264| (store |v_#memory_$Pointer$.offset_265| .cse12 (store (select |v_#memory_$Pointer$.offset_265| .cse12) .cse13 (select (select |v_#memory_$Pointer$.offset_264| .cse12) .cse13)))) (= |v_#memory_$Pointer$.offset_263| (store |v_#memory_$Pointer$.offset_264| .cse5 (store (select |v_#memory_$Pointer$.offset_264| .cse5) .cse6 (select (select |v_#memory_$Pointer$.offset_263| .cse5) .cse6)))) (= (store |v_#memory_$Pointer$.base_264| .cse12 (store (select |v_#memory_$Pointer$.base_264| .cse12) .cse13 (select (select |v_#memory_$Pointer$.base_263| .cse12) .cse13))) |v_#memory_$Pointer$.base_263|) (= (store .cse14 .cse15 (store (select .cse14 .cse15) .cse16 (select (select |c_#memory_$Pointer$.offset| .cse15) .cse16))) |c_#memory_$Pointer$.offset|) (= (store .cse17 .cse3 (store (select .cse17 .cse3) .cse4 (select (select |v_#memory_$Pointer$.base_264| .cse3) .cse4))) |v_#memory_$Pointer$.base_264|) (= |c_#memory_int| (store |v_#memory_int_310| .cse15 (store (select |v_#memory_int_310| .cse15) .cse16 2685476833))) (= (select |v_#valid_99| |v_ULTIMATE.start_main_#t~malloc62#1.base_6|) 0) (let ((.cse24 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 28)) (.cse25 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 32)) (.cse27 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 36)) (.cse31 (= c_~count_int_int~0 0)) (.cse32 (<= 2 |c_ULTIMATE.start_main_~#i~0#1.base|)) (.cse35 (= |c_ULTIMATE.start_main_~altusers~0#1.base| 0)) (.cse36 (= |c_ULTIMATE.start_main_~user~0#1.offset| 0)) (.cse37 (<= 1 |c_#StackHeapBarrier|)) (.cse38 (= |c_ULTIMATE.start_main_~altusers~0#1.offset| 0)) (.cse39 (= |c_ULTIMATE.start_main_~#i~0#1.offset| 0)) (.cse21 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 12)) (.cse42 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 16)) (.cse18 (exists ((|v_#Ultimate.C_memset_#t~loopctr652_35| Int)) (and (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr652_35| 4294967296)) (<= 0 |v_#Ultimate.C_memset_#t~loopctr652_35|))))) (or (and .cse18 (exists ((|v_#memory_$Pointer$.offset_798| (Array Int (Array Int Int))) (|v_#memory_int_308| (Array Int (Array Int Int))) (|v_#valid_98| (Array Int Int)) (|v_old(#memory_int)_AFTER_CALL_25| (Array Int (Array Int Int))) (|v_#memory_int_1072| (Array Int (Array Int Int))) (|v_#memory_int_1071| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_798| (Array Int (Array Int Int))) (|v_#length_44| (Array Int Int)) (|v_#memory_$Pointer$.base_BEFORE_CALL_34| (Array Int (Array Int Int)))) (let ((.cse22 (select |v_#memory_int_1072| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse26 (select |v_#memory_$Pointer$.base_798| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse19 (select (select |v_#memory_$Pointer$.base_BEFORE_CALL_34| |c_ULTIMATE.start_main_~user~0#1.base|) .cse41)) (.cse20 (select |v_#memory_int_308| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (not (= 0 .cse19)) (= (store |v_#length_44| .cse19 44) |v_#length_45|) (= |v_#memory_int_1072| (store |v_#memory_int_308| |c_ULTIMATE.start_main_~user~0#1.base| (store .cse20 .cse21 (select .cse22 .cse21)))) (let ((.cse30 (select |v_#memory_$Pointer$.offset_798| |c_ULTIMATE.start_main_~user~0#1.base|))) (or (and (exists ((|v_#memory_$Pointer$.base_797| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_14| (Array Int (Array Int Int)))) (let ((.cse23 (select |v_#memory_$Pointer$.base_14| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= (store |v_#memory_$Pointer$.base_14| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse23 .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse25 (select .cse26 .cse25))) |v_#memory_$Pointer$.base_798|) (= (store |v_#memory_$Pointer$.base_797| |c_ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_797| |c_ULTIMATE.start_main_~user~0#1.base|) .cse27 (select .cse23 .cse27))) |v_#memory_$Pointer$.base_14|)))) (exists ((|v_#memory_int_1070| (Array Int (Array Int Int))) (|v_#memory_int_26| (Array Int (Array Int Int)))) (let ((.cse28 (select |v_#memory_int_26| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= |v_#memory_int_26| (store |v_#memory_int_1070| |c_ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_1070| |c_ULTIMATE.start_main_~user~0#1.base|) .cse27 |c_ULTIMATE.start_main_~_ha_hashv~0#1|) .cse24 (select .cse28 .cse24)))) (= (store |v_#memory_int_26| |c_ULTIMATE.start_main_~user~0#1.base| (store .cse28 .cse25 4)) |v_#memory_int_1071|)))) (exists ((|v_#memory_$Pointer$.offset_797| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_14| (Array Int (Array Int Int)))) (let ((.cse29 (select |v_#memory_$Pointer$.offset_14| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= |v_#memory_$Pointer$.offset_798| (store |v_#memory_$Pointer$.offset_14| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse29 .cse24 |c_ULTIMATE.start_main_~user~0#1.offset|) .cse25 (select .cse30 .cse25)))) (= (store |v_#memory_$Pointer$.offset_797| |c_ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_797| |c_ULTIMATE.start_main_~user~0#1.base|) .cse27 (select .cse29 .cse27))) |v_#memory_$Pointer$.offset_14|))))) (and .cse31 .cse32 (exists ((|v_#memory_int_1038| (Array Int (Array Int Int))) (|v_#memory_int_26| (Array Int (Array Int Int)))) (let ((.cse33 (select |v_#memory_int_26| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= (store |v_#memory_int_26| |c_ULTIMATE.start_main_~user~0#1.base| (store .cse33 32 4)) |v_#memory_int_1071|) (= (store |v_#memory_int_1038| |c_ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_1038| |c_ULTIMATE.start_main_~user~0#1.base|) 36 |c_ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select .cse33 28))) |v_#memory_int_26|)))) (exists ((|v_#memory_$Pointer$.offset_765| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_14| (Array Int (Array Int Int)))) (let ((.cse34 (select |v_#memory_$Pointer$.offset_14| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= (store |v_#memory_$Pointer$.offset_765| |c_ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_765| |c_ULTIMATE.start_main_~user~0#1.base|) 36 (select .cse34 36))) |v_#memory_$Pointer$.offset_14|) (= (store |v_#memory_$Pointer$.offset_14| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse34 28 0) 32 (select .cse30 32))) |v_#memory_$Pointer$.offset_798|)))) .cse35 .cse36 .cse37 .cse38 .cse39 (exists ((|v_#memory_$Pointer$.base_765| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_14| (Array Int (Array Int Int)))) (let ((.cse40 (select |v_#memory_$Pointer$.base_14| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= (store |v_#memory_$Pointer$.base_765| |c_ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_765| |c_ULTIMATE.start_main_~user~0#1.base|) 36 (select .cse40 36))) |v_#memory_$Pointer$.base_14|) (= (store |v_#memory_$Pointer$.base_14| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse40 28 |c_ULTIMATE.start_main_~user~0#1.base|) 32 (select .cse26 32))) |v_#memory_$Pointer$.base_798|))))))) (= (select |v_#valid_98| .cse19) 0) (= (store |v_#valid_98| .cse19 1) |v_#valid_99|) (= |v_old(#memory_int)_AFTER_CALL_25| (store |v_#memory_int_1072| |c_ULTIMATE.start_main_~user~0#1.base| (store .cse22 .cse41 (select (select |v_old(#memory_int)_AFTER_CALL_25| |c_ULTIMATE.start_main_~user~0#1.base|) .cse41)))) (= |v_#memory_$Pointer$.base_BEFORE_CALL_34| (store |v_#memory_$Pointer$.base_798| |c_ULTIMATE.start_main_~user~0#1.base| (store (store (store .cse26 .cse42 0) .cse21 0) .cse41 .cse19))) (= |v_ULTIMATE.start_main_#t~mem55#1.base_15| .cse19) (<= (+ 1 .cse19) |c_#StackHeapBarrier|) (= (store |v_#memory_int_1071| |c_ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_1071| |c_ULTIMATE.start_main_~user~0#1.base|) .cse42 (select .cse20 .cse42))) |v_#memory_int_308|))))) (and (exists ((|v_old(#memory_int)_AFTER_CALL_26| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_798| (Array Int (Array Int Int))) (|v_#memory_int_308| (Array Int (Array Int Int))) (|v_#valid_98| (Array Int Int)) (|v_#memory_int_1072| (Array Int (Array Int Int))) (|v_#memory_int_1071| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_798| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_26| (Array Int (Array Int Int))) (|v_#length_44| (Array Int Int))) (let ((.cse47 (select |v_#memory_$Pointer$.base_798| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse43 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_26| |c_ULTIMATE.start_main_~user~0#1.base|) .cse41)) (.cse45 (select |v_#memory_int_1072| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse44 (select |v_#memory_int_308| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (<= (+ .cse43 1) |c_#StackHeapBarrier|) (= |v_ULTIMATE.start_main_#t~mem55#1.base_15| .cse43) (= (store |v_#valid_98| .cse43 1) |v_#valid_99|) (= |v_#memory_int_1072| (store |v_#memory_int_308| |c_ULTIMATE.start_main_~user~0#1.base| (store .cse44 .cse21 (select .cse45 .cse21)))) (let ((.cse50 (select |v_#memory_$Pointer$.offset_798| |c_ULTIMATE.start_main_~user~0#1.base|))) (or (and (exists ((|v_#memory_$Pointer$.base_797| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_14| (Array Int (Array Int Int)))) (let ((.cse46 (select |v_#memory_$Pointer$.base_14| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= (store |v_#memory_$Pointer$.base_14| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse46 .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse25 (select .cse47 .cse25))) |v_#memory_$Pointer$.base_798|) (= (store |v_#memory_$Pointer$.base_797| |c_ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_797| |c_ULTIMATE.start_main_~user~0#1.base|) .cse27 (select .cse46 .cse27))) |v_#memory_$Pointer$.base_14|)))) (exists ((|v_#memory_int_1070| (Array Int (Array Int Int))) (|v_#memory_int_26| (Array Int (Array Int Int)))) (let ((.cse48 (select |v_#memory_int_26| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= |v_#memory_int_26| (store |v_#memory_int_1070| |c_ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_1070| |c_ULTIMATE.start_main_~user~0#1.base|) .cse27 |c_ULTIMATE.start_main_~_ha_hashv~0#1|) .cse24 (select .cse48 .cse24)))) (= (store |v_#memory_int_26| |c_ULTIMATE.start_main_~user~0#1.base| (store .cse48 .cse25 4)) |v_#memory_int_1071|)))) (exists ((|v_#memory_$Pointer$.offset_797| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_14| (Array Int (Array Int Int)))) (let ((.cse49 (select |v_#memory_$Pointer$.offset_14| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= |v_#memory_$Pointer$.offset_798| (store |v_#memory_$Pointer$.offset_14| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse49 .cse24 |c_ULTIMATE.start_main_~user~0#1.offset|) .cse25 (select .cse50 .cse25)))) (= (store |v_#memory_$Pointer$.offset_797| |c_ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_797| |c_ULTIMATE.start_main_~user~0#1.base|) .cse27 (select .cse49 .cse27))) |v_#memory_$Pointer$.offset_14|))))) (and .cse31 .cse32 (exists ((|v_#memory_int_1038| (Array Int (Array Int Int))) (|v_#memory_int_26| (Array Int (Array Int Int)))) (let ((.cse51 (select |v_#memory_int_26| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= (store |v_#memory_int_26| |c_ULTIMATE.start_main_~user~0#1.base| (store .cse51 32 4)) |v_#memory_int_1071|) (= (store |v_#memory_int_1038| |c_ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_1038| |c_ULTIMATE.start_main_~user~0#1.base|) 36 |c_ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select .cse51 28))) |v_#memory_int_26|)))) (exists ((|v_#memory_$Pointer$.offset_765| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_14| (Array Int (Array Int Int)))) (let ((.cse52 (select |v_#memory_$Pointer$.offset_14| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= (store |v_#memory_$Pointer$.offset_765| |c_ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_765| |c_ULTIMATE.start_main_~user~0#1.base|) 36 (select .cse52 36))) |v_#memory_$Pointer$.offset_14|) (= (store |v_#memory_$Pointer$.offset_14| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse52 28 0) 32 (select .cse50 32))) |v_#memory_$Pointer$.offset_798|)))) .cse35 .cse36 .cse37 .cse38 .cse39 (exists ((|v_#memory_$Pointer$.base_765| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_14| (Array Int (Array Int Int)))) (let ((.cse53 (select |v_#memory_$Pointer$.base_14| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= (store |v_#memory_$Pointer$.base_765| |c_ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_765| |c_ULTIMATE.start_main_~user~0#1.base|) 36 (select .cse53 36))) |v_#memory_$Pointer$.base_14|) (= (store |v_#memory_$Pointer$.base_14| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse53 28 |c_ULTIMATE.start_main_~user~0#1.base|) 32 (select .cse47 32))) |v_#memory_$Pointer$.base_798|))))))) (not (= .cse43 0)) (= (select |v_#valid_98| .cse43) 0) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_26| (store |v_#memory_$Pointer$.base_798| |c_ULTIMATE.start_main_~user~0#1.base| (store (store (store .cse47 .cse42 0) .cse21 0) .cse41 .cse43))) (= (store |v_#length_44| .cse43 44) |v_#length_45|) (= |v_old(#memory_int)_AFTER_CALL_26| (store |v_#memory_int_1072| |c_ULTIMATE.start_main_~user~0#1.base| (store .cse45 .cse41 (select (select |v_old(#memory_int)_AFTER_CALL_26| |c_ULTIMATE.start_main_~user~0#1.base|) .cse41)))) (= (store |v_#memory_int_1071| |c_ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_1071| |c_ULTIMATE.start_main_~user~0#1.base|) .cse42 (select .cse44 .cse42))) |v_#memory_int_308|)))) .cse18))) (= (store |v_#length_45| |v_ULTIMATE.start_main_#t~malloc62#1.base_6| 384) |c_#length|) (= (store .cse54 .cse15 (store (select .cse54 .cse15) .cse16 (select (select |c_#memory_$Pointer$.base| .cse15) .cse16))) |c_#memory_$Pointer$.base|)))))) (= |c_ULTIMATE.start_main_#t~mem65#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse55) .cse56)) (= (select (select |c_#memory_$Pointer$.base| .cse55) .cse56) |c_ULTIMATE.start_main_#t~mem65#1.base|)))) is different from false [2024-11-09 01:16:12,238 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 60)) (.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 64)) (.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 68))) (and (exists ((|v_#memory_$Pointer$.base_99| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_803| (Array Int (Array Int Int)))) (let ((.cse0 (select |v_#memory_$Pointer$.base_99| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= (store |v_#memory_$Pointer$.base_99| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse0 .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) |c_#memory_$Pointer$.base|) (= (store |v_#memory_$Pointer$.base_803| |c_ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_803| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3 (select .cse0 .cse3))) |v_#memory_$Pointer$.base_99|)))) (exists ((|v_#memory_int_119| (Array Int (Array Int Int))) (|v_#memory_int_1076| (Array Int (Array Int Int)))) (let ((.cse4 (select |v_#memory_int_119| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= (store |v_#memory_int_1076| |c_ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_1076| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3 |c_ULTIMATE.start_main_~_ha_hashv~1#1|) .cse1 (select .cse4 .cse1))) |v_#memory_int_119|) (= (store |v_#memory_int_119| |c_ULTIMATE.start_main_~user~0#1.base| (store .cse4 .cse2 4)) |c_#memory_int|)))) (exists ((|v_#memory_$Pointer$.offset_99| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_803| (Array Int (Array Int Int)))) (let ((.cse5 (select |v_#memory_$Pointer$.offset_99| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= (store |v_#memory_$Pointer$.offset_99| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse5 .cse1 |c_ULTIMATE.start_main_~user~0#1.offset|) .cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) |c_#memory_$Pointer$.offset|) (= (store |v_#memory_$Pointer$.offset_803| |c_ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_803| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3 (select .cse5 .cse3))) |v_#memory_$Pointer$.offset_99|)))))) is different from true [2024-11-09 01:16:12,339 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 48)) (.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 44)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 60)) (.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 64)) (.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 68))) (and (exists ((|v_#memory_$Pointer$.offset_99| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_803| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_804| (Array Int (Array Int Int)))) (let ((.cse3 (select |v_#memory_$Pointer$.offset_804| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse0 (select |v_#memory_$Pointer$.offset_99| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= (store |v_#memory_$Pointer$.offset_99| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse0 .cse1 |c_ULTIMATE.start_main_~user~0#1.offset|) .cse2 (select .cse3 .cse2))) |v_#memory_$Pointer$.offset_804|) (= (store |v_#memory_$Pointer$.offset_804| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse3 .cse4 0) .cse5 0)) |c_#memory_$Pointer$.offset|) (= (store |v_#memory_$Pointer$.offset_803| |c_ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_803| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6 (select .cse0 .cse6))) |v_#memory_$Pointer$.offset_99|)))) (exists ((|v_#memory_int_119| (Array Int (Array Int Int))) (|v_#memory_int_1076| (Array Int (Array Int Int))) (|v_#memory_int_311| (Array Int (Array Int Int)))) (let ((.cse7 (select |v_#memory_int_119| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse8 (select |v_#memory_int_311| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= (store |v_#memory_int_1076| |c_ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_1076| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6 |c_ULTIMATE.start_main_~_ha_hashv~1#1|) .cse1 (select .cse7 .cse1))) |v_#memory_int_119|) (= (store |v_#memory_int_119| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse7 .cse2 4) .cse4 (select .cse8 .cse4))) |v_#memory_int_311|) (= |c_#memory_int| (store |v_#memory_int_311| |c_ULTIMATE.start_main_~user~0#1.base| (store .cse8 .cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))))) (exists ((|v_#memory_$Pointer$.base_99| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_804| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_803| (Array Int (Array Int Int)))) (let ((.cse9 (select |v_#memory_$Pointer$.base_804| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse10 (select |v_#memory_$Pointer$.base_99| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= (store |v_#memory_$Pointer$.base_804| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse9 .cse4 0) .cse5 0)) |c_#memory_$Pointer$.base|) (= (store |v_#memory_$Pointer$.base_99| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse10 .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2 (select .cse9 .cse2))) |v_#memory_$Pointer$.base_804|) (= (store |v_#memory_$Pointer$.base_803| |c_ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_803| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6 (select .cse10 .cse6))) |v_#memory_$Pointer$.base_99|)))))) is different from true [2024-11-09 01:16:49,720 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse19 (+ 40 |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse19)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse19))) (and (= |c_ULTIMATE.start_main_#t~mem214#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1)) (= |c_ULTIMATE.start_main_#t~mem214#1.base| (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)) (exists ((|v_#memory_$Pointer$.offset_269| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_806| (Array Int (Array Int Int))) (|v_#memory_int_313| (Array Int (Array Int Int))) (|v_#memory_int_312| (Array Int (Array Int Int))) (|v_#valid_101| (Array Int Int)) (|v_#memory_$Pointer$.offset_806| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem204#1.base_17| Int) (|v_#memory_int_1079| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc211#1.base_6| Int) (|v_#memory_$Pointer$.base_270| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_270| (Array Int (Array Int Int))) (|v_#length_47| (Array Int Int)) (|v_#memory_$Pointer$.base_269| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_268| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_268| (Array Int (Array Int Int)))) (let ((.cse37 (select (select |v_#memory_$Pointer$.base_268| |c_ULTIMATE.start_main_~user~0#1.base|) .cse19)) (.cse38 (select (select |v_#memory_$Pointer$.offset_268| |c_ULTIMATE.start_main_~user~0#1.base|) .cse19)) (.cse4 (select (select |v_#memory_$Pointer$.base_806| |c_ULTIMATE.start_main_~user~0#1.base|) .cse19)) (.cse5 (+ 16 (select (select |v_#memory_$Pointer$.offset_806| |c_ULTIMATE.start_main_~user~0#1.base|) .cse19)))) (let ((.cse41 (store |v_#memory_$Pointer$.offset_806| .cse4 (store (select |v_#memory_$Pointer$.offset_806| .cse4) .cse5 .cse19))) (.cse6 (store |v_#memory_$Pointer$.base_806| .cse4 (store (select |v_#memory_$Pointer$.base_806| .cse4) .cse5 |c_ULTIMATE.start_main_~user~0#1.base|))) (.cse34 (store |v_#memory_$Pointer$.offset_268| .cse37 (store (select |v_#memory_$Pointer$.offset_268| .cse37) .cse38 0))) (.cse35 (store |v_#memory_$Pointer$.base_268| .cse37 (store (select |v_#memory_$Pointer$.base_268| .cse37) .cse38 |v_ULTIMATE.start_main_#t~malloc211#1.base_6|)))) (let ((.cse9 (select (select .cse35 |c_ULTIMATE.start_main_~user~0#1.base|) .cse19)) (.cse10 (+ 40 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse19))) (.cse2 (select (select |v_#memory_$Pointer$.base_269| |c_ULTIMATE.start_main_~user~0#1.base|) .cse19)) (.cse3 (+ (select (select |v_#memory_$Pointer$.offset_269| |c_ULTIMATE.start_main_~user~0#1.base|) .cse19) 20)) (.cse11 (select (select |v_#memory_$Pointer$.base_270| |c_ULTIMATE.start_main_~user~0#1.base|) .cse19)) (.cse12 (+ (select (select |v_#memory_$Pointer$.offset_270| |c_ULTIMATE.start_main_~user~0#1.base|) .cse19) 8)) (.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse19)) (.cse8 (+ (select (select .cse41 |c_ULTIMATE.start_main_~user~0#1.base|) .cse19) 4))) (and (not (= |v_ULTIMATE.start_main_#t~malloc211#1.base_6| 0)) (= (store |v_#memory_$Pointer$.base_269| .cse2 (store (select |v_#memory_$Pointer$.base_269| .cse2) .cse3 (select (select |v_#memory_$Pointer$.base_268| .cse2) .cse3))) |v_#memory_$Pointer$.base_268|) (<= (+ |v_ULTIMATE.start_main_#t~malloc211#1.base_6| 1) |c_#StackHeapBarrier|) (= |v_#memory_int_312| (store |v_#memory_int_1079| .cse4 (store (select |v_#memory_int_1079| .cse4) .cse5 (select (select |v_#memory_int_312| .cse4) .cse5)))) (= |v_#memory_$Pointer$.base_270| (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 (select (select |v_#memory_$Pointer$.base_270| .cse7) .cse8)))) (= (select |v_#valid_101| |v_ULTIMATE.start_main_#t~malloc211#1.base_6|) 0) (= (store |v_#memory_int_313| .cse9 (store (select |v_#memory_int_313| .cse9) .cse10 2685476833)) |c_#memory_int|) (= (store |v_#memory_$Pointer$.offset_270| .cse11 (store (select |v_#memory_$Pointer$.offset_270| .cse11) .cse12 (select (select |v_#memory_$Pointer$.offset_269| .cse11) .cse12))) |v_#memory_$Pointer$.offset_269|) (= |c_#valid| (store |v_#valid_101| |v_ULTIMATE.start_main_#t~malloc211#1.base_6| 1)) (= |c_#length| (store |v_#length_47| |v_ULTIMATE.start_main_#t~malloc211#1.base_6| 384)) (let ((.cse21 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 60)) (.cse22 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 64)) (.cse23 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 68))) (let ((.cse13 (exists ((|v_#memory_$Pointer$.offset_99| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_803| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_804| (Array Int (Array Int Int)))) (let ((.cse33 (select |v_#memory_$Pointer$.offset_99| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= (store |v_#memory_$Pointer$.offset_99| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse33 .cse21 |c_ULTIMATE.start_main_~user~0#1.offset|) .cse22 (select (select |v_#memory_$Pointer$.offset_804| |c_ULTIMATE.start_main_~user~0#1.base|) .cse22))) |v_#memory_$Pointer$.offset_804|) (= (store |v_#memory_$Pointer$.offset_803| |c_ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_803| |c_ULTIMATE.start_main_~user~0#1.base|) .cse23 (select .cse33 .cse23))) |v_#memory_$Pointer$.offset_99|))))) (.cse14 (exists ((|v_#Ultimate.C_memset_#t~loopctr652_35| Int)) (and (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr652_35| 4294967296)) (<= 0 |v_#Ultimate.C_memset_#t~loopctr652_35|)))) (.cse17 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 48)) (.cse18 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 44))) (or (and .cse13 .cse14 (exists ((|v_#memory_$Pointer$.base_804| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_99| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_803| (Array Int (Array Int Int))) (|v_#length_46| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_30| (Array Int (Array Int Int))) (|v_#valid_100| (Array Int Int))) (let ((.cse16 (select |v_#memory_$Pointer$.base_804| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse15 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_30| |c_ULTIMATE.start_main_~user~0#1.base|) .cse19)) (.cse20 (select |v_#memory_$Pointer$.base_99| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (<= (+ .cse15 1) |c_#StackHeapBarrier|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_30| (store |v_#memory_$Pointer$.base_804| |c_ULTIMATE.start_main_~user~0#1.base| (store (store (store .cse16 .cse17 0) .cse18 0) .cse19 .cse15))) (= (select |v_#valid_100| .cse15) 0) (= .cse15 |v_ULTIMATE.start_main_#t~mem204#1.base_17|) (not (= .cse15 0)) (= (store |v_#memory_$Pointer$.base_99| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse20 .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse22 (select .cse16 .cse22))) |v_#memory_$Pointer$.base_804|) (= (store |v_#length_46| .cse15 44) |v_#length_47|) (= (store |v_#valid_100| .cse15 1) |v_#valid_101|) (= (store |v_#memory_$Pointer$.base_803| |c_ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_803| |c_ULTIMATE.start_main_~user~0#1.base|) .cse23 (select .cse20 .cse23))) |v_#memory_$Pointer$.base_99|)))) (exists ((|v_#memory_int_119| (Array Int (Array Int Int))) (|v_#memory_int_1076| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_30| (Array Int (Array Int Int))) (|v_#memory_int_311| (Array Int (Array Int Int))) (|v_#memory_int_1078| (Array Int (Array Int Int)))) (let ((.cse25 (select |v_#memory_int_1078| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse24 (select |v_#memory_int_119| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse26 (select |v_#memory_int_311| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= (store |v_#memory_int_1076| |c_ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_1076| |c_ULTIMATE.start_main_~user~0#1.base|) .cse23 |c_ULTIMATE.start_main_~_ha_hashv~1#1|) .cse21 (select .cse24 .cse21))) |v_#memory_int_119|) (= |v_old(#memory_int)_AFTER_CALL_30| (store |v_#memory_int_1078| |c_ULTIMATE.start_main_~user~0#1.base| (store .cse25 .cse19 (select (select |v_old(#memory_int)_AFTER_CALL_30| |c_ULTIMATE.start_main_~user~0#1.base|) .cse19)))) (= (store |v_#memory_int_311| |c_ULTIMATE.start_main_~user~0#1.base| (store .cse26 .cse18 (select .cse25 .cse18))) |v_#memory_int_1078|) (= (store |v_#memory_int_119| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse24 .cse22 4) .cse17 (select .cse26 .cse17))) |v_#memory_int_311|))))) (and .cse13 .cse14 (exists ((|v_#memory_int_119| (Array Int (Array Int Int))) (|v_#memory_int_1076| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_42| (Array Int (Array Int Int))) (|v_#memory_int_311| (Array Int (Array Int Int))) (|v_#memory_int_1078| (Array Int (Array Int Int)))) (let ((.cse29 (select |v_#memory_int_1078| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse27 (select |v_#memory_int_119| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse28 (select |v_#memory_int_311| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= (store |v_#memory_int_1076| |c_ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_1076| |c_ULTIMATE.start_main_~user~0#1.base|) .cse23 |c_ULTIMATE.start_main_~_ha_hashv~1#1|) .cse21 (select .cse27 .cse21))) |v_#memory_int_119|) (= (store |v_#memory_int_311| |c_ULTIMATE.start_main_~user~0#1.base| (store .cse28 .cse18 (select .cse29 .cse18))) |v_#memory_int_1078|) (= (store |v_#memory_int_1078| |c_ULTIMATE.start_main_~user~0#1.base| (store .cse29 .cse19 (select (select |v_#memory_int_BEFORE_CALL_42| |c_ULTIMATE.start_main_~user~0#1.base|) .cse19))) |v_#memory_int_BEFORE_CALL_42|) (= (store |v_#memory_int_119| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse27 .cse22 4) .cse17 (select .cse28 .cse17))) |v_#memory_int_311|)))) (exists ((|v_#memory_$Pointer$.base_804| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_99| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_803| (Array Int (Array Int Int))) (|v_#length_46| (Array Int Int)) (|v_#valid_100| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_29| (Array Int (Array Int Int)))) (let ((.cse31 (select |v_#memory_$Pointer$.base_804| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse30 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_29| |c_ULTIMATE.start_main_~user~0#1.base|) .cse19)) (.cse32 (select |v_#memory_$Pointer$.base_99| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= .cse30 |v_ULTIMATE.start_main_#t~mem204#1.base_17|) (= (store |v_#length_46| .cse30 44) |v_#length_47|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_29| (store |v_#memory_$Pointer$.base_804| |c_ULTIMATE.start_main_~user~0#1.base| (store (store (store .cse31 .cse17 0) .cse18 0) .cse19 .cse30))) (= (store |v_#valid_100| .cse30 1) |v_#valid_101|) (= (select |v_#valid_100| .cse30) 0) (not (= .cse30 0)) (= (store |v_#memory_$Pointer$.base_99| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse32 .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse22 (select .cse31 .cse22))) |v_#memory_$Pointer$.base_804|) (<= (+ .cse30 1) |c_#StackHeapBarrier|) (= (store |v_#memory_$Pointer$.base_803| |c_ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_803| |c_ULTIMATE.start_main_~user~0#1.base|) .cse23 (select .cse32 .cse23))) |v_#memory_$Pointer$.base_99|)))))))) (= (store .cse34 .cse9 (store (select .cse34 .cse9) .cse10 (select (select |c_#memory_$Pointer$.offset| .cse9) .cse10))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (store .cse35 .cse9 (store (select .cse35 .cse9) .cse10 (select (select |c_#memory_$Pointer$.base| .cse9) .cse10)))) (= (store |v_#memory_$Pointer$.base_270| .cse11 (store (select |v_#memory_$Pointer$.base_270| .cse11) .cse12 (select (select |v_#memory_$Pointer$.base_269| .cse11) .cse12))) |v_#memory_$Pointer$.base_269|) (= |v_#memory_$Pointer$.offset_268| (store |v_#memory_$Pointer$.offset_269| .cse2 (store (select |v_#memory_$Pointer$.offset_269| .cse2) .cse3 (select (select |v_#memory_$Pointer$.offset_268| .cse2) .cse3)))) (= |v_#memory_int_313| (let ((.cse36 (let ((.cse39 (let ((.cse40 (store |v_#memory_int_312| .cse7 (store (select |v_#memory_int_312| .cse7) .cse8 32)))) (store .cse40 .cse11 (store (select .cse40 .cse11) .cse12 5))))) (store .cse39 .cse2 (store (select .cse39 .cse2) .cse3 40))))) (store .cse36 .cse37 (store (select .cse36 .cse37) .cse38 (select (select |v_#memory_int_313| .cse37) .cse38))))) (= (store .cse41 .cse7 (store (select .cse41 .cse7) .cse8 (select (select |v_#memory_$Pointer$.offset_270| .cse7) .cse8))) |v_#memory_$Pointer$.offset_270|))))))))) is different from false [2024-11-09 01:19:06,185 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '12273#(and (<= 1 |#StackHeapBarrier|) (= |__VERIFIER_assert_#in~cond| 0) (= ~count_int_int~0 1))' at error location [2024-11-09 01:19:06,185 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:19:06,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:19:06,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-09 01:19:06,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105222636] [2024-11-09 01:19:06,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:19:06,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:19:06,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:19:06,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:19:06,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=2418, Unknown=60, NotChecked=520, Total=3192 [2024-11-09 01:19:06,190 INFO L87 Difference]: Start difference. First operand 414 states and 502 transitions. Second operand has 10 states, 7 states have (on average 16.571428571428573) internal successors, (116), 10 states have internal predecessors, (116), 2 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 01:19:08,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:19:09,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:19:11,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:19:13,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:19:15,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:19:17,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:19:19,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:19:21,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:19:23,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:19:27,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:19:29,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:19:31,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:19:33,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:19:35,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:19:37,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:19:39,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:19:41,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []