./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a81d76a671fec08918102c7898e8919d02b265d05707efa1508363dab4714d44 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 05:36:48,366 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 05:36:48,431 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-14 05:36:48,436 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 05:36:48,437 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 05:36:48,460 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 05:36:48,461 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 05:36:48,461 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 05:36:48,461 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 05:36:48,461 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 05:36:48,461 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 05:36:48,462 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 05:36:48,462 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 05:36:48,462 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 05:36:48,462 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 05:36:48,462 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 05:36:48,462 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 05:36:48,462 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 05:36:48,462 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 05:36:48,462 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 05:36:48,463 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 05:36:48,463 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 05:36:48,463 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 05:36:48,464 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 05:36:48,464 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 05:36:48,464 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 05:36:48,464 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 05:36:48,464 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 05:36:48,464 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 05:36:48,465 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 05:36:48,465 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 05:36:48,465 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 05:36:48,465 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 05:36:48,465 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 05:36:48,465 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 05:36:48,465 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 05:36:48,466 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 05:36:48,466 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 05:36:48,466 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 05:36:48,466 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 05:36:48,466 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 05:36:48,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:36:48,467 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 05:36:48,467 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 05:36:48,467 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 05:36:48,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 05:36:48,467 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 05:36:48,467 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 05:36:48,467 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 05:36:48,467 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a81d76a671fec08918102c7898e8919d02b265d05707efa1508363dab4714d44 [2024-11-14 05:36:48,789 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 05:36:48,798 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 05:36:48,802 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 05:36:48,803 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 05:36:48,804 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 05:36:48,806 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i Unable to find full path for "g++" [2024-11-14 05:36:50,710 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 05:36:51,099 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 05:36:51,100 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i [2024-11-14 05:36:51,122 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/data/d25314b88/a37f6cc45ca3415e82363a0e3eac39a9/FLAG2db904787 [2024-11-14 05:36:51,148 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/data/d25314b88/a37f6cc45ca3415e82363a0e3eac39a9 [2024-11-14 05:36:51,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 05:36:51,152 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 05:36:51,154 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 05:36:51,154 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 05:36:51,162 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 05:36:51,163 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:36:51" (1/1) ... [2024-11-14 05:36:51,164 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@141380a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:36:51, skipping insertion in model container [2024-11-14 05:36:51,167 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:36:51" (1/1) ... [2024-11-14 05:36:51,218 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:36:51,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:36:51,678 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 05:36:51,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:36:51,759 INFO L204 MainTranslator]: Completed translation [2024-11-14 05:36:51,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:36:51 WrapperNode [2024-11-14 05:36:51,761 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 05:36:51,762 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 05:36:51,762 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 05:36:51,766 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 05:36:51,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:36:51" (1/1) ... [2024-11-14 05:36:51,793 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:36:51" (1/1) ... [2024-11-14 05:36:51,837 INFO L138 Inliner]: procedures = 126, calls = 38, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 112 [2024-11-14 05:36:51,840 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 05:36:51,841 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 05:36:51,841 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 05:36:51,841 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 05:36:51,850 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:36:51" (1/1) ... [2024-11-14 05:36:51,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:36:51" (1/1) ... [2024-11-14 05:36:51,857 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:36:51" (1/1) ... [2024-11-14 05:36:51,861 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:36:51" (1/1) ... [2024-11-14 05:36:51,876 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:36:51" (1/1) ... [2024-11-14 05:36:51,883 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:36:51" (1/1) ... [2024-11-14 05:36:51,892 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:36:51" (1/1) ... [2024-11-14 05:36:51,893 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:36:51" (1/1) ... [2024-11-14 05:36:51,900 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 05:36:51,901 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 05:36:51,901 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 05:36:51,902 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 05:36:51,907 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:36:51" (1/1) ... [2024-11-14 05:36:51,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:36:51,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:36:51,951 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 05:36:51,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 05:36:51,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 05:36:51,993 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-14 05:36:51,993 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-14 05:36:51,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 05:36:51,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 05:36:51,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 05:36:51,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 05:36:51,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 05:36:51,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 05:36:51,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-14 05:36:51,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 05:36:51,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 05:36:51,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 05:36:52,150 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 05:36:52,153 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 05:36:52,726 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-11-14 05:36:52,727 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 05:36:52,818 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 05:36:52,821 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-14 05:36:52,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:36:52 BoogieIcfgContainer [2024-11-14 05:36:52,821 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 05:36:52,825 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 05:36:52,827 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 05:36:52,833 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 05:36:52,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:36:51" (1/3) ... [2024-11-14 05:36:52,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@182e80f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:36:52, skipping insertion in model container [2024-11-14 05:36:52,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:36:51" (2/3) ... [2024-11-14 05:36:52,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@182e80f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:36:52, skipping insertion in model container [2024-11-14 05:36:52,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:36:52" (3/3) ... [2024-11-14 05:36:52,837 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all_reverse.i [2024-11-14 05:36:52,856 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 05:36:52,858 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_remove_all_reverse.i that has 2 procedures, 89 locations, 1 initial locations, 2 loop locations, and 44 error locations. [2024-11-14 05:36:52,916 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 05:36:52,933 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=None, 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;@105a7f0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 05:36:52,934 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2024-11-14 05:36:52,939 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 41 states have (on average 2.2439024390243905) internal successors, (92), 85 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:36:52,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-14 05:36:52,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:36:52,947 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-14 05:36:52,948 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:36:52,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:36:52,953 INFO L85 PathProgramCache]: Analyzing trace with hash 178127531, now seen corresponding path program 1 times [2024-11-14 05:36:52,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:36:52,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332880167] [2024-11-14 05:36:52,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:36:52,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:36:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:36:53,221 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-14 05:36:53,221 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:36:53,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332880167] [2024-11-14 05:36:53,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332880167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:36:53,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:36:53,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:36:53,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241517711] [2024-11-14 05:36:53,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:36:53,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:36:53,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:36:53,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:36:53,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:36:53,271 INFO L87 Difference]: Start difference. First operand has 89 states, 41 states have (on average 2.2439024390243905) internal successors, (92), 85 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:36:53,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:36:53,511 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2024-11-14 05:36:53,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:36:53,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-14 05:36:53,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:36:53,524 INFO L225 Difference]: With dead ends: 85 [2024-11-14 05:36:53,525 INFO L226 Difference]: Without dead ends: 83 [2024-11-14 05:36:53,527 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-14 05:36:53,533 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 2 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:36:53,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 112 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:36:53,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-14 05:36:53,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-14 05:36:53,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 39 states have (on average 2.128205128205128) internal successors, (83), 79 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:36:53,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2024-11-14 05:36:53,591 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 5 [2024-11-14 05:36:53,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:36:53,592 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2024-11-14 05:36:53,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:36:53,592 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2024-11-14 05:36:53,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-14 05:36:53,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:36:53,593 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-14 05:36:53,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 05:36:53,593 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:36:53,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:36:53,596 INFO L85 PathProgramCache]: Analyzing trace with hash 178127532, now seen corresponding path program 1 times [2024-11-14 05:36:53,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:36:53,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222923498] [2024-11-14 05:36:53,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:36:53,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:36:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:36:53,801 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-14 05:36:53,801 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:36:53,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222923498] [2024-11-14 05:36:53,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222923498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:36:53,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:36:53,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:36:53,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591132465] [2024-11-14 05:36:53,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:36:53,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:36:53,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:36:53,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:36:53,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:36:53,804 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:36:53,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:36:53,927 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2024-11-14 05:36:53,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:36:53,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-14 05:36:53,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:36:53,928 INFO L225 Difference]: With dead ends: 80 [2024-11-14 05:36:53,930 INFO L226 Difference]: Without dead ends: 80 [2024-11-14 05:36:53,930 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-14 05:36:53,931 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 2 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:36:53,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 116 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:36:53,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-14 05:36:53,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-14 05:36:53,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 39 states have (on average 2.051282051282051) internal successors, (80), 76 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:36:53,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2024-11-14 05:36:53,943 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 5 [2024-11-14 05:36:53,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:36:53,943 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2024-11-14 05:36:53,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:36:53,943 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2024-11-14 05:36:53,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-14 05:36:53,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:36:53,944 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:36:53,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 05:36:53,945 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:36:53,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:36:53,945 INFO L85 PathProgramCache]: Analyzing trace with hash -32189777, now seen corresponding path program 1 times [2024-11-14 05:36:53,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:36:53,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279722633] [2024-11-14 05:36:53,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:36:53,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:36:53,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:36:54,078 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-14 05:36:54,078 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:36:54,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279722633] [2024-11-14 05:36:54,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279722633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:36:54,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:36:54,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:36:54,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976955710] [2024-11-14 05:36:54,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:36:54,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:36:54,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:36:54,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:36:54,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:36:54,083 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:36:54,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:36:54,141 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2024-11-14 05:36:54,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:36:54,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-14 05:36:54,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:36:54,143 INFO L225 Difference]: With dead ends: 81 [2024-11-14 05:36:54,143 INFO L226 Difference]: Without dead ends: 81 [2024-11-14 05:36:54,143 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-14 05:36:54,144 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 10 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:36:54,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 132 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:36:54,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-14 05:36:54,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-14 05:36:54,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 40 states have (on average 2.025) internal successors, (81), 77 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:36:54,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2024-11-14 05:36:54,151 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 11 [2024-11-14 05:36:54,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:36:54,153 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2024-11-14 05:36:54,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:36:54,153 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2024-11-14 05:36:54,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 05:36:54,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:36:54,154 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:36:54,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 05:36:54,154 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:36:54,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:36:54,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1161986470, now seen corresponding path program 1 times [2024-11-14 05:36:54,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:36:54,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115674096] [2024-11-14 05:36:54,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:36:54,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:36:54,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:36:54,508 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:36:54,508 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:36:54,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115674096] [2024-11-14 05:36:54,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115674096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:36:54,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:36:54,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:36:54,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789944828] [2024-11-14 05:36:54,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:36:54,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:36:54,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:36:54,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:36:54,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:36:54,510 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:36:54,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:36:54,799 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2024-11-14 05:36:54,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:36:54,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-11-14 05:36:54,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:36:54,801 INFO L225 Difference]: With dead ends: 80 [2024-11-14 05:36:54,802 INFO L226 Difference]: Without dead ends: 80 [2024-11-14 05:36:54,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:36:54,804 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 7 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:36:54,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 197 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:36:54,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-14 05:36:54,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-14 05:36:54,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 40 states have (on average 2.0) internal successors, (80), 76 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:36:54,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2024-11-14 05:36:54,818 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 19 [2024-11-14 05:36:54,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:36:54,819 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2024-11-14 05:36:54,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:36:54,819 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2024-11-14 05:36:54,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 05:36:54,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:36:54,820 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:36:54,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 05:36:54,821 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:36:54,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:36:54,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1161986469, now seen corresponding path program 1 times [2024-11-14 05:36:54,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:36:54,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532176401] [2024-11-14 05:36:54,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:36:54,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:36:54,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:36:55,218 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:36:55,219 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:36:55,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532176401] [2024-11-14 05:36:55,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532176401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:36:55,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:36:55,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:36:55,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692392897] [2024-11-14 05:36:55,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:36:55,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:36:55,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:36:55,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:36:55,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:36:55,221 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:36:55,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:36:55,455 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2024-11-14 05:36:55,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:36:55,456 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-11-14 05:36:55,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:36:55,457 INFO L225 Difference]: With dead ends: 79 [2024-11-14 05:36:55,460 INFO L226 Difference]: Without dead ends: 79 [2024-11-14 05:36:55,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:36:55,461 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 6 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:36:55,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 244 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:36:55,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-14 05:36:55,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-14 05:36:55,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 40 states have (on average 1.975) internal successors, (79), 75 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:36:55,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2024-11-14 05:36:55,474 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 19 [2024-11-14 05:36:55,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:36:55,474 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2024-11-14 05:36:55,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:36:55,474 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2024-11-14 05:36:55,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 05:36:55,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:36:55,475 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:36:55,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 05:36:55,475 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:36:55,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:36:55,476 INFO L85 PathProgramCache]: Analyzing trace with hash 22498971, now seen corresponding path program 1 times [2024-11-14 05:36:55,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:36:55,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267222066] [2024-11-14 05:36:55,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:36:55,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:36:55,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:36:55,882 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:36:55,883 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:36:55,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267222066] [2024-11-14 05:36:55,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267222066] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:36:55,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583279937] [2024-11-14 05:36:55,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:36:55,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:36:55,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:36:55,891 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:36:55,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 05:36:56,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:36:56,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-14 05:36:56,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:36:56,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:36:56,247 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 05:36:56,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-14 05:36:56,329 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:36:56,330 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:36:56,819 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:36:56,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583279937] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:36:56,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1300767129] [2024-11-14 05:36:56,845 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2024-11-14 05:36:56,845 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:36:56,850 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:36:56,856 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:36:56,856 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:36:58,489 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-14 05:36:59,411 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:37:14,691 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1059#(and (not (= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (exists ((|v_#memory_$Pointer$.offset_80| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_80| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_80| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 0)))) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (exists ((|v_#memory_$Pointer$.base_80| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_80| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_80| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) |#memory_$Pointer$.base|)) (<= 4 (select |#length| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) 1)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (exists ((|v_#memory_int_70| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_70| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_int_70| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))))) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-14 05:37:14,692 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:37:14,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:37:14,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 17 [2024-11-14 05:37:14,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241540155] [2024-11-14 05:37:14,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:37:14,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-14 05:37:14,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:37:14,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-14 05:37:14,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=800, Unknown=2, NotChecked=0, Total=930 [2024-11-14 05:37:14,694 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 18 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-14 05:37:16,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:37:16,025 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2024-11-14 05:37:16,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:37:16,026 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 21 [2024-11-14 05:37:16,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:37:16,028 INFO L225 Difference]: With dead ends: 84 [2024-11-14 05:37:16,028 INFO L226 Difference]: Without dead ends: 84 [2024-11-14 05:37:16,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=137, Invalid=853, Unknown=2, NotChecked=0, Total=992 [2024-11-14 05:37:16,032 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 2 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:37:16,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 385 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-14 05:37:16,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-14 05:37:16,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-14 05:37:16,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 79 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:37:16,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2024-11-14 05:37:16,046 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 21 [2024-11-14 05:37:16,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:37:16,046 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2024-11-14 05:37:16,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-14 05:37:16,047 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2024-11-14 05:37:16,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 05:37:16,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:37:16,047 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:37:16,073 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 05:37:16,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-14 05:37:16,248 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:37:16,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:37:16,249 INFO L85 PathProgramCache]: Analyzing trace with hash 22498972, now seen corresponding path program 1 times [2024-11-14 05:37:16,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:37:16,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115115521] [2024-11-14 05:37:16,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:37:16,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:37:16,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:37:17,156 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:37:17,156 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:37:17,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115115521] [2024-11-14 05:37:17,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115115521] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:37:17,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066837213] [2024-11-14 05:37:17,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:37:17,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:37:17,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:37:17,161 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:37:17,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 05:37:17,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:37:17,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-14 05:37:17,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:37:17,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:37:17,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:37:17,652 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:37:17,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 05:37:17,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 05:37:17,746 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:37:17,746 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:37:18,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066837213] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:37:18,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [183061504] [2024-11-14 05:37:18,027 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2024-11-14 05:37:18,027 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:37:18,027 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:37:18,028 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:37:18,028 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:37:18,798 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-14 05:37:19,491 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:37:36,917 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1332#(and (exists ((|v_#memory_$Pointer$.base_94| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_94| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_94| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) |#memory_$Pointer$.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (<= 1 |#StackHeapBarrier|) (exists ((|v_#memory_int_84| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_84| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_int_84| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))))) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (exists ((|v_#memory_$Pointer$.offset_94| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_94| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_94| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 0)))) (<= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) 7) (<= 4 (select |#length| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-14 05:37:36,917 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:37:36,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:37:36,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2024-11-14 05:37:36,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161554192] [2024-11-14 05:37:36,917 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:37:36,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-14 05:37:36,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:37:36,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-14 05:37:36,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=666, Unknown=2, NotChecked=0, Total=756 [2024-11-14 05:37:36,919 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand has 13 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 05:37:38,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:37:38,152 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2024-11-14 05:37:38,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 05:37:38,153 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2024-11-14 05:37:38,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:37:38,154 INFO L225 Difference]: With dead ends: 84 [2024-11-14 05:37:38,154 INFO L226 Difference]: Without dead ends: 84 [2024-11-14 05:37:38,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=103, Invalid=765, Unknown=2, NotChecked=0, Total=870 [2024-11-14 05:37:38,156 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:37:38,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 305 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-14 05:37:38,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-14 05:37:38,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-14 05:37:38,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 44 states have (on average 1.9090909090909092) internal successors, (84), 79 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:37:38,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2024-11-14 05:37:38,163 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 21 [2024-11-14 05:37:38,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:37:38,164 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2024-11-14 05:37:38,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 05:37:38,164 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2024-11-14 05:37:38,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-14 05:37:38,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:37:38,165 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:37:38,192 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 05:37:38,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-14 05:37:38,366 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:37:38,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:37:38,367 INFO L85 PathProgramCache]: Analyzing trace with hash 146833465, now seen corresponding path program 1 times [2024-11-14 05:37:38,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:37:38,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891780663] [2024-11-14 05:37:38,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:37:38,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:37:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:37:38,566 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:37:38,567 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:37:38,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891780663] [2024-11-14 05:37:38,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891780663] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:37:38,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860467060] [2024-11-14 05:37:38,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:37:38,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:37:38,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:37:38,571 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:37:38,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 05:37:38,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:37:38,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-14 05:37:38,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:37:38,792 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:37:38,793 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:37:38,888 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:37:38,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860467060] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:37:38,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [798762039] [2024-11-14 05:37:38,891 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-14 05:37:38,891 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:37:38,893 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:37:38,893 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:37:38,893 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:37:39,612 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 59 for LOIs [2024-11-14 05:37:39,770 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:37:56,553 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1655#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_20| Int)) (not (= (select |#valid| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_20|) 1))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-14 05:37:56,553 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:37:56,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:37:56,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2024-11-14 05:37:56,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796146399] [2024-11-14 05:37:56,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:37:56,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:37:56,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:37:56,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:37:56,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=355, Unknown=7, NotChecked=0, Total=420 [2024-11-14 05:37:56,555 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:37:56,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:37:56,723 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2024-11-14 05:37:56,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:37:56,723 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-11-14 05:37:56,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:37:56,724 INFO L225 Difference]: With dead ends: 84 [2024-11-14 05:37:56,724 INFO L226 Difference]: Without dead ends: 84 [2024-11-14 05:37:56,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=58, Invalid=355, Unknown=7, NotChecked=0, Total=420 [2024-11-14 05:37:56,726 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 1 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:37:56,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 316 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:37:56,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-14 05:37:56,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-14 05:37:56,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 79 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:37:56,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2024-11-14 05:37:56,735 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 23 [2024-11-14 05:37:56,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:37:56,735 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2024-11-14 05:37:56,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:37:56,736 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2024-11-14 05:37:56,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-14 05:37:56,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:37:56,736 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:37:56,755 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-14 05:37:56,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-14 05:37:56,937 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:37:56,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:37:56,937 INFO L85 PathProgramCache]: Analyzing trace with hash 251948095, now seen corresponding path program 1 times [2024-11-14 05:37:56,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:37:56,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267100313] [2024-11-14 05:37:56,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:37:56,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:37:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:37:57,069 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:37:57,069 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:37:57,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267100313] [2024-11-14 05:37:57,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267100313] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:37:57,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864061001] [2024-11-14 05:37:57,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:37:57,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:37:57,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:37:57,073 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:37:57,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 05:37:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:37:57,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-14 05:37:57,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:37:57,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:37:57,397 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-14 05:37:57,496 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-14 05:37:57,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-14 05:37:57,532 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2024-11-14 05:37:57,532 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:37:57,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864061001] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:37:57,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [440113297] [2024-11-14 05:37:57,701 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-14 05:37:57,701 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:37:57,701 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:37:57,701 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:37:57,701 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:37:58,453 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-14 05:37:58,862 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:38:21,768 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1942#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_21| Int)) (not (= (select |#valid| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_21|) 1))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-14 05:38:21,768 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:38:21,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:38:21,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 9 [2024-11-14 05:38:21,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232074993] [2024-11-14 05:38:21,769 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:38:21,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 05:38:21,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:38:21,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 05:38:21,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=570, Unknown=6, NotChecked=48, Total=702 [2024-11-14 05:38:21,772 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 10 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:38:22,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:38:22,700 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2024-11-14 05:38:22,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 05:38:22,701 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2024-11-14 05:38:22,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:38:22,702 INFO L225 Difference]: With dead ends: 83 [2024-11-14 05:38:22,702 INFO L226 Difference]: Without dead ends: 83 [2024-11-14 05:38:22,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 23.3s TimeCoverageRelationStatistics Valid=95, Invalid=715, Unknown=6, NotChecked=54, Total=870 [2024-11-14 05:38:22,705 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 9 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:38:22,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 293 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 330 Invalid, 0 Unknown, 83 Unchecked, 0.7s Time] [2024-11-14 05:38:22,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-14 05:38:22,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-14 05:38:22,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 44 states have (on average 1.8636363636363635) internal successors, (82), 78 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:38:22,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2024-11-14 05:38:22,712 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 24 [2024-11-14 05:38:22,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:38:22,712 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2024-11-14 05:38:22,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:38:22,713 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2024-11-14 05:38:22,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-14 05:38:22,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:38:22,713 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:38:22,742 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-14 05:38:22,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:38:22,914 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:38:22,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:38:22,915 INFO L85 PathProgramCache]: Analyzing trace with hash 251948096, now seen corresponding path program 1 times [2024-11-14 05:38:22,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:38:22,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31433724] [2024-11-14 05:38:22,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:38:22,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:38:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:38:23,369 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:38:23,369 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:38:23,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31433724] [2024-11-14 05:38:23,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31433724] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:38:23,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980922905] [2024-11-14 05:38:23,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:38:23,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:38:23,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:38:23,372 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:38:23,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 05:38:23,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:38:23,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-14 05:38:23,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:38:23,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:38:23,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:38:23,949 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-14 05:38:24,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:38:24,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 05:38:24,035 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:38:24,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 05:38:24,134 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-14 05:38:24,134 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:38:24,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980922905] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:38:24,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [482991519] [2024-11-14 05:38:24,485 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-14 05:38:24,486 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:38:24,486 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:38:24,486 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:38:24,486 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:38:25,346 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-14 05:38:25,749 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:38:42,637 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2240#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_22| Int)) (<= (select |#length| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_22|) 3)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-14 05:38:42,637 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:38:42,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:38:42,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2024-11-14 05:38:42,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286906677] [2024-11-14 05:38:42,638 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:38:42,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-14 05:38:42,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:38:42,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-14 05:38:42,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=887, Unknown=3, NotChecked=60, Total=1056 [2024-11-14 05:38:42,639 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 15 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:38:43,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:38:43,809 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2024-11-14 05:38:43,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 05:38:43,810 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2024-11-14 05:38:43,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:38:43,812 INFO L225 Difference]: With dead ends: 100 [2024-11-14 05:38:43,812 INFO L226 Difference]: Without dead ends: 100 [2024-11-14 05:38:43,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=137, Invalid=1124, Unknown=3, NotChecked=68, Total=1332 [2024-11-14 05:38:43,815 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 16 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-14 05:38:43,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 433 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 441 Invalid, 0 Unknown, 105 Unchecked, 0.9s Time] [2024-11-14 05:38:43,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-14 05:38:43,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2024-11-14 05:38:43,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 53 states have (on average 1.8113207547169812) internal successors, (96), 87 states have internal predecessors, (96), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 05:38:43,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2024-11-14 05:38:43,827 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 104 transitions. Word has length 24 [2024-11-14 05:38:43,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:38:43,827 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 104 transitions. [2024-11-14 05:38:43,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:38:43,827 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 104 transitions. [2024-11-14 05:38:43,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-14 05:38:43,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:38:43,832 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:38:43,859 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-14 05:38:44,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:38:44,033 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:38:44,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:38:44,034 INFO L85 PathProgramCache]: Analyzing trace with hash -779543643, now seen corresponding path program 1 times [2024-11-14 05:38:44,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:38:44,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221786295] [2024-11-14 05:38:44,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:38:44,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:38:44,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:38:44,260 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:38:44,260 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:38:44,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221786295] [2024-11-14 05:38:44,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221786295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:38:44,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:38:44,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 05:38:44,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868388987] [2024-11-14 05:38:44,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:38:44,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:38:44,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:38:44,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:38:44,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:38:44,266 INFO L87 Difference]: Start difference. First operand 93 states and 104 transitions. Second operand has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:38:44,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:38:44,766 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2024-11-14 05:38:44,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:38:44,766 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-11-14 05:38:44,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:38:44,768 INFO L225 Difference]: With dead ends: 92 [2024-11-14 05:38:44,768 INFO L226 Difference]: Without dead ends: 92 [2024-11-14 05:38:44,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:38:44,768 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 6 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:38:44,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 224 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 05:38:44,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-14 05:38:44,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-14 05:38:44,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 53 states have (on average 1.7924528301886793) internal successors, (95), 86 states have internal predecessors, (95), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 05:38:44,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2024-11-14 05:38:44,775 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 25 [2024-11-14 05:38:44,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:38:44,775 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2024-11-14 05:38:44,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:38:44,775 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2024-11-14 05:38:44,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-14 05:38:44,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:38:44,776 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:38:44,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 05:38:44,777 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:38:44,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:38:44,777 INFO L85 PathProgramCache]: Analyzing trace with hash -779543642, now seen corresponding path program 1 times [2024-11-14 05:38:44,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:38:44,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904076417] [2024-11-14 05:38:44,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:38:44,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:38:44,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:38:45,181 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:38:45,181 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:38:45,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904076417] [2024-11-14 05:38:45,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904076417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:38:45,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:38:45,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 05:38:45,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55202445] [2024-11-14 05:38:45,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:38:45,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:38:45,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:38:45,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:38:45,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:38:45,183 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:38:45,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:38:45,671 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2024-11-14 05:38:45,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:38:45,672 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-11-14 05:38:45,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:38:45,673 INFO L225 Difference]: With dead ends: 91 [2024-11-14 05:38:45,673 INFO L226 Difference]: Without dead ends: 91 [2024-11-14 05:38:45,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:38:45,673 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 5 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:38:45,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 249 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 05:38:45,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-14 05:38:45,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-14 05:38:45,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 53 states have (on average 1.7735849056603774) internal successors, (94), 85 states have internal predecessors, (94), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 05:38:45,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2024-11-14 05:38:45,678 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 25 [2024-11-14 05:38:45,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:38:45,678 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2024-11-14 05:38:45,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:38:45,678 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2024-11-14 05:38:45,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-14 05:38:45,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:38:45,679 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:38:45,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-14 05:38:45,680 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:38:45,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:38:45,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1817010941, now seen corresponding path program 1 times [2024-11-14 05:38:45,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:38:45,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823968193] [2024-11-14 05:38:45,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:38:45,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:38:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:38:45,803 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 05:38:45,803 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:38:45,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823968193] [2024-11-14 05:38:45,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823968193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:38:45,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:38:45,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:38:45,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150254588] [2024-11-14 05:38:45,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:38:45,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:38:45,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:38:45,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:38:45,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:38:45,805 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:38:45,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:38:45,912 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2024-11-14 05:38:45,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:38:45,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2024-11-14 05:38:45,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:38:45,914 INFO L225 Difference]: With dead ends: 136 [2024-11-14 05:38:45,914 INFO L226 Difference]: Without dead ends: 136 [2024-11-14 05:38:45,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:38:45,915 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 96 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:38:45,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 145 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:38:45,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-14 05:38:45,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 92. [2024-11-14 05:38:45,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 54 states have (on average 1.7592592592592593) internal successors, (95), 86 states have internal predecessors, (95), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 05:38:45,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2024-11-14 05:38:45,925 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 27 [2024-11-14 05:38:45,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:38:45,925 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2024-11-14 05:38:45,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:38:45,925 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2024-11-14 05:38:45,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-14 05:38:45,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:38:45,929 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:38:45,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-14 05:38:45,929 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:38:45,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:38:45,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1817014593, now seen corresponding path program 1 times [2024-11-14 05:38:45,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:38:45,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868521519] [2024-11-14 05:38:45,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:38:45,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:38:45,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:38:46,567 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 05:38:46,568 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:38:46,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868521519] [2024-11-14 05:38:46,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868521519] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:38:46,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590357518] [2024-11-14 05:38:46,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:38:46,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:38:46,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:38:46,571 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:38:46,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 05:38:46,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:38:46,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-14 05:38:46,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:38:46,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:38:46,855 WARN L851 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_77| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_77| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) is different from false [2024-11-14 05:38:46,861 WARN L873 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_77| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_77| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) is different from true [2024-11-14 05:38:46,897 WARN L851 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_77| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_77| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) is different from false [2024-11-14 05:38:46,902 WARN L873 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_77| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_77| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) is different from true [2024-11-14 05:38:47,111 WARN L851 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_79| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_79| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_77| |v_#valid_BEFORE_CALL_79|))) (and (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_79| (store |v_#valid_BEFORE_CALL_77| .cse0 (select |v_#valid_BEFORE_CALL_79| .cse0))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0)))) (= .cse1 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_79| .cse1 (select |c_#valid| .cse1)))))) (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_77| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_77| .cse2 (select |c_#valid| .cse2))) (= .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_79| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_79| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_79| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse3 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_79| .cse3 (select |c_#valid| .cse3))))))) is different from false [2024-11-14 05:38:47,120 WARN L873 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_79| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_79| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_77| |v_#valid_BEFORE_CALL_79|))) (and (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_79| (store |v_#valid_BEFORE_CALL_77| .cse0 (select |v_#valid_BEFORE_CALL_79| .cse0))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0)))) (= .cse1 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_79| .cse1 (select |c_#valid| .cse1)))))) (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_77| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_77| .cse2 (select |c_#valid| .cse2))) (= .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_79| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_79| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_79| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse3 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_79| .cse3 (select |c_#valid| .cse3))))))) is different from true [2024-11-14 05:38:47,219 WARN L851 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_77| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_77| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_79| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_79| |c_#valid|))) (and (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse1) (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_77| |v_#valid_BEFORE_CALL_79|))) (and (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_79| (store |v_#valid_BEFORE_CALL_77| .cse2 (select |v_#valid_BEFORE_CALL_79| .cse2))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_79| .cse1 (select |c_#valid| .cse1)))))) (exists ((|v_#valid_BEFORE_CALL_79| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_79| |c_#valid|))) (and (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse3) (= (select |v_#valid_BEFORE_CALL_79| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_79| .cse3 (select |c_#valid| .cse3))))))) is different from false [2024-11-14 05:38:47,226 WARN L873 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_77| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_77| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_79| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_79| |c_#valid|))) (and (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse1) (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_77| |v_#valid_BEFORE_CALL_79|))) (and (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_79| (store |v_#valid_BEFORE_CALL_77| .cse2 (select |v_#valid_BEFORE_CALL_79| .cse2))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_79| .cse1 (select |c_#valid| .cse1)))))) (exists ((|v_#valid_BEFORE_CALL_79| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_79| |c_#valid|))) (and (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse3) (= (select |v_#valid_BEFORE_CALL_79| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_79| .cse3 (select |c_#valid| .cse3))))))) is different from true [2024-11-14 05:38:47,321 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)))) (or (and (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_77| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_77| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) .cse1) (exists ((|v_#valid_BEFORE_CALL_79| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_79| (@diff |v_#valid_BEFORE_CALL_79| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_79| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) .cse1) (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int)) (|v_#valid_BEFORE_CALL_79| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_77| |v_#valid_BEFORE_CALL_79|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_79| (@diff |v_#valid_BEFORE_CALL_79| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_79| (store |v_#valid_BEFORE_CALL_77| .cse2 (select |v_#valid_BEFORE_CALL_79| .cse2))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2)))))) is different from false [2024-11-14 05:38:47,328 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)))) (or (and (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_77| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_77| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) .cse1) (exists ((|v_#valid_BEFORE_CALL_79| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_79| (@diff |v_#valid_BEFORE_CALL_79| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_79| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) .cse1) (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int)) (|v_#valid_BEFORE_CALL_79| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_77| |v_#valid_BEFORE_CALL_79|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_79| (@diff |v_#valid_BEFORE_CALL_79| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_79| (store |v_#valid_BEFORE_CALL_77| .cse2 (select |v_#valid_BEFORE_CALL_79| .cse2))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2)))))) is different from true [2024-11-14 05:38:47,741 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (.cse2 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)))) (or (and .cse0 (exists ((|v_#valid_BEFORE_CALL_79| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_79| (@diff |v_#valid_BEFORE_CALL_79| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_79| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int)) (|v_#valid_BEFORE_CALL_79| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_77| |v_#valid_BEFORE_CALL_79|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_79| (@diff |v_#valid_BEFORE_CALL_79| |c_#valid|) 1)) (= (select |c_#valid| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_79| (store |v_#valid_BEFORE_CALL_77| .cse1 (select |v_#valid_BEFORE_CALL_79| .cse1)))))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) .cse0 .cse2) (and (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_77| (@diff |v_#valid_BEFORE_CALL_77| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) .cse2))) is different from false [2024-11-14 05:38:47,749 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (.cse2 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)))) (or (and .cse0 (exists ((|v_#valid_BEFORE_CALL_79| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_79| (@diff |v_#valid_BEFORE_CALL_79| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_79| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int)) (|v_#valid_BEFORE_CALL_79| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_77| |v_#valid_BEFORE_CALL_79|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_79| (@diff |v_#valid_BEFORE_CALL_79| |c_#valid|) 1)) (= (select |c_#valid| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_79| (store |v_#valid_BEFORE_CALL_77| .cse1 (select |v_#valid_BEFORE_CALL_79| .cse1)))))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) .cse0 .cse2) (and (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_77| (@diff |v_#valid_BEFORE_CALL_77| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) .cse2))) is different from true [2024-11-14 05:38:47,931 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1))) (.cse0 (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)))) (or (and .cse0 (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) .cse1) (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int)) (|v_#valid_BEFORE_CALL_79| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_77| |v_#valid_BEFORE_CALL_79|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_79| (@diff |v_#valid_BEFORE_CALL_79| |c_#valid|) 1)) (= (select |c_#valid| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (= |v_#valid_BEFORE_CALL_79| (store |v_#valid_BEFORE_CALL_77| .cse2 (select |v_#valid_BEFORE_CALL_79| .cse2)))))) (and (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_77| (@diff |v_#valid_BEFORE_CALL_77| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1))) .cse1) (and .cse0 (exists ((|v_#valid_BEFORE_CALL_79| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_79| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_79| (@diff |v_#valid_BEFORE_CALL_79| |c_#valid|) 1))))))) is different from false [2024-11-14 05:38:47,938 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1))) (.cse0 (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)))) (or (and .cse0 (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) .cse1) (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int)) (|v_#valid_BEFORE_CALL_79| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_77| |v_#valid_BEFORE_CALL_79|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_79| (@diff |v_#valid_BEFORE_CALL_79| |c_#valid|) 1)) (= (select |c_#valid| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (= |v_#valid_BEFORE_CALL_79| (store |v_#valid_BEFORE_CALL_77| .cse2 (select |v_#valid_BEFORE_CALL_79| .cse2)))))) (and (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_77| (@diff |v_#valid_BEFORE_CALL_77| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1))) .cse1) (and .cse0 (exists ((|v_#valid_BEFORE_CALL_79| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_79| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_79| (@diff |v_#valid_BEFORE_CALL_79| |c_#valid|) 1))))))) is different from true [2024-11-14 05:38:47,938 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 1 not checked. [2024-11-14 05:38:47,938 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:38:48,913 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:38:48,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590357518] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:38:48,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [364420810] [2024-11-14 05:38:48,915 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2024-11-14 05:38:48,915 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:38:48,916 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:38:48,916 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:38:48,916 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:38:49,621 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-14 05:38:50,009 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:39:07,845 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3251#(and (exists ((|v_#memory_$Pointer$.offset_187| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_187| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_187| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_187| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_187| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)))) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (exists ((|v_#memory_$Pointer$.base_187| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_187| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_187| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_187| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_187| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (exists ((|v_#memory_int_177| (Array Int (Array Int Int))) (|v_#memory_int_178| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_178| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_178| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (store |v_#memory_int_177| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_177| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_int_178| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0))) |v_#memory_int_178|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 1) (= |ULTIMATE.start_main_~len~0#1| 2) (not (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)) (= |ULTIMATE.start_dll_circular_remove_last_~head#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 05:39:07,845 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:39:07,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:39:07,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 12] total 24 [2024-11-14 05:39:07,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948859841] [2024-11-14 05:39:07,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:39:07,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-14 05:39:07,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:39:07,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-14 05:39:07,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1228, Unknown=16, NotChecked=546, Total=1980 [2024-11-14 05:39:07,848 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand has 26 states, 21 states have (on average 2.380952380952381) internal successors, (50), 19 states have internal predecessors, (50), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-14 05:39:08,070 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or .cse0 (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_77| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_77| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))))) is different from false [2024-11-14 05:39:08,074 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or .cse0 (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_77| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_77| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))))) is different from true [2024-11-14 05:39:08,080 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_77| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_77| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2024-11-14 05:39:08,086 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_77| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_77| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2024-11-14 05:39:08,127 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or .cse0 (exists ((|v_#valid_BEFORE_CALL_79| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_79| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_77| |v_#valid_BEFORE_CALL_79|))) (and (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_79| (store |v_#valid_BEFORE_CALL_77| .cse1 (select |v_#valid_BEFORE_CALL_79| .cse1))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1)))) (= .cse2 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_79| .cse2 (select |c_#valid| .cse2)))))) (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_77| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_77| .cse3 (select |c_#valid| .cse3))) (= .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_79| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_79| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_79| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse4 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_79| .cse4 (select |c_#valid| .cse4))))))))) is different from false [2024-11-14 05:39:08,134 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or .cse0 (exists ((|v_#valid_BEFORE_CALL_79| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_79| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_77| |v_#valid_BEFORE_CALL_79|))) (and (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_79| (store |v_#valid_BEFORE_CALL_77| .cse1 (select |v_#valid_BEFORE_CALL_79| .cse1))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1)))) (= .cse2 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_79| .cse2 (select |c_#valid| .cse2)))))) (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_77| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_77| .cse3 (select |c_#valid| .cse3))) (= .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_79| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_79| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_79| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse4 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_79| .cse4 (select |c_#valid| .cse4))))))))) is different from true [2024-11-14 05:39:08,169 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_77| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_77| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_79| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_79| |c_#valid|))) (and (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse2) (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_77| |v_#valid_BEFORE_CALL_79|))) (and (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_79| (store |v_#valid_BEFORE_CALL_77| .cse3 (select |v_#valid_BEFORE_CALL_79| .cse3))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse3)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_79| .cse2 (select |c_#valid| .cse2)))))) (exists ((|v_#valid_BEFORE_CALL_79| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_79| |c_#valid|))) (and (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse4) (= (select |v_#valid_BEFORE_CALL_79| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_79| .cse4 (select |c_#valid| .cse4))))))) (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2024-11-14 05:39:08,176 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_77| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_77| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_79| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_79| |c_#valid|))) (and (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse2) (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_77| |v_#valid_BEFORE_CALL_79|))) (and (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_79| (store |v_#valid_BEFORE_CALL_77| .cse3 (select |v_#valid_BEFORE_CALL_79| .cse3))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse3)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_79| .cse2 (select |c_#valid| .cse2)))))) (exists ((|v_#valid_BEFORE_CALL_79| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_79| |c_#valid|))) (and (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse4) (= (select |v_#valid_BEFORE_CALL_79| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_79| .cse4 (select |c_#valid| .cse4))))))) (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2024-11-14 05:39:08,200 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (let ((.cse2 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)))) (or (and (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_77| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_77| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) .cse2) (exists ((|v_#valid_BEFORE_CALL_79| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_79| (@diff |v_#valid_BEFORE_CALL_79| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_79| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 .cse2) (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int)) (|v_#valid_BEFORE_CALL_79| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_77| |v_#valid_BEFORE_CALL_79|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_79| (@diff |v_#valid_BEFORE_CALL_79| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_79| (store |v_#valid_BEFORE_CALL_77| .cse3 (select |v_#valid_BEFORE_CALL_79| .cse3))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse3)))))))) is different from false [2024-11-14 05:39:08,207 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (let ((.cse2 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)))) (or (and (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_77| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_77| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) .cse2) (exists ((|v_#valid_BEFORE_CALL_79| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_79| (@diff |v_#valid_BEFORE_CALL_79| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_79| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 .cse2) (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int)) (|v_#valid_BEFORE_CALL_79| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_77| |v_#valid_BEFORE_CALL_79|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_79| (@diff |v_#valid_BEFORE_CALL_79| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_79| (store |v_#valid_BEFORE_CALL_77| .cse3 (select |v_#valid_BEFORE_CALL_79| .cse3))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse3)))))))) is different from true [2024-11-14 05:39:08,241 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (let ((.cse1 (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (.cse3 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)))) (or (and .cse1 (exists ((|v_#valid_BEFORE_CALL_79| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_79| (@diff |v_#valid_BEFORE_CALL_79| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_79| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int)) (|v_#valid_BEFORE_CALL_79| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_77| |v_#valid_BEFORE_CALL_79|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_79| (@diff |v_#valid_BEFORE_CALL_79| |c_#valid|) 1)) (= (select |c_#valid| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_79| (store |v_#valid_BEFORE_CALL_77| .cse2 (select |v_#valid_BEFORE_CALL_79| .cse2)))))) (and .cse0 .cse1 .cse3) (and (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_77| (@diff |v_#valid_BEFORE_CALL_77| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) .cse3))))) is different from false [2024-11-14 05:39:08,247 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (let ((.cse1 (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (.cse3 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)))) (or (and .cse1 (exists ((|v_#valid_BEFORE_CALL_79| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_79| (@diff |v_#valid_BEFORE_CALL_79| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_79| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int)) (|v_#valid_BEFORE_CALL_79| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_77| |v_#valid_BEFORE_CALL_79|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_79| (@diff |v_#valid_BEFORE_CALL_79| |c_#valid|) 1)) (= (select |c_#valid| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_79| (store |v_#valid_BEFORE_CALL_77| .cse2 (select |v_#valid_BEFORE_CALL_79| .cse2)))))) (and .cse0 .cse1 .cse3) (and (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_77| (@diff |v_#valid_BEFORE_CALL_77| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) .cse3))))) is different from true [2024-11-14 05:39:08,299 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1))) (and (let ((.cse2 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1))) (.cse0 (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)))) (or (and .cse0 .cse1 .cse2) (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int)) (|v_#valid_BEFORE_CALL_79| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_77| |v_#valid_BEFORE_CALL_79|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_79| (@diff |v_#valid_BEFORE_CALL_79| |c_#valid|) 1)) (= (select |c_#valid| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (= |v_#valid_BEFORE_CALL_79| (store |v_#valid_BEFORE_CALL_77| .cse3 (select |v_#valid_BEFORE_CALL_79| .cse3)))))) (and (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_77| (@diff |v_#valid_BEFORE_CALL_77| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1))) .cse2) (and .cse0 (exists ((|v_#valid_BEFORE_CALL_79| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_79| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_79| (@diff |v_#valid_BEFORE_CALL_79| |c_#valid|) 1))))))) .cse1)) is different from false [2024-11-14 05:39:08,306 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1))) (and (let ((.cse2 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1))) (.cse0 (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)))) (or (and .cse0 .cse1 .cse2) (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int)) (|v_#valid_BEFORE_CALL_79| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_77| |v_#valid_BEFORE_CALL_79|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_79| (@diff |v_#valid_BEFORE_CALL_79| |c_#valid|) 1)) (= (select |c_#valid| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (= |v_#valid_BEFORE_CALL_79| (store |v_#valid_BEFORE_CALL_77| .cse3 (select |v_#valid_BEFORE_CALL_79| .cse3)))))) (and (exists ((|v_#valid_BEFORE_CALL_77| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_77| (@diff |v_#valid_BEFORE_CALL_77| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1))) .cse2) (and .cse0 (exists ((|v_#valid_BEFORE_CALL_79| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_79| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_79| (@diff |v_#valid_BEFORE_CALL_79| |c_#valid|) 1))))))) .cse1)) is different from true [2024-11-14 05:39:09,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:39:09,225 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2024-11-14 05:39:09,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-14 05:39:09,225 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 21 states have (on average 2.380952380952381) internal successors, (50), 19 states have internal predecessors, (50), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 27 [2024-11-14 05:39:09,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:39:09,226 INFO L225 Difference]: With dead ends: 123 [2024-11-14 05:39:09,226 INFO L226 Difference]: Without dead ends: 123 [2024-11-14 05:39:09,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 19.2s TimeCoverageRelationStatistics Valid=225, Invalid=1361, Unknown=30, NotChecked=1246, Total=2862 [2024-11-14 05:39:09,228 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 90 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 1564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1121 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:39:09,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 266 Invalid, 1564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 430 Invalid, 0 Unknown, 1121 Unchecked, 1.0s Time] [2024-11-14 05:39:09,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-14 05:39:09,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 97. [2024-11-14 05:39:09,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 61 states have (on average 1.721311475409836) internal successors, (105), 91 states have internal predecessors, (105), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 05:39:09,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 113 transitions. [2024-11-14 05:39:09,234 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 113 transitions. Word has length 27 [2024-11-14 05:39:09,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:39:09,235 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 113 transitions. [2024-11-14 05:39:09,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 21 states have (on average 2.380952380952381) internal successors, (50), 19 states have internal predecessors, (50), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-14 05:39:09,235 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 113 transitions. [2024-11-14 05:39:09,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-14 05:39:09,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:39:09,238 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:39:09,261 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-14 05:39:09,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:39:09,439 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:39:09,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:39:09,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1817014592, now seen corresponding path program 1 times [2024-11-14 05:39:09,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:39:09,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134870964] [2024-11-14 05:39:09,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:39:09,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:39:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:39:10,292 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:39:10,292 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:39:10,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134870964] [2024-11-14 05:39:10,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134870964] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:39:10,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954594063] [2024-11-14 05:39:10,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:39:10,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:39:10,293 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:39:10,296 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:39:10,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-14 05:39:10,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:39:10,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-14 05:39:10,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:39:10,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:39:10,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 05:39:10,648 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-11-14 05:39:10,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:39:10,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 05:39:10,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 05:39:10,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:39:10,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 05:39:11,004 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:39:11,004 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:39:11,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954594063] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:39:11,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [223409637] [2024-11-14 05:39:11,441 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2024-11-14 05:39:11,442 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:39:11,442 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:39:11,442 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:39:11,442 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:39:12,266 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-14 05:39:12,647 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:39:29,730 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3635#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (exists ((|v_#memory_$Pointer$.offset_209| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_209| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_209| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_209| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_209| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)))) (<= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 3) (exists ((|v_#memory_int_199| (Array Int (Array Int Int))) (|v_#memory_int_200| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_200| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_200| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (store |v_#memory_int_199| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_199| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_int_200| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0))) |v_#memory_int_200|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 1) (= |ULTIMATE.start_main_~len~0#1| 2) (exists ((|v_#memory_$Pointer$.base_209| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_209| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_209| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_209| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_209| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))))) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 05:39:29,730 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:39:29,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:39:29,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 11 [2024-11-14 05:39:29,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241537873] [2024-11-14 05:39:29,730 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:39:29,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-14 05:39:29,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:39:29,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-14 05:39:29,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1001, Unknown=3, NotChecked=64, Total=1190 [2024-11-14 05:39:29,733 INFO L87 Difference]: Start difference. First operand 97 states and 113 transitions. Second operand has 13 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:39:30,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:39:30,779 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2024-11-14 05:39:30,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 05:39:30,780 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 27 [2024-11-14 05:39:30,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:39:30,780 INFO L225 Difference]: With dead ends: 90 [2024-11-14 05:39:30,780 INFO L226 Difference]: Without dead ends: 90 [2024-11-14 05:39:30,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=159, Invalid=1248, Unknown=3, NotChecked=72, Total=1482 [2024-11-14 05:39:30,782 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 121 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:39:30,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 177 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 349 Invalid, 0 Unknown, 65 Unchecked, 0.7s Time] [2024-11-14 05:39:30,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-14 05:39:30,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-14 05:39:30,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 61 states have (on average 1.5573770491803278) internal successors, (95), 84 states have internal predecessors, (95), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 05:39:30,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2024-11-14 05:39:30,786 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 27 [2024-11-14 05:39:30,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:39:30,786 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2024-11-14 05:39:30,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:39:30,786 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2024-11-14 05:39:30,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:39:30,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:39:30,787 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:39:30,805 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-14 05:39:30,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:39:30,988 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:39:30,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:39:30,988 INFO L85 PathProgramCache]: Analyzing trace with hash -492877514, now seen corresponding path program 1 times [2024-11-14 05:39:30,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:39:30,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526378082] [2024-11-14 05:39:30,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:39:30,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:39:31,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:39:31,366 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:39:31,367 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:39:31,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526378082] [2024-11-14 05:39:31,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526378082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:39:31,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:39:31,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-14 05:39:31,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336734039] [2024-11-14 05:39:31,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:39:31,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 05:39:31,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:39:31,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 05:39:31,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-14 05:39:31,369 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:39:32,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:39:32,244 INFO L93 Difference]: Finished difference Result 110 states and 123 transitions. [2024-11-14 05:39:32,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 05:39:32,244 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2024-11-14 05:39:32,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:39:32,245 INFO L225 Difference]: With dead ends: 110 [2024-11-14 05:39:32,245 INFO L226 Difference]: Without dead ends: 110 [2024-11-14 05:39:32,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-14 05:39:32,246 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 48 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-14 05:39:32,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 234 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-14 05:39:32,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-14 05:39:32,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 91. [2024-11-14 05:39:32,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 62 states have (on average 1.5483870967741935) internal successors, (96), 85 states have internal predecessors, (96), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 05:39:32,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2024-11-14 05:39:32,251 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 28 [2024-11-14 05:39:32,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:39:32,251 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2024-11-14 05:39:32,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:39:32,253 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2024-11-14 05:39:32,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:39:32,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:39:32,253 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:39:32,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-14 05:39:32,254 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:39:32,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:39:32,254 INFO L85 PathProgramCache]: Analyzing trace with hash -492877513, now seen corresponding path program 1 times [2024-11-14 05:39:32,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:39:32,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125047459] [2024-11-14 05:39:32,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:39:32,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:39:32,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:39:32,742 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:39:32,742 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:39:32,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125047459] [2024-11-14 05:39:32,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125047459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:39:32,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:39:32,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-14 05:39:32,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381029997] [2024-11-14 05:39:32,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:39:32,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 05:39:32,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:39:32,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 05:39:32,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-14 05:39:32,744 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand has 10 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:39:33,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:39:33,471 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2024-11-14 05:39:33,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 05:39:33,471 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2024-11-14 05:39:33,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:39:33,472 INFO L225 Difference]: With dead ends: 116 [2024-11-14 05:39:33,472 INFO L226 Difference]: Without dead ends: 116 [2024-11-14 05:39:33,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-14 05:39:33,473 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 57 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:39:33,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 294 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 05:39:33,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-14 05:39:33,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 91. [2024-11-14 05:39:33,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 62 states have (on average 1.5161290322580645) internal successors, (94), 85 states have internal predecessors, (94), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 05:39:33,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2024-11-14 05:39:33,477 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 28 [2024-11-14 05:39:33,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:39:33,478 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2024-11-14 05:39:33,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:39:33,478 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2024-11-14 05:39:33,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-14 05:39:33,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:39:33,479 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:39:33,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-14 05:39:33,479 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:39:33,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:39:33,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1900669592, now seen corresponding path program 1 times [2024-11-14 05:39:33,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:39:33,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338295930] [2024-11-14 05:39:33,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:39:33,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:39:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:39:33,535 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 05:39:33,535 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:39:33,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338295930] [2024-11-14 05:39:33,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338295930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:39:33,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:39:33,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:39:33,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772586471] [2024-11-14 05:39:33,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:39:33,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:39:33,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:39:33,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:39:33,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:39:33,537 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:39:33,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:39:33,688 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2024-11-14 05:39:33,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:39:33,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2024-11-14 05:39:33,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:39:33,690 INFO L225 Difference]: With dead ends: 90 [2024-11-14 05:39:33,690 INFO L226 Difference]: Without dead ends: 90 [2024-11-14 05:39:33,690 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-14 05:39:33,690 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 22 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:39:33,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 65 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:39:33,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-14 05:39:33,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2024-11-14 05:39:33,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 56 states have (on average 1.5535714285714286) internal successors, (87), 78 states have internal predecessors, (87), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 05:39:33,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2024-11-14 05:39:33,694 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 29 [2024-11-14 05:39:33,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:39:33,694 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2024-11-14 05:39:33,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:39:33,695 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2024-11-14 05:39:33,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-14 05:39:33,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:39:33,695 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:39:33,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-14 05:39:33,695 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:39:33,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:39:33,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1182378521, now seen corresponding path program 1 times [2024-11-14 05:39:33,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:39:33,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974862334] [2024-11-14 05:39:33,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:39:33,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:39:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:39:34,393 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:39:34,393 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:39:34,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974862334] [2024-11-14 05:39:34,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974862334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:39:34,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:39:34,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-14 05:39:34,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467074737] [2024-11-14 05:39:34,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:39:34,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 05:39:34,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:39:34,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 05:39:34,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-14 05:39:34,395 INFO L87 Difference]: Start difference. First operand 84 states and 95 transitions. Second operand has 12 states, 10 states have (on average 2.7) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:39:35,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:39:35,398 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2024-11-14 05:39:35,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-14 05:39:35,398 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.7) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2024-11-14 05:39:35,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:39:35,400 INFO L225 Difference]: With dead ends: 99 [2024-11-14 05:39:35,400 INFO L226 Difference]: Without dead ends: 99 [2024-11-14 05:39:35,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2024-11-14 05:39:35,400 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 51 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-14 05:39:35,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 316 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-14 05:39:35,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-14 05:39:35,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 86. [2024-11-14 05:39:35,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 59 states have (on average 1.5423728813559323) internal successors, (91), 80 states have internal predecessors, (91), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 05:39:35,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2024-11-14 05:39:35,405 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 31 [2024-11-14 05:39:35,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:39:35,405 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2024-11-14 05:39:35,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.7) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:39:35,406 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2024-11-14 05:39:35,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-14 05:39:35,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:39:35,406 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:39:35,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-14 05:39:35,407 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:39:35,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:39:35,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1182378522, now seen corresponding path program 1 times [2024-11-14 05:39:35,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:39:35,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763135056] [2024-11-14 05:39:35,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:39:35,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:39:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:39:36,723 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:39:36,723 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:39:36,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763135056] [2024-11-14 05:39:36,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763135056] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:39:36,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694292223] [2024-11-14 05:39:36,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:39:36,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:39:36,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:39:36,727 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:39:36,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-14 05:39:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:39:37,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-11-14 05:39:37,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:39:37,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:39:37,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:39:37,954 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 05:39:37,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-14 05:39:37,994 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:39:37,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 05:39:38,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2024-11-14 05:39:38,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-14 05:39:38,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:39:38,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 23 [2024-11-14 05:39:38,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:39:38,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-11-14 05:39:38,936 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:39:38,936 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:39:39,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:39:39,519 INFO L349 Elim1Store]: treesize reduction 27, result has 57.1 percent of original size [2024-11-14 05:39:39,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 444 treesize of output 415 [2024-11-14 05:39:39,917 INFO L349 Elim1Store]: treesize reduction 37, result has 66.7 percent of original size [2024-11-14 05:39:39,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 820 treesize of output 747 [2024-11-14 05:39:40,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694292223] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:39:40,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1056649869] [2024-11-14 05:39:40,899 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2024-11-14 05:39:40,899 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:39:40,900 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:39:40,900 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:39:40,900 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:39:41,513 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-14 05:39:41,836 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:40:04,596 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4832#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 0)) 1) (exists ((|v_#memory_$Pointer$.offset_232| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_232| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_232| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_232| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_232| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)))) (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) (<= (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 0) 4))) (+ 7 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 0) 4)))) (= (select |#valid| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (exists ((|v_#memory_int_221| (Array Int (Array Int Int))) (|v_#memory_int_222| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_222| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_222| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (store |v_#memory_int_221| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_221| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_int_222| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0))) |v_#memory_int_222|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 1) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= 4 (select |#length| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|)) (exists ((|v_#memory_$Pointer$.base_232| (Array Int (Array Int Int)))) (= (store (store |v_#memory_$Pointer$.base_232| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_232| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_232| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_232| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |#memory_$Pointer$.base|)) (= |ULTIMATE.start_dll_circular_remove_last_~head#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 05:40:04,596 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:40:04,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:40:04,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 28 [2024-11-14 05:40:04,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374525245] [2024-11-14 05:40:04,596 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:40:04,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-14 05:40:04,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:40:04,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-14 05:40:04,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=3094, Unknown=2, NotChecked=0, Total=3306 [2024-11-14 05:40:04,599 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand has 29 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 05:40:08,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:40:08,207 INFO L93 Difference]: Finished difference Result 120 states and 135 transitions. [2024-11-14 05:40:08,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-14 05:40:08,207 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 31 [2024-11-14 05:40:08,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:40:08,208 INFO L225 Difference]: With dead ends: 120 [2024-11-14 05:40:08,208 INFO L226 Difference]: Without dead ends: 120 [2024-11-14 05:40:08,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1180 ImplicationChecksByTransitivity, 26.5s TimeCoverageRelationStatistics Valid=339, Invalid=4771, Unknown=2, NotChecked=0, Total=5112 [2024-11-14 05:40:08,209 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 177 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:40:08,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 506 Invalid, 1071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-14 05:40:08,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-14 05:40:08,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 94. [2024-11-14 05:40:08,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 67 states have (on average 1.492537313432836) internal successors, (100), 88 states have internal predecessors, (100), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 05:40:08,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 108 transitions. [2024-11-14 05:40:08,215 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 108 transitions. Word has length 31 [2024-11-14 05:40:08,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:40:08,215 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 108 transitions. [2024-11-14 05:40:08,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 05:40:08,215 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2024-11-14 05:40:08,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 05:40:08,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:40:08,216 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:40:08,234 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-14 05:40:08,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:40:08,417 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:40:08,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:40:08,417 INFO L85 PathProgramCache]: Analyzing trace with hash -2000985368, now seen corresponding path program 1 times [2024-11-14 05:40:08,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:40:08,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744550779] [2024-11-14 05:40:08,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:40:08,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:40:08,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:40:08,774 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:40:08,775 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:40:08,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744550779] [2024-11-14 05:40:08,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744550779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:40:08,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:40:08,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-14 05:40:08,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960238533] [2024-11-14 05:40:08,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:40:08,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 05:40:08,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:40:08,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 05:40:08,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-14 05:40:08,777 INFO L87 Difference]: Start difference. First operand 94 states and 108 transitions. Second operand has 10 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:40:09,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:40:09,571 INFO L93 Difference]: Finished difference Result 125 states and 142 transitions. [2024-11-14 05:40:09,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 05:40:09,572 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-11-14 05:40:09,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:40:09,573 INFO L225 Difference]: With dead ends: 125 [2024-11-14 05:40:09,573 INFO L226 Difference]: Without dead ends: 125 [2024-11-14 05:40:09,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-14 05:40:09,575 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 59 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:40:09,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 338 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 05:40:09,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-14 05:40:09,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 105. [2024-11-14 05:40:09,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 78 states have (on average 1.5256410256410255) internal successors, (119), 99 states have internal predecessors, (119), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 05:40:09,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 127 transitions. [2024-11-14 05:40:09,581 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 127 transitions. Word has length 32 [2024-11-14 05:40:09,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:40:09,582 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 127 transitions. [2024-11-14 05:40:09,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:40:09,582 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 127 transitions. [2024-11-14 05:40:09,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 05:40:09,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:40:09,583 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:40:09,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-14 05:40:09,583 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:40:09,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:40:09,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1900498201, now seen corresponding path program 1 times [2024-11-14 05:40:09,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:40:09,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533105095] [2024-11-14 05:40:09,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:40:09,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:40:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:40:10,827 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:40:10,827 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:40:10,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533105095] [2024-11-14 05:40:10,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533105095] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:40:10,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784577798] [2024-11-14 05:40:10,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:40:10,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:40:10,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:40:10,830 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:40:10,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-14 05:40:11,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:40:11,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-14 05:40:11,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:40:11,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2024-11-14 05:40:12,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:40:12,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2024-11-14 05:40:12,256 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:40:12,256 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:40:12,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:40:12,712 INFO L349 Elim1Store]: treesize reduction 17, result has 60.5 percent of original size [2024-11-14 05:40:12,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 150 [2024-11-14 05:40:12,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2024-11-14 05:40:13,024 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:40:13,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784577798] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:40:13,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1331901316] [2024-11-14 05:40:13,025 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2024-11-14 05:40:13,026 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:40:13,026 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:40:13,026 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:40:13,026 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:40:13,595 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-14 05:40:13,946 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:40:35,675 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5565#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_remove_last_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 0) 4))) 4)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 0)) 1) (= |ULTIMATE.start_main_~i~0#1| 0) (exists ((|v_#memory_int_253| (Array Int (Array Int Int))) (|v_#memory_int_252| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_252| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_252| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_int_253| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0))) |v_#memory_int_253|) (= |#memory_int| (store |v_#memory_int_253| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_253| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))))) (= (select |#valid| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 0) 4))) 4) |ULTIMATE.start_dll_circular_remove_last_~snd_to_last~0#1.offset|) (exists ((|v_#memory_$Pointer$.base_264| (Array Int (Array Int Int)))) (= (store (store |v_#memory_$Pointer$.base_264| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_264| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_264| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_264| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |#memory_$Pointer$.base|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (<= |#StackHeapBarrier| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 0) 4))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#memory_$Pointer$.offset_263| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_263| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_263| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_263| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_263| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 1) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= 4 (select |#length| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 0) 4)))) (= |ULTIMATE.start_dll_circular_remove_last_~head#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 0)) 4) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 0))))' at error location [2024-11-14 05:40:35,676 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:40:35,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:40:35,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 9] total 27 [2024-11-14 05:40:35,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156334326] [2024-11-14 05:40:35,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:40:35,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-14 05:40:35,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:40:35,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-14 05:40:35,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2549, Unknown=2, NotChecked=0, Total=2756 [2024-11-14 05:40:35,678 INFO L87 Difference]: Start difference. First operand 105 states and 127 transitions. Second operand has 28 states, 24 states have (on average 2.5) internal successors, (60), 24 states have internal predecessors, (60), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-14 05:40:38,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:40:38,081 INFO L93 Difference]: Finished difference Result 123 states and 144 transitions. [2024-11-14 05:40:38,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 05:40:38,082 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 2.5) internal successors, (60), 24 states have internal predecessors, (60), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 33 [2024-11-14 05:40:38,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:40:38,083 INFO L225 Difference]: With dead ends: 123 [2024-11-14 05:40:38,083 INFO L226 Difference]: Without dead ends: 123 [2024-11-14 05:40:38,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 50 SyntacticMatches, 11 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 994 ImplicationChecksByTransitivity, 24.0s TimeCoverageRelationStatistics Valid=274, Invalid=3384, Unknown=2, NotChecked=0, Total=3660 [2024-11-14 05:40:38,086 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 123 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-14 05:40:38,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 484 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-14 05:40:38,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-14 05:40:38,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 107. [2024-11-14 05:40:38,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 80 states have (on average 1.525) internal successors, (122), 101 states have internal predecessors, (122), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 05:40:38,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 130 transitions. [2024-11-14 05:40:38,092 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 130 transitions. Word has length 33 [2024-11-14 05:40:38,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:40:38,092 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 130 transitions. [2024-11-14 05:40:38,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 2.5) internal successors, (60), 24 states have internal predecessors, (60), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-14 05:40:38,092 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 130 transitions. [2024-11-14 05:40:38,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 05:40:38,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:40:38,093 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:40:38,120 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-14 05:40:38,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:40:38,294 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:40:38,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:40:38,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1901004167, now seen corresponding path program 1 times [2024-11-14 05:40:38,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:40:38,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942181358] [2024-11-14 05:40:38,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:40:38,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:40:38,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:40:38,776 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:40:38,776 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:40:38,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942181358] [2024-11-14 05:40:38,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942181358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:40:38,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:40:38,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-14 05:40:38,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865882167] [2024-11-14 05:40:38,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:40:38,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 05:40:38,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:40:38,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 05:40:38,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-14 05:40:38,779 INFO L87 Difference]: Start difference. First operand 107 states and 130 transitions. Second operand has 10 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:40:40,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:40:40,161 INFO L93 Difference]: Finished difference Result 122 states and 143 transitions. [2024-11-14 05:40:40,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 05:40:40,162 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2024-11-14 05:40:40,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:40:40,163 INFO L225 Difference]: With dead ends: 122 [2024-11-14 05:40:40,163 INFO L226 Difference]: Without dead ends: 122 [2024-11-14 05:40:40,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-14 05:40:40,164 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 46 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:40:40,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 287 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-14 05:40:40,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-14 05:40:40,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 110. [2024-11-14 05:40:40,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 83 states have (on average 1.5060240963855422) internal successors, (125), 104 states have internal predecessors, (125), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 05:40:40,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 133 transitions. [2024-11-14 05:40:40,169 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 133 transitions. Word has length 33 [2024-11-14 05:40:40,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:40:40,169 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 133 transitions. [2024-11-14 05:40:40,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:40:40,170 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 133 transitions. [2024-11-14 05:40:40,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:40:40,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:40:40,170 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:40:40,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-14 05:40:40,171 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:40:40,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:40:40,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1660957739, now seen corresponding path program 1 times [2024-11-14 05:40:40,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:40:40,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333508732] [2024-11-14 05:40:40,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:40:40,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:40:40,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:40:40,279 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-14 05:40:40,279 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:40:40,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333508732] [2024-11-14 05:40:40,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333508732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:40:40,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:40:40,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:40:40,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529665167] [2024-11-14 05:40:40,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:40:40,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:40:40,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:40:40,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:40:40,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:40:40,282 INFO L87 Difference]: Start difference. First operand 110 states and 133 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 05:40:40,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:40:40,406 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2024-11-14 05:40:40,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:40:40,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2024-11-14 05:40:40,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:40:40,408 INFO L225 Difference]: With dead ends: 84 [2024-11-14 05:40:40,408 INFO L226 Difference]: Without dead ends: 84 [2024-11-14 05:40:40,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:40:40,409 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:40:40,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:40:40,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-14 05:40:40,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-14 05:40:40,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 62 states have (on average 1.467741935483871) internal successors, (91), 80 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:40:40,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2024-11-14 05:40:40,413 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 34 [2024-11-14 05:40:40,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:40:40,413 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2024-11-14 05:40:40,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 05:40:40,414 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2024-11-14 05:40:40,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:40:40,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:40:40,414 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:40:40,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-14 05:40:40,414 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:40:40,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:40:40,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1198413066, now seen corresponding path program 1 times [2024-11-14 05:40:40,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:40:40,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754584293] [2024-11-14 05:40:40,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:40:40,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:40:40,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:40:40,565 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 05:40:40,566 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:40:40,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754584293] [2024-11-14 05:40:40,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754584293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:40:40,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:40:40,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:40:40,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178909115] [2024-11-14 05:40:40,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:40:40,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:40:40,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:40:40,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:40:40,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:40:40,568 INFO L87 Difference]: Start difference. First operand 84 states and 95 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:40:40,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:40:40,989 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2024-11-14 05:40:40,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:40:40,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2024-11-14 05:40:40,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:40:40,991 INFO L225 Difference]: With dead ends: 83 [2024-11-14 05:40:40,991 INFO L226 Difference]: Without dead ends: 83 [2024-11-14 05:40:40,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:40:40,992 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 14 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:40:40,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 108 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 05:40:40,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-14 05:40:40,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-14 05:40:40,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 62 states have (on average 1.435483870967742) internal successors, (89), 79 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:40:40,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2024-11-14 05:40:40,996 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 34 [2024-11-14 05:40:40,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:40:40,996 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2024-11-14 05:40:40,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:40:40,997 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2024-11-14 05:40:40,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-14 05:40:40,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:40:40,997 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:40:40,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-14 05:40:40,998 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:40:40,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:40:40,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1017666710, now seen corresponding path program 1 times [2024-11-14 05:40:40,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:40:40,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073749226] [2024-11-14 05:40:40,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:40:40,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:40:41,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:40:41,345 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 05:40:41,345 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:40:41,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073749226] [2024-11-14 05:40:41,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073749226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:40:41,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:40:41,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 05:40:41,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729207686] [2024-11-14 05:40:41,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:40:41,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 05:40:41,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:40:41,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 05:40:41,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:40:41,347 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:40:41,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:40:41,711 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2024-11-14 05:40:41,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:40:41,712 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2024-11-14 05:40:41,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:40:41,713 INFO L225 Difference]: With dead ends: 82 [2024-11-14 05:40:41,713 INFO L226 Difference]: Without dead ends: 82 [2024-11-14 05:40:41,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-14 05:40:41,714 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 101 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:40:41,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 79 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:40:41,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-14 05:40:41,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-14 05:40:41,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 78 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:40:41,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2024-11-14 05:40:41,718 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 35 [2024-11-14 05:40:41,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:40:41,718 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2024-11-14 05:40:41,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:40:41,719 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2024-11-14 05:40:41,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-14 05:40:41,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:40:41,719 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:40:41,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-14 05:40:41,720 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:40:41,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:40:41,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1503900516, now seen corresponding path program 1 times [2024-11-14 05:40:41,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:40:41,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099082472] [2024-11-14 05:40:41,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:40:41,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:40:41,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:40:42,410 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:40:42,410 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:40:42,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099082472] [2024-11-14 05:40:42,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099082472] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:40:42,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914181272] [2024-11-14 05:40:42,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:40:42,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:40:42,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:40:42,413 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:40:42,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-14 05:40:42,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:40:42,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 05:40:42,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:40:43,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:40:43,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 05:40:43,129 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 05:40:43,129 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:40:43,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914181272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:40:43,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:40:43,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 15 [2024-11-14 05:40:43,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094315916] [2024-11-14 05:40:43,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:40:43,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:40:43,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:40:43,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:40:43,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-11-14 05:40:43,131 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:40:43,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:40:43,634 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2024-11-14 05:40:43,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:40:43,635 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2024-11-14 05:40:43,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:40:43,636 INFO L225 Difference]: With dead ends: 81 [2024-11-14 05:40:43,636 INFO L226 Difference]: Without dead ends: 81 [2024-11-14 05:40:43,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2024-11-14 05:40:43,636 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 55 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:40:43,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 95 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 05:40:43,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-14 05:40:43,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-14 05:40:43,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 77 states have internal predecessors, (86), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:40:43,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2024-11-14 05:40:43,641 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 35 [2024-11-14 05:40:43,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:40:43,641 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2024-11-14 05:40:43,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:40:43,641 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2024-11-14 05:40:43,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-14 05:40:43,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:40:43,642 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:40:43,667 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-14 05:40:43,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-14 05:40:43,842 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:40:43,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:40:43,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1482896880, now seen corresponding path program 1 times [2024-11-14 05:40:43,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:40:43,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458899168] [2024-11-14 05:40:43,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:40:43,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:40:43,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:40:44,796 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:40:44,796 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:40:44,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458899168] [2024-11-14 05:40:44,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458899168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:40:44,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:40:44,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-14 05:40:44,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277112299] [2024-11-14 05:40:44,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:40:44,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-14 05:40:44,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:40:44,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-14 05:40:44,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-11-14 05:40:44,798 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 15 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:40:46,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:40:46,058 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2024-11-14 05:40:46,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 05:40:46,058 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2024-11-14 05:40:46,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:40:46,059 INFO L225 Difference]: With dead ends: 86 [2024-11-14 05:40:46,059 INFO L226 Difference]: Without dead ends: 86 [2024-11-14 05:40:46,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2024-11-14 05:40:46,060 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 34 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:40:46,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 211 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-14 05:40:46,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-14 05:40:46,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2024-11-14 05:40:46,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 80 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:40:46,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2024-11-14 05:40:46,065 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 36 [2024-11-14 05:40:46,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:40:46,065 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2024-11-14 05:40:46,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:40:46,066 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2024-11-14 05:40:46,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-14 05:40:46,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:40:46,066 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:40:46,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-14 05:40:46,067 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:40:46,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:40:46,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1482896879, now seen corresponding path program 1 times [2024-11-14 05:40:46,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:40:46,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380764974] [2024-11-14 05:40:46,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:40:46,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:40:46,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:40:46,813 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:40:46,813 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:40:46,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380764974] [2024-11-14 05:40:46,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380764974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:40:46,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:40:46,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-14 05:40:46,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146066880] [2024-11-14 05:40:46,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:40:46,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 05:40:46,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:40:46,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 05:40:46,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-14 05:40:46,815 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:40:47,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:40:47,580 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2024-11-14 05:40:47,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 05:40:47,581 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2024-11-14 05:40:47,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:40:47,582 INFO L225 Difference]: With dead ends: 86 [2024-11-14 05:40:47,582 INFO L226 Difference]: Without dead ends: 86 [2024-11-14 05:40:47,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-14 05:40:47,583 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 21 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:40:47,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 260 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 05:40:47,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-14 05:40:47,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2024-11-14 05:40:47,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 80 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:40:47,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2024-11-14 05:40:47,586 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 36 [2024-11-14 05:40:47,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:40:47,587 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2024-11-14 05:40:47,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:40:47,587 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2024-11-14 05:40:47,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-14 05:40:47,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:40:47,588 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:40:47,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-14 05:40:47,588 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:40:47,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:40:47,589 INFO L85 PathProgramCache]: Analyzing trace with hash 865306005, now seen corresponding path program 1 times [2024-11-14 05:40:47,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:40:47,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225516435] [2024-11-14 05:40:47,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:40:47,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:40:47,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:40:49,386 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:40:49,386 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:40:49,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225516435] [2024-11-14 05:40:49,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225516435] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:40:49,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031845675] [2024-11-14 05:40:49,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:40:49,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:40:49,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:40:49,388 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:40:49,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-14 05:40:49,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:40:49,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 99 conjuncts are in the unsatisfiable core [2024-11-14 05:40:49,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:40:50,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:40:50,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:40:50,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 05:40:51,064 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:40:51,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 05:40:51,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-14 05:40:51,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-14 05:40:52,360 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-14 05:40:52,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 41 [2024-11-14 05:40:52,605 INFO L349 Elim1Store]: treesize reduction 51, result has 19.0 percent of original size [2024-11-14 05:40:52,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 64 treesize of output 55 [2024-11-14 05:40:54,458 INFO L349 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2024-11-14 05:40:54,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 121 treesize of output 39 [2024-11-14 05:40:54,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:40:54,634 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:40:54,634 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:40:54,659 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-14 05:40:54,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2024-11-14 05:40:55,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 101 [2024-11-14 05:41:07,867 WARN L286 SmtUtils]: Spent 9.92s on a formula simplification. DAG size of input: 880 DAG size of output: 442 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-14 05:41:07,867 INFO L349 Elim1Store]: treesize reduction 2361, result has 31.6 percent of original size [2024-11-14 05:41:07,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 12 select indices, 12 select index equivalence classes, 3 disjoint index pairs (out of 66 index pairs), introduced 25 new quantified variables, introduced 114 case distinctions, treesize of input 37858908 treesize of output 7324736 [2024-11-14 05:41:32,700 WARN L286 SmtUtils]: Spent 24.82s on a formula simplification. DAG size of input: 2370 DAG size of output: 1174 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-14 05:41:47,445 INFO L224 Elim1Store]: Index analysis took 168 ms [2024-11-14 05:42:19,323 WARN L286 SmtUtils]: Spent 31.82s on a formula simplification. DAG size of input: 1810 DAG size of output: 439 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-14 05:42:19,324 INFO L349 Elim1Store]: treesize reduction 11047, result has 11.2 percent of original size [2024-11-14 05:42:19,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 18 select indices, 18 select index equivalence classes, 0 disjoint index pairs (out of 153 index pairs), introduced 26 new quantified variables, introduced 279 case distinctions, treesize of input 713375 treesize of output 695906 [2024-11-14 05:44:06,829 WARN L286 SmtUtils]: Spent 1.79m on a formula simplification. DAG size of input: 3231 DAG size of output: 2288 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-14 05:44:18,962 WARN L286 SmtUtils]: Spent 12.09s on a formula simplification that was a NOOP. DAG size: 2265 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-14 05:44:33,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-14 05:44:54,021 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 05:46:58,188 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-14 05:46:58,188 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2024-11-14 05:46:58,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [813709606] [2024-11-14 05:46:58,188 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2024-11-14 05:46:58,190 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2024-11-14 05:46:58,190 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:46:58,191 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:46:58,191 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:46:58,191 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:46:58,199 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:177) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:132) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.checkSatTerm(SmtUtils.java:326) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.isFalse(SymbolicTools.java:220) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.RelationCheckUtil.isEqBottom_SolverAlphaSolver(RelationCheckUtil.java:56) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.ExplicitValueDomain.isEqBottom(ExplicitValueDomain.java:73) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.CompoundDomain.isEqBottom(CompoundDomain.java:84) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.StatsWrapperDomain.isEqBottom(StatsWrapperDomain.java:69) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.earlyExitAfterStep(DagInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:125) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:447) at java.base/java.io.OutputStream.write(OutputStream.java:167) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:125) at java.base/java.io.BufferedOutputStream.implFlush(BufferedOutputStream.java:252) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:246) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:412) at java.base/sun.nio.cs.StreamEncoder.lockedFlush(StreamEncoder.java:214) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:201) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:262) at java.base/java.io.BufferedWriter.implFlush(BufferedWriter.java:372) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:359) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 44 more [2024-11-14 05:46:58,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:46:58,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2024-11-14 05:46:58,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844854037] [2024-11-14 05:46:58,204 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-14 05:46:58,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-14 05:46:58,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:46:58,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-14 05:46:58,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=3031, Unknown=0, NotChecked=0, Total=3306 [2024-11-14 05:46:58,208 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 19 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:46:58,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 847 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=275, Invalid=3031, Unknown=0, NotChecked=0, Total=3306 [2024-11-14 05:46:58,210 INFO L432 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:46:58,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:46:58,241 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-14 05:46:58,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:46:58,412 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:177) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertCodeBlock(IncrementalHoareTripleChecker.java:436) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:278) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:284) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.releaseLock(ChainingHoareTripleChecker.java:449) at java.base/java.util.ArrayList$ArrayListSpliterator.forEachRemaining(ArrayList.java:1708) at java.base/java.util.stream.ReferencePipeline$Head.forEach(ReferencePipeline.java:762) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.releaseLock(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:385) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:447) at java.base/java.io.OutputStream.write(OutputStream.java:167) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:125) at java.base/java.io.BufferedOutputStream.implFlush(BufferedOutputStream.java:252) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:246) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:412) at java.base/sun.nio.cs.StreamEncoder.lockedFlush(StreamEncoder.java:214) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:201) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:262) at java.base/java.io.BufferedWriter.implFlush(BufferedWriter.java:372) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:359) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 36 more [2024-11-14 05:46:58,415 INFO L158 Benchmark]: Toolchain (without parser) took 607262.81ms. Allocated memory was 117.4MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 90.4MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 191.9MB. Max. memory is 16.1GB. [2024-11-14 05:46:58,415 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 83.9MB. Free memory is still 39.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 05:46:58,416 INFO L158 Benchmark]: CACSL2BoogieTranslator took 607.01ms. Allocated memory is still 117.4MB. Free memory was 90.4MB in the beginning and 72.9MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 05:46:58,416 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.34ms. Allocated memory is still 117.4MB. Free memory was 72.9MB in the beginning and 70.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 05:46:58,416 INFO L158 Benchmark]: Boogie Preprocessor took 59.81ms. Allocated memory is still 117.4MB. Free memory was 70.9MB in the beginning and 69.6MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 05:46:58,416 INFO L158 Benchmark]: RCFGBuilder took 920.32ms. Allocated memory is still 117.4MB. Free memory was 69.6MB in the beginning and 45.1MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-14 05:46:58,417 INFO L158 Benchmark]: TraceAbstraction took 605588.82ms. Allocated memory was 117.4MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 44.5MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 141.6MB. Max. memory is 16.1GB. [2024-11-14 05:46:58,419 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.48ms. Allocated memory is still 83.9MB. Free memory is still 39.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 607.01ms. Allocated memory is still 117.4MB. Free memory was 90.4MB in the beginning and 72.9MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.34ms. Allocated memory is still 117.4MB. Free memory was 72.9MB in the beginning and 70.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 59.81ms. Allocated memory is still 117.4MB. Free memory was 70.9MB in the beginning and 69.6MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 920.32ms. Allocated memory is still 117.4MB. Free memory was 69.6MB in the beginning and 45.1MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 605588.82ms. Allocated memory was 117.4MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 44.5MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 141.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a81d76a671fec08918102c7898e8919d02b265d05707efa1508363dab4714d44 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 05:47:01,740 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 05:47:01,907 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2024-11-14 05:47:01,923 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 05:47:01,924 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 05:47:01,971 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 05:47:01,972 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 05:47:01,974 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 05:47:01,974 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 05:47:01,975 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 05:47:01,976 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 05:47:01,976 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 05:47:01,977 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 05:47:01,977 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 05:47:01,977 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 05:47:01,977 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 05:47:01,978 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 05:47:01,978 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 05:47:01,978 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 05:47:01,979 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 05:47:01,979 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 05:47:01,979 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 05:47:01,979 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 05:47:01,979 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 05:47:01,979 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 05:47:01,980 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 05:47:01,980 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 05:47:01,980 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 05:47:01,980 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-14 05:47:01,981 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 05:47:01,981 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-14 05:47:01,981 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 05:47:01,981 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 05:47:01,981 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 05:47:01,982 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 05:47:01,983 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 05:47:01,983 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 05:47:01,983 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 05:47:01,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:47:01,984 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 05:47:01,984 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 05:47:01,984 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-14 05:47:01,984 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-14 05:47:01,984 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 05:47:01,984 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 05:47:01,984 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a81d76a671fec08918102c7898e8919d02b265d05707efa1508363dab4714d44 [2024-11-14 05:47:02,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 05:47:02,439 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 05:47:02,442 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 05:47:02,444 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 05:47:02,444 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 05:47:02,446 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i Unable to find full path for "g++" [2024-11-14 05:47:04,799 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 05:47:05,130 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 05:47:05,131 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i [2024-11-14 05:47:05,150 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/data/a395b4ac8/b8dc4c4b986d4dd387db6acb3a706e4d/FLAG8b9437bf4 [2024-11-14 05:47:05,173 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/data/a395b4ac8/b8dc4c4b986d4dd387db6acb3a706e4d [2024-11-14 05:47:05,176 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 05:47:05,178 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 05:47:05,180 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 05:47:05,180 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 05:47:05,187 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 05:47:05,188 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:47:05" (1/1) ... [2024-11-14 05:47:05,189 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@425a72cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:47:05, skipping insertion in model container [2024-11-14 05:47:05,190 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:47:05" (1/1) ... [2024-11-14 05:47:05,231 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:47:05,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:47:05,797 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 05:47:05,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:47:05,941 INFO L204 MainTranslator]: Completed translation [2024-11-14 05:47:05,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:47:05 WrapperNode [2024-11-14 05:47:05,942 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 05:47:05,943 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 05:47:05,943 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 05:47:05,943 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 05:47:05,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:47:05" (1/1) ... [2024-11-14 05:47:05,972 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:47:05" (1/1) ... [2024-11-14 05:47:06,011 INFO L138 Inliner]: procedures = 129, calls = 38, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 113 [2024-11-14 05:47:06,012 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 05:47:06,017 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 05:47:06,017 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 05:47:06,017 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 05:47:06,028 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:47:05" (1/1) ... [2024-11-14 05:47:06,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:47:05" (1/1) ... [2024-11-14 05:47:06,036 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:47:05" (1/1) ... [2024-11-14 05:47:06,036 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:47:05" (1/1) ... [2024-11-14 05:47:06,062 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:47:05" (1/1) ... [2024-11-14 05:47:06,073 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:47:05" (1/1) ... [2024-11-14 05:47:06,079 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:47:05" (1/1) ... [2024-11-14 05:47:06,081 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:47:05" (1/1) ... [2024-11-14 05:47:06,088 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 05:47:06,089 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 05:47:06,093 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 05:47:06,093 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 05:47:06,094 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:47:05" (1/1) ... [2024-11-14 05:47:06,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:47:06,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:47:06,147 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 05:47:06,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 05:47:06,201 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-14 05:47:06,202 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-14 05:47:06,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 05:47:06,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 05:47:06,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 05:47:06,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 05:47:06,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 05:47:06,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 05:47:06,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-14 05:47:06,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-14 05:47:06,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-14 05:47:06,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 05:47:06,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 05:47:06,423 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 05:47:06,426 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 05:47:07,301 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-11-14 05:47:07,304 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 05:47:07,321 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 05:47:07,323 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-14 05:47:07,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:47:07 BoogieIcfgContainer [2024-11-14 05:47:07,324 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 05:47:07,328 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 05:47:07,328 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 05:47:07,334 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 05:47:07,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:47:05" (1/3) ... [2024-11-14 05:47:07,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73d5714b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:47:07, skipping insertion in model container [2024-11-14 05:47:07,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:47:05" (2/3) ... [2024-11-14 05:47:07,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73d5714b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:47:07, skipping insertion in model container [2024-11-14 05:47:07,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:47:07" (3/3) ... [2024-11-14 05:47:07,341 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all_reverse.i [2024-11-14 05:47:07,363 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 05:47:07,366 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_remove_all_reverse.i that has 2 procedures, 100 locations, 1 initial locations, 2 loop locations, and 44 error locations. [2024-11-14 05:47:07,431 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 05:47:07,451 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=None, 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;@4b47d85d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 05:47:07,452 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2024-11-14 05:47:07,457 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 52 states have (on average 2.019230769230769) internal successors, (105), 96 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:47:07,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 05:47:07,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:47:07,467 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 05:47:07,468 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:47:07,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:47:07,476 INFO L85 PathProgramCache]: Analyzing trace with hash 893856306, now seen corresponding path program 1 times [2024-11-14 05:47:07,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:47:07,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [334071702] [2024-11-14 05:47:07,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:47:07,496 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:47:07,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:47:07,501 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:47:07,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-14 05:47:07,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:47:07,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:47:07,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:47:07,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 05:47:07,772 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-14 05:47:07,772 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:47:07,777 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:47:07,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [334071702] [2024-11-14 05:47:07,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [334071702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:47:07,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:47:07,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:47:07,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406487498] [2024-11-14 05:47:07,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:47:07,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:47:07,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:47:07,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:47:07,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:47:07,828 INFO L87 Difference]: Start difference. First operand has 100 states, 52 states have (on average 2.019230769230769) internal successors, (105), 96 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:47:08,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:47:08,195 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2024-11-14 05:47:08,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:47:08,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-14 05:47:08,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:47:08,209 INFO L225 Difference]: With dead ends: 96 [2024-11-14 05:47:08,211 INFO L226 Difference]: Without dead ends: 93 [2024-11-14 05:47:08,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:47:08,219 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 3 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:47:08,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 144 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:47:08,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-14 05:47:08,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-14 05:47:08,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 49 states have (on average 1.8979591836734695) internal successors, (93), 89 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:47:08,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2024-11-14 05:47:08,273 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 6 [2024-11-14 05:47:08,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:47:08,274 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2024-11-14 05:47:08,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:47:08,274 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2024-11-14 05:47:08,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 05:47:08,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:47:08,275 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 05:47:08,280 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-14 05:47:08,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:47:08,478 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:47:08,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:47:08,478 INFO L85 PathProgramCache]: Analyzing trace with hash 893856307, now seen corresponding path program 1 times [2024-11-14 05:47:08,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:47:08,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1090453992] [2024-11-14 05:47:08,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:47:08,479 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:47:08,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:47:08,484 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:47:08,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-14 05:47:08,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:47:08,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 05:47:08,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:47:08,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:47:08,640 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-14 05:47:08,640 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:47:08,641 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:47:08,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1090453992] [2024-11-14 05:47:08,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1090453992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:47:08,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:47:08,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:47:08,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332368118] [2024-11-14 05:47:08,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:47:08,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:47:08,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:47:08,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:47:08,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:47:08,644 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:47:08,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:47:08,953 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2024-11-14 05:47:08,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:47:08,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-14 05:47:08,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:47:08,956 INFO L225 Difference]: With dead ends: 90 [2024-11-14 05:47:08,956 INFO L226 Difference]: Without dead ends: 90 [2024-11-14 05:47:08,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:47:08,958 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 3 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:47:08,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 145 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:47:08,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-14 05:47:08,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-14 05:47:08,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 49 states have (on average 1.836734693877551) internal successors, (90), 86 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:47:08,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2024-11-14 05:47:08,977 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 6 [2024-11-14 05:47:08,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:47:08,981 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2024-11-14 05:47:08,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:47:08,981 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2024-11-14 05:47:08,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-14 05:47:08,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:47:08,982 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:47:08,986 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-14 05:47:09,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:47:09,183 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:47:09,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:47:09,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1178616581, now seen corresponding path program 1 times [2024-11-14 05:47:09,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:47:09,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1471496615] [2024-11-14 05:47:09,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:47:09,186 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:47:09,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:47:09,188 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:47:09,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-14 05:47:09,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:47:09,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 05:47:09,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:47:09,353 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-14 05:47:09,353 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:47:09,353 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:47:09,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1471496615] [2024-11-14 05:47:09,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1471496615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:47:09,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:47:09,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:47:09,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601682314] [2024-11-14 05:47:09,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:47:09,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:47:09,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:47:09,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:47:09,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:47:09,356 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:47:09,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:47:09,380 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2024-11-14 05:47:09,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:47:09,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-14 05:47:09,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:47:09,382 INFO L225 Difference]: With dead ends: 101 [2024-11-14 05:47:09,382 INFO L226 Difference]: Without dead ends: 101 [2024-11-14 05:47:09,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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-14 05:47:09,384 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 10 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:47:09,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 179 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:47:09,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-14 05:47:09,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2024-11-14 05:47:09,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 50 states have (on average 1.82) internal successors, (91), 87 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:47:09,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2024-11-14 05:47:09,395 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 14 [2024-11-14 05:47:09,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:47:09,396 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2024-11-14 05:47:09,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:47:09,396 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2024-11-14 05:47:09,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-14 05:47:09,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:47:09,398 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:47:09,401 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-14 05:47:09,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:47:09,598 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:47:09,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:47:09,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1594689409, now seen corresponding path program 1 times [2024-11-14 05:47:09,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:47:09,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1487090048] [2024-11-14 05:47:09,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:47:09,603 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:47:09,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:47:09,611 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:47:09,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-14 05:47:09,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:47:09,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 05:47:09,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:47:09,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 05:47:09,972 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:47:09,974 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:47:09,974 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:47:09,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1487090048] [2024-11-14 05:47:09,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1487090048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:47:09,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:47:09,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:47:09,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588448445] [2024-11-14 05:47:09,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:47:09,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:47:09,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:47:09,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:47:09,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:47:09,980 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:47:10,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:47:10,652 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2024-11-14 05:47:10,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:47:10,655 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-14 05:47:10,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:47:10,656 INFO L225 Difference]: With dead ends: 90 [2024-11-14 05:47:10,656 INFO L226 Difference]: Without dead ends: 90 [2024-11-14 05:47:10,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:47:10,659 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 6 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:47:10,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 256 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 05:47:10,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-14 05:47:10,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-14 05:47:10,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 50 states have (on average 1.8) internal successors, (90), 86 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:47:10,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2024-11-14 05:47:10,677 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 24 [2024-11-14 05:47:10,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:47:10,677 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2024-11-14 05:47:10,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:47:10,678 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2024-11-14 05:47:10,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-14 05:47:10,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:47:10,678 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:47:10,683 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-14 05:47:10,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:47:10,879 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:47:10,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:47:10,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1594689410, now seen corresponding path program 1 times [2024-11-14 05:47:10,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:47:10,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [426721012] [2024-11-14 05:47:10,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:47:10,881 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:47:10,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:47:10,885 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:47:10,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-14 05:47:11,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:47:11,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 05:47:11,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:47:11,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:47:11,287 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:47:11,287 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:47:11,288 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:47:11,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [426721012] [2024-11-14 05:47:11,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [426721012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:47:11,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:47:11,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:47:11,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308687010] [2024-11-14 05:47:11,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:47:11,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:47:11,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:47:11,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:47:11,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:47:11,292 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:47:12,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:47:12,004 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2024-11-14 05:47:12,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:47:12,007 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-14 05:47:12,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:47:12,011 INFO L225 Difference]: With dead ends: 89 [2024-11-14 05:47:12,011 INFO L226 Difference]: Without dead ends: 89 [2024-11-14 05:47:12,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:47:12,013 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 6 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:47:12,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 280 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 05:47:12,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-14 05:47:12,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-14 05:47:12,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 50 states have (on average 1.78) internal successors, (89), 85 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:47:12,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2024-11-14 05:47:12,027 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 24 [2024-11-14 05:47:12,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:47:12,028 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2024-11-14 05:47:12,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:47:12,028 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2024-11-14 05:47:12,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-14 05:47:12,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:47:12,029 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:47:12,038 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-14 05:47:12,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:47:12,230 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:47:12,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:47:12,230 INFO L85 PathProgramCache]: Analyzing trace with hash -806802942, now seen corresponding path program 1 times [2024-11-14 05:47:12,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:47:12,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [38501502] [2024-11-14 05:47:12,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:47:12,231 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:47:12,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:47:12,235 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:47:12,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-14 05:47:12,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:47:12,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 05:47:12,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:47:12,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 05:47:12,601 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-14 05:47:12,783 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-14 05:47:12,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-14 05:47:12,810 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-14 05:47:12,811 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:47:13,269 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:47:13,269 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:47:13,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [38501502] [2024-11-14 05:47:13,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [38501502] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:47:13,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [715485387] [2024-11-14 05:47:13,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:47:13,270 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:47:13,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:47:13,273 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:47:13,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-14 05:47:13,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:47:13,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-14 05:47:13,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:47:13,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 05:47:13,767 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-14 05:47:13,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-14 05:47:13,855 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:47:13,855 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:47:13,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [715485387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:47:13,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:47:13,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7, 6] total 11 [2024-11-14 05:47:13,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369185938] [2024-11-14 05:47:13,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:47:13,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 05:47:13,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:47:13,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 05:47:13,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=86, Unknown=1, NotChecked=18, Total=132 [2024-11-14 05:47:13,857 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:47:14,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:47:14,971 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2024-11-14 05:47:14,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 05:47:14,972 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2024-11-14 05:47:14,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:47:14,974 INFO L225 Difference]: With dead ends: 94 [2024-11-14 05:47:14,974 INFO L226 Difference]: Without dead ends: 94 [2024-11-14 05:47:14,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=86, Unknown=1, NotChecked=18, Total=132 [2024-11-14 05:47:14,975 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:47:14,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 350 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-14 05:47:14,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-14 05:47:14,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-14 05:47:14,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 54 states have (on average 1.7592592592592593) internal successors, (95), 89 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:47:14,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2024-11-14 05:47:15,001 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 26 [2024-11-14 05:47:15,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:47:15,001 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2024-11-14 05:47:15,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:47:15,002 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2024-11-14 05:47:15,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-14 05:47:15,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:47:15,002 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:47:15,010 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2024-11-14 05:47:15,206 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-14 05:47:15,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:47:15,403 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:47:15,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:47:15,404 INFO L85 PathProgramCache]: Analyzing trace with hash -806802941, now seen corresponding path program 1 times [2024-11-14 05:47:15,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:47:15,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1923398759] [2024-11-14 05:47:15,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:47:15,404 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:47:15,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:47:15,407 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:47:15,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-14 05:47:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:47:15,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-14 05:47:15,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:47:15,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 05:47:15,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:47:15,949 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-14 05:47:16,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:47:16,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 05:47:16,088 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:47:16,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-14 05:47:16,148 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-14 05:47:16,149 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:47:18,509 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:47:18,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1923398759] [2024-11-14 05:47:18,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1923398759] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:47:18,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1935135505] [2024-11-14 05:47:18,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:47:18,510 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:47:18,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:47:18,513 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:47:18,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-11-14 05:47:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:47:18,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-14 05:47:18,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:47:18,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 05:47:18,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:47:19,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:47:19,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 05:47:19,285 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:47:19,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-14 05:47:19,318 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-14 05:47:19,318 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:47:21,485 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)))) (and (or (bvule (bvadd |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv4 32)) .cse0) (forall ((|v_node_create_~temp~0#1.base_35| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_35|))))) (forall ((|v_node_create_~temp~0#1.base_35| (_ BitVec 32))) (or (forall ((v_ArrVal_330 (_ BitVec 32))) (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_35| v_ArrVal_330) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_35|))))))) is different from false [2024-11-14 05:47:21,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1935135505] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:47:21,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051439653] [2024-11-14 05:47:21,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:47:21,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:47:21,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:47:21,496 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:47:21,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-14 05:47:21,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:47:21,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-14 05:47:21,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:47:21,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 05:47:21,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:47:21,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:47:21,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 05:47:21,991 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:47:21,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-14 05:47:22,032 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-14 05:47:22,033 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:47:22,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051439653] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:47:22,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:47:22,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2024-11-14 05:47:22,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988236445] [2024-11-14 05:47:22,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:47:22,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 05:47:22,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:47:22,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 05:47:22,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=70, Unknown=3, NotChecked=34, Total=132 [2024-11-14 05:47:22,311 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:47:23,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:47:23,396 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2024-11-14 05:47:23,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 05:47:23,397 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2024-11-14 05:47:23,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:47:23,398 INFO L225 Difference]: With dead ends: 94 [2024-11-14 05:47:23,398 INFO L226 Difference]: Without dead ends: 94 [2024-11-14 05:47:23,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=31, Invalid=106, Unknown=3, NotChecked=42, Total=182 [2024-11-14 05:47:23,400 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-14 05:47:23,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 238 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 307 Invalid, 0 Unknown, 93 Unchecked, 0.9s Time] [2024-11-14 05:47:23,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-14 05:47:23,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-14 05:47:23,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 54 states have (on average 1.7407407407407407) internal successors, (94), 89 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:47:23,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2024-11-14 05:47:23,407 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 26 [2024-11-14 05:47:23,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:47:23,407 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2024-11-14 05:47:23,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:47:23,408 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2024-11-14 05:47:23,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:47:23,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:47:23,409 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:47:23,415 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-14 05:47:23,614 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2024-11-14 05:47:23,831 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-14 05:47:24,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:47:24,013 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:47:24,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:47:24,014 INFO L85 PathProgramCache]: Analyzing trace with hash 2051607416, now seen corresponding path program 1 times [2024-11-14 05:47:24,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:47:24,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1395888039] [2024-11-14 05:47:24,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:47:24,015 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:47:24,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:47:24,017 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:47:24,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-14 05:47:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:47:24,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 05:47:24,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:47:24,275 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:47:24,275 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:47:24,343 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:47:24,343 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:47:24,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1395888039] [2024-11-14 05:47:24,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1395888039] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:47:24,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1111094321] [2024-11-14 05:47:24,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:47:24,344 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:47:24,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:47:24,347 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:47:24,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2024-11-14 05:47:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:47:24,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 05:47:24,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:47:24,639 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:47:24,639 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:47:24,701 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:47:24,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1111094321] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:47:24,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521204866] [2024-11-14 05:47:24,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:47:24,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:47:24,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:47:24,705 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:47:24,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-14 05:47:24,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:47:24,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 05:47:24,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:47:24,923 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:47:24,923 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:47:24,992 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:47:24,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521204866] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:47:24,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 05:47:24,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 6] total 6 [2024-11-14 05:47:24,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120447995] [2024-11-14 05:47:24,993 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 05:47:24,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:47:24,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:47:24,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:47:24,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:47:24,994 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:47:25,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:47:25,237 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2024-11-14 05:47:25,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:47:25,238 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-11-14 05:47:25,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:47:25,239 INFO L225 Difference]: With dead ends: 94 [2024-11-14 05:47:25,239 INFO L226 Difference]: Without dead ends: 94 [2024-11-14 05:47:25,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:47:25,240 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 1 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:47:25,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 399 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:47:25,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-14 05:47:25,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-14 05:47:25,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 54 states have (on average 1.7222222222222223) internal successors, (93), 89 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:47:25,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2024-11-14 05:47:25,252 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 28 [2024-11-14 05:47:25,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:47:25,253 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2024-11-14 05:47:25,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:47:25,254 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2024-11-14 05:47:25,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-14 05:47:25,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:47:25,255 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:47:25,258 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2024-11-14 05:47:25,458 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-14 05:47:25,674 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-14 05:47:25,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:47:25,856 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:47:25,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:47:25,856 INFO L85 PathProgramCache]: Analyzing trace with hash -829460208, now seen corresponding path program 1 times [2024-11-14 05:47:25,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:47:25,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1446480358] [2024-11-14 05:47:25,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:47:25,857 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:47:25,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:47:25,859 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:47:25,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-14 05:47:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:47:26,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:47:26,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:47:26,113 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 05:47:26,114 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:47:26,137 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2024-11-14 05:47:26,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-14 05:47:26,171 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 05:47:26,171 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:47:26,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1446480358] [2024-11-14 05:47:26,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1446480358] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:47:26,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [790204725] [2024-11-14 05:47:26,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:47:26,172 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:47:26,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:47:26,176 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:47:26,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2024-11-14 05:47:26,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:47:26,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 05:47:26,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:47:26,510 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 05:47:26,510 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:47:26,536 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2024-11-14 05:47:26,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-14 05:47:26,574 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 05:47:26,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [790204725] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:47:26,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509711426] [2024-11-14 05:47:26,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:47:26,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:47:26,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:47:26,577 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:47:26,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-14 05:47:26,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:47:26,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:47:26,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:47:26,781 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 05:47:26,782 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:47:26,808 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2024-11-14 05:47:26,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-14 05:47:26,847 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 05:47:26,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509711426] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:47:26,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 05:47:26,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3, 3, 3, 3] total 3 [2024-11-14 05:47:26,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746430464] [2024-11-14 05:47:26,848 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 05:47:26,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:47:26,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:47:26,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:47:26,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:47:26,850 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:47:27,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:47:27,168 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2024-11-14 05:47:27,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:47:27,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2024-11-14 05:47:27,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:47:27,171 INFO L225 Difference]: With dead ends: 98 [2024-11-14 05:47:27,171 INFO L226 Difference]: Without dead ends: 98 [2024-11-14 05:47:27,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:47:27,172 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 4 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:47:27,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 208 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:47:27,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-14 05:47:27,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-11-14 05:47:27,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 57 states have (on average 1.719298245614035) internal successors, (98), 92 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:47:27,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2024-11-14 05:47:27,178 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 29 [2024-11-14 05:47:27,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:47:27,179 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2024-11-14 05:47:27,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:47:27,179 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2024-11-14 05:47:27,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-14 05:47:27,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:47:27,180 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:47:27,205 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-14 05:47:27,383 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-14 05:47:27,584 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2024-11-14 05:47:27,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 05:47:27,782 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:47:27,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:47:27,782 INFO L85 PathProgramCache]: Analyzing trace with hash -829460207, now seen corresponding path program 1 times [2024-11-14 05:47:27,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:47:27,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [212742930] [2024-11-14 05:47:27,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:47:27,783 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:47:27,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:47:27,786 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:47:27,789 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-14 05:47:28,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:47:28,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 05:47:28,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:47:28,187 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:47:28,188 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:47:28,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:47:28,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2024-11-14 05:47:28,811 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:47:28,811 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:47:28,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [212742930] [2024-11-14 05:47:28,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [212742930] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:47:28,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1203379862] [2024-11-14 05:47:28,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:47:28,812 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:47:28,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:47:28,817 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:47:28,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2024-11-14 05:47:29,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:47:29,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-14 05:47:29,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:47:29,282 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:47:29,283 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:47:29,346 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:47:29,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2024-11-14 05:47:29,617 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:47:29,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1203379862] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:47:29,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238066573] [2024-11-14 05:47:29,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:47:29,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:47:29,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:47:29,620 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:47:29,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-14 05:47:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:47:29,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 05:47:29,818 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:47:29,928 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:47:29,929 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:47:29,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:47:29,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2024-11-14 05:47:30,243 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:47:30,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238066573] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:47:30,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 05:47:30,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 6] total 11 [2024-11-14 05:47:30,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500901905] [2024-11-14 05:47:30,244 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 05:47:30,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 05:47:30,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:47:30,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 05:47:30,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-14 05:47:30,245 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:47:31,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:47:31,163 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2024-11-14 05:47:31,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 05:47:31,164 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2024-11-14 05:47:31,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:47:31,165 INFO L225 Difference]: With dead ends: 101 [2024-11-14 05:47:31,166 INFO L226 Difference]: Without dead ends: 101 [2024-11-14 05:47:31,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-14 05:47:31,166 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 6 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-14 05:47:31,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 576 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-14 05:47:31,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-14 05:47:31,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2024-11-14 05:47:31,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 57 states have (on average 1.7017543859649122) internal successors, (97), 92 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:47:31,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2024-11-14 05:47:31,173 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 29 [2024-11-14 05:47:31,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:47:31,174 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2024-11-14 05:47:31,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:47:31,174 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2024-11-14 05:47:31,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-14 05:47:31,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:47:31,175 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:47:31,184 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-11-14 05:47:31,382 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (19)] Ended with exit code 0 [2024-11-14 05:47:31,597 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-11-14 05:47:31,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:47:31,780 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:47:31,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:47:31,781 INFO L85 PathProgramCache]: Analyzing trace with hash 56537332, now seen corresponding path program 1 times [2024-11-14 05:47:31,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:47:31,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [216179860] [2024-11-14 05:47:31,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:47:31,781 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:47:31,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:47:31,783 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:47:31,785 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-14 05:47:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:47:31,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 05:47:31,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:47:31,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 05:47:32,059 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:47:32,059 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:47:32,059 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:47:32,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [216179860] [2024-11-14 05:47:32,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [216179860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:47:32,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:47:32,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 05:47:32,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128629628] [2024-11-14 05:47:32,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:47:32,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:47:32,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:47:32,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:47:32,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:47:32,061 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:47:32,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:47:32,706 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2024-11-14 05:47:32,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:47:32,707 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-14 05:47:32,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:47:32,708 INFO L225 Difference]: With dead ends: 96 [2024-11-14 05:47:32,708 INFO L226 Difference]: Without dead ends: 96 [2024-11-14 05:47:32,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:47:32,709 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 7 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:47:32,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 285 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 05:47:32,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-14 05:47:32,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-14 05:47:32,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 57 states have (on average 1.6842105263157894) internal successors, (96), 91 states have internal predecessors, (96), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:47:32,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2024-11-14 05:47:32,718 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 30 [2024-11-14 05:47:32,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:47:32,719 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2024-11-14 05:47:32,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:47:32,719 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2024-11-14 05:47:32,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-14 05:47:32,720 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:47:32,720 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:47:32,726 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-14 05:47:32,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:47:32,921 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:47:32,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:47:32,922 INFO L85 PathProgramCache]: Analyzing trace with hash 56537333, now seen corresponding path program 1 times [2024-11-14 05:47:32,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:47:32,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [57224732] [2024-11-14 05:47:32,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:47:32,922 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:47:32,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:47:32,924 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:47:32,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-14 05:47:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:47:33,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-14 05:47:33,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:47:33,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:47:33,329 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:47:33,329 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:47:33,329 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:47:33,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [57224732] [2024-11-14 05:47:33,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [57224732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:47:33,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:47:33,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 05:47:33,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361223353] [2024-11-14 05:47:33,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:47:33,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:47:33,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:47:33,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:47:33,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:47:33,330 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:47:34,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:47:34,046 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2024-11-14 05:47:34,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:47:34,047 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-14 05:47:34,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:47:34,048 INFO L225 Difference]: With dead ends: 95 [2024-11-14 05:47:34,048 INFO L226 Difference]: Without dead ends: 95 [2024-11-14 05:47:34,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:47:34,049 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 7 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:47:34,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 315 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 05:47:34,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-14 05:47:34,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-14 05:47:34,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 57 states have (on average 1.6666666666666667) internal successors, (95), 90 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:47:34,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2024-11-14 05:47:34,055 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 30 [2024-11-14 05:47:34,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:47:34,055 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2024-11-14 05:47:34,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:47:34,055 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2024-11-14 05:47:34,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:47:34,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:47:34,056 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:47:34,062 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-11-14 05:47:34,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:47:34,257 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:47:34,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:47:34,257 INFO L85 PathProgramCache]: Analyzing trace with hash -503813775, now seen corresponding path program 1 times [2024-11-14 05:47:34,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:47:34,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [836292885] [2024-11-14 05:47:34,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:47:34,258 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:47:34,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:47:34,261 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:47:34,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-14 05:47:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:47:34,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:47:34,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:47:34,531 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 05:47:34,531 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:47:34,532 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:47:34,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [836292885] [2024-11-14 05:47:34,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [836292885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:47:34,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:47:34,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:47:34,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875390518] [2024-11-14 05:47:34,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:47:34,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:47:34,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:47:34,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:47:34,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:47:34,534 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:47:34,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:47:34,566 INFO L93 Difference]: Finished difference Result 144 states and 151 transitions. [2024-11-14 05:47:34,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:47:34,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2024-11-14 05:47:34,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:47:34,568 INFO L225 Difference]: With dead ends: 144 [2024-11-14 05:47:34,568 INFO L226 Difference]: Without dead ends: 144 [2024-11-14 05:47:34,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:47:34,569 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 105 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:47:34,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 189 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:47:34,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-14 05:47:34,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 96. [2024-11-14 05:47:34,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 58 states have (on average 1.6551724137931034) internal successors, (96), 91 states have internal predecessors, (96), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:47:34,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2024-11-14 05:47:34,575 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 34 [2024-11-14 05:47:34,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:47:34,575 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2024-11-14 05:47:34,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:47:34,576 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2024-11-14 05:47:34,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:47:34,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:47:34,576 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:47:34,582 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2024-11-14 05:47:34,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:47:34,777 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:47:34,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:47:34,778 INFO L85 PathProgramCache]: Analyzing trace with hash -503813769, now seen corresponding path program 1 times [2024-11-14 05:47:34,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:47:34,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1098813101] [2024-11-14 05:47:34,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:47:34,778 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:47:34,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:47:34,782 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:47:34,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-14 05:47:35,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:47:35,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-14 05:47:35,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:47:35,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 05:47:35,098 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-14 05:47:35,189 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-14 05:47:35,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-14 05:47:35,210 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|)) is different from true [2024-11-14 05:47:35,260 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-14 05:47:35,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-14 05:47:35,309 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 7 not checked. [2024-11-14 05:47:35,309 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:47:35,664 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 05:47:35,665 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:47:35,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1098813101] [2024-11-14 05:47:35,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1098813101] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-14 05:47:35,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:47:35,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-11-14 05:47:35,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953421672] [2024-11-14 05:47:35,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:47:35,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:47:35,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:47:35,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:47:35,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=22, Unknown=2, NotChecked=18, Total=56 [2024-11-14 05:47:35,666 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:47:36,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:47:36,272 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2024-11-14 05:47:36,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:47:36,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2024-11-14 05:47:36,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:47:36,274 INFO L225 Difference]: With dead ends: 120 [2024-11-14 05:47:36,274 INFO L226 Difference]: Without dead ends: 120 [2024-11-14 05:47:36,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=30, Unknown=2, NotChecked=22, Total=72 [2024-11-14 05:47:36,275 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 85 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:47:36,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 138 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 05:47:36,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-14 05:47:36,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 94. [2024-11-14 05:47:36,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 59 states have (on average 1.6101694915254237) internal successors, (95), 89 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:47:36,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2024-11-14 05:47:36,285 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 34 [2024-11-14 05:47:36,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:47:36,286 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2024-11-14 05:47:36,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:47:36,287 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2024-11-14 05:47:36,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:47:36,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:47:36,292 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:47:36,298 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2024-11-14 05:47:36,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:47:36,496 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:47:36,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:47:36,497 INFO L85 PathProgramCache]: Analyzing trace with hash -503813768, now seen corresponding path program 1 times [2024-11-14 05:47:36,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:47:36,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1945552622] [2024-11-14 05:47:36,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:47:36,498 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:47:36,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:47:36,500 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:47:36,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-11-14 05:47:36,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:47:36,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-14 05:47:36,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:47:36,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 05:47:36,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:47:36,847 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-14 05:47:36,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:47:36,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 05:47:36,953 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:47:36,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-14 05:47:37,007 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv12 32)) |c_#length|)) is different from true [2024-11-14 05:47:37,062 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-14 05:47:37,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2024-11-14 05:47:37,370 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-14 05:47:37,371 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:47:37,729 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:47:37,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1945552622] [2024-11-14 05:47:37,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1945552622] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:47:37,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [940176284] [2024-11-14 05:47:37,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:47:37,729 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:47:37,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:47:37,732 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:47:37,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2024-11-14 05:47:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:47:38,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-14 05:47:38,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:47:38,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:47:38,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 05:47:38,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:47:38,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 05:47:38,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 05:47:38,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:47:38,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 05:47:39,287 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 05:47:39,287 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:47:41,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [940176284] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:47:41,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630520138] [2024-11-14 05:47:41,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:47:41,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:47:41,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:47:41,664 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:47:41,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-11-14 05:47:41,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:47:41,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-14 05:47:41,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:47:41,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:47:41,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 05:47:43,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:47:43,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 05:47:43,883 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-14 05:47:43,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-14 05:47:44,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:47:44,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 05:47:44,390 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-11-14 05:47:44,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-14 05:47:44,652 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2024-11-14 05:47:44,652 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:47:45,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630520138] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:47:45,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:47:45,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 20 [2024-11-14 05:47:45,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952280954] [2024-11-14 05:47:45,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:47:45,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-14 05:47:45,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:47:45,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-14 05:47:45,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=472, Unknown=3, NotChecked=90, Total=650 [2024-11-14 05:47:45,341 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand has 21 states, 18 states have (on average 4.111111111111111) internal successors, (74), 17 states have internal predecessors, (74), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-14 05:47:46,633 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv12 32)) |c_#length|)) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) (not (= (_ bv0 32) (bvadd |c_#StackHeapBarrier| (_ bv1 32))))) is different from true [2024-11-14 05:47:49,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:47:51,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:47:53,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:47:56,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:47:58,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:48:00,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:48:02,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:48:04,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:48:07,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:48:08,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:48:10,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:48:11,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:48:14,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:48:16,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:48:19,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:48:20,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:48:23,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:48:23,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:48:23,217 INFO L93 Difference]: Finished difference Result 143 states and 152 transitions. [2024-11-14 05:48:23,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-14 05:48:23,218 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 4.111111111111111) internal successors, (74), 17 states have internal predecessors, (74), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 34 [2024-11-14 05:48:23,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:48:23,219 INFO L225 Difference]: With dead ends: 143 [2024-11-14 05:48:23,219 INFO L226 Difference]: Without dead ends: 143 [2024-11-14 05:48:23,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=164, Invalid=966, Unknown=4, NotChecked=198, Total=1332 [2024-11-14 05:48:23,221 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 232 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 17 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 311 IncrementalHoareTripleChecker+Unchecked, 36.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:48:23,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 469 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 559 Invalid, 13 Unknown, 311 Unchecked, 36.2s Time] [2024-11-14 05:48:23,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-14 05:48:23,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 95. [2024-11-14 05:48:23,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 89 states have internal predecessors, (94), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:48:23,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2024-11-14 05:48:23,228 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 34 [2024-11-14 05:48:23,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:48:23,228 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2024-11-14 05:48:23,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 4.111111111111111) internal successors, (74), 17 states have internal predecessors, (74), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-14 05:48:23,229 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2024-11-14 05:48:23,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-14 05:48:23,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:48:23,230 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:48:23,253 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2024-11-14 05:48:23,435 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2024-11-14 05:48:23,635 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2024-11-14 05:48:23,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:48:23,831 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:48:23,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:48:23,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1561642366, now seen corresponding path program 1 times [2024-11-14 05:48:23,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:48:23,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [401349675] [2024-11-14 05:48:23,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:48:23,832 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:48:23,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:48:23,835 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:48:23,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2024-11-14 05:48:24,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:48:24,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-14 05:48:24,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:48:24,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 05:48:25,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-14 05:48:25,168 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:48:25,168 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:48:25,168 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:48:25,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [401349675] [2024-11-14 05:48:25,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [401349675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:48:25,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:48:25,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-14 05:48:25,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544303454] [2024-11-14 05:48:25,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:48:25,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 05:48:25,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:48:25,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 05:48:25,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-14 05:48:25,170 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:48:29,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:48:29,162 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2024-11-14 05:48:29,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 05:48:29,163 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2024-11-14 05:48:29,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:48:29,164 INFO L225 Difference]: With dead ends: 117 [2024-11-14 05:48:29,164 INFO L226 Difference]: Without dead ends: 117 [2024-11-14 05:48:29,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-14 05:48:29,165 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 51 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-14 05:48:29,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 350 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-14 05:48:29,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-14 05:48:29,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 96. [2024-11-14 05:48:29,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 90 states have internal predecessors, (96), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:48:29,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2024-11-14 05:48:29,170 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 35 [2024-11-14 05:48:29,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:48:29,171 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2024-11-14 05:48:29,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:48:29,171 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2024-11-14 05:48:29,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-14 05:48:29,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:48:29,172 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:48:29,178 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0 [2024-11-14 05:48:29,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:48:29,372 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:48:29,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:48:29,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1561642367, now seen corresponding path program 1 times [2024-11-14 05:48:29,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:48:29,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [294740892] [2024-11-14 05:48:29,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:48:29,374 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:48:29,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:48:29,378 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:48:29,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2024-11-14 05:48:29,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:48:29,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-14 05:48:29,689 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:48:29,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:48:31,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-14 05:48:31,341 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:48:31,341 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:48:31,342 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:48:31,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [294740892] [2024-11-14 05:48:31,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [294740892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:48:31,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:48:31,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-14 05:48:31,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562736159] [2024-11-14 05:48:31,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:48:31,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 05:48:31,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:48:31,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 05:48:31,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-14 05:48:31,344 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:48:34,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:48:34,944 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2024-11-14 05:48:34,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 05:48:34,946 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2024-11-14 05:48:34,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:48:34,946 INFO L225 Difference]: With dead ends: 123 [2024-11-14 05:48:34,946 INFO L226 Difference]: Without dead ends: 123 [2024-11-14 05:48:34,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-14 05:48:34,947 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 61 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:48:34,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 426 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-14 05:48:34,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-14 05:48:34,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 96. [2024-11-14 05:48:34,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 90 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:48:34,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2024-11-14 05:48:34,953 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 35 [2024-11-14 05:48:34,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:48:34,954 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2024-11-14 05:48:34,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:48:34,954 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2024-11-14 05:48:34,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-14 05:48:34,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:48:34,955 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:48:34,961 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Ended with exit code 0 [2024-11-14 05:48:35,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:48:35,156 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:48:35,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:48:35,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1843060032, now seen corresponding path program 1 times [2024-11-14 05:48:35,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:48:35,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2047689017] [2024-11-14 05:48:35,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:48:35,157 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:48:35,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:48:35,160 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:48:35,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2024-11-14 05:48:35,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:48:35,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-14 05:48:35,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:48:36,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:48:37,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:48:37,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:48:37,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2024-11-14 05:48:38,098 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 05:48:38,098 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:48:38,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-11-14 05:48:40,192 INFO L349 Elim1Store]: treesize reduction 13, result has 62.9 percent of original size [2024-11-14 05:48:40,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 125 [2024-11-14 05:48:40,749 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2024-11-14 05:48:40,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-14 05:48:41,001 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 05:48:41,001 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:48:41,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2047689017] [2024-11-14 05:48:41,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2047689017] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:48:41,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [241606229] [2024-11-14 05:48:41,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:48:41,002 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:48:41,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:48:41,005 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:48:41,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2024-11-14 05:48:41,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:48:41,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-14 05:48:41,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:48:43,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:48:45,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:48:45,854 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:48:45,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 14 [2024-11-14 05:48:45,909 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:48:45,909 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:48:46,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-11-14 05:48:47,342 INFO L349 Elim1Store]: treesize reduction 13, result has 62.9 percent of original size [2024-11-14 05:48:47,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 125 [2024-11-14 05:48:47,755 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2024-11-14 05:48:47,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-14 05:48:48,018 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 05:48:48,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [241606229] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:48:48,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229957709] [2024-11-14 05:48:48,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:48:48,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:48:48,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:48:48,021 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:48:48,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-11-14 05:48:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:48:48,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-14 05:48:48,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:48:48,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:48:48,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:48:48,971 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:48:48,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2024-11-14 05:48:49,046 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:48:49,046 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:48:49,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-11-14 05:48:49,583 INFO L349 Elim1Store]: treesize reduction 13, result has 62.9 percent of original size [2024-11-14 05:48:49,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 125 [2024-11-14 05:48:49,892 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2024-11-14 05:48:49,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-14 05:48:50,080 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 05:48:50,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229957709] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:48:50,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 05:48:50,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 16, 10, 15, 10] total 35 [2024-11-14 05:48:50,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475564856] [2024-11-14 05:48:50,080 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 05:48:50,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-14 05:48:50,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:48:50,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-14 05:48:50,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1147, Unknown=0, NotChecked=0, Total=1260 [2024-11-14 05:48:50,083 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand has 36 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 33 states have internal predecessors, (68), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-14 05:49:03,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:49:03,498 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2024-11-14 05:49:03,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-14 05:49:03,499 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 33 states have internal predecessors, (68), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 39 [2024-11-14 05:49:03,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:49:03,500 INFO L225 Difference]: With dead ends: 138 [2024-11-14 05:49:03,500 INFO L226 Difference]: Without dead ends: 138 [2024-11-14 05:49:03,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=231, Invalid=2219, Unknown=0, NotChecked=0, Total=2450 [2024-11-14 05:49:03,502 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 189 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2024-11-14 05:49:03,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 841 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1162 Invalid, 0 Unknown, 0 Unchecked, 9.8s Time] [2024-11-14 05:49:03,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-14 05:49:03,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 99. [2024-11-14 05:49:03,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 71 states have (on average 1.408450704225352) internal successors, (100), 93 states have internal predecessors, (100), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:49:03,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2024-11-14 05:49:03,509 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 39 [2024-11-14 05:49:03,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:49:03,509 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2024-11-14 05:49:03,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 33 states have internal predecessors, (68), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-14 05:49:03,509 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2024-11-14 05:49:03,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-14 05:49:03,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:49:03,510 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:49:03,517 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2024-11-14 05:49:03,715 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2024-11-14 05:49:03,929 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2024-11-14 05:49:04,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:49:04,112 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 05:49:04,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:49:04,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1843060031, now seen corresponding path program 1 times [2024-11-14 05:49:04,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:49:04,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1226263576] [2024-11-14 05:49:04,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:49:04,112 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:49:04,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:49:04,115 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:49:04,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2024-11-14 05:49:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:49:04,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-14 05:49:04,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:49:05,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:49:05,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:49:07,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:49:07,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2024-11-14 05:49:07,231 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 05:49:07,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-11-14 05:49:07,773 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 05:49:07,773 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:49:58,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:49:59,150 INFO L349 Elim1Store]: treesize reduction 27, result has 57.1 percent of original size [2024-11-14 05:49:59,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 284 treesize of output 259 [2024-11-14 05:50:01,397 INFO L349 Elim1Store]: treesize reduction 37, result has 66.7 percent of original size [2024-11-14 05:50:01,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 560 treesize of output 535 [2024-11-14 05:50:08,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 186 [2024-11-14 05:50:08,895 INFO L224 Elim1Store]: Index analysis took 101 ms [2024-11-14 05:50:11,419 INFO L349 Elim1Store]: treesize reduction 37, result has 66.7 percent of original size [2024-11-14 05:50:11,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 360 treesize of output 355 [2024-11-14 05:50:16,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:50:16,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2024-11-14 05:50:19,778 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:50:19,778 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:50:19,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1226263576] [2024-11-14 05:50:19,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1226263576] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:50:19,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [624125686] [2024-11-14 05:50:19,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:50:19,779 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:50:19,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:50:19,783 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:50:19,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c5128e-03cf-4e6a-a4d3-5eea50396964/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2024-11-14 05:50:20,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:50:20,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-14 05:50:20,212 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:50:26,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:50:26,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:50:31,665 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:50:31,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 19 [2024-11-14 05:50:31,885 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 05:50:31,885 INFO L311 TraceCheckSpWp]: Computing backward predicates...